000 04966nam a22005775i 4500
001 978-3-540-70625-0
003 DE-He213
005 20160624102102.0
007 cr nn 008mamaa
008 121227s1996 gw | s |||| 0|eng d
020 _a9783540706250
_9978-3-540-70625-0
024 7 _a10.1007/3-540-61604-7
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
245 1 0 _aCONCUR '96: Concurrency Theory
_h[electronic resource] :
_b7th International Conference Pisa, Italy, August 26–29, 1996 Proceedings /
_cedited by Ugo Montanari, Vladimiro Sassone.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1996.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1996.
300 _aXIII, 759 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1119
505 0 _aRetracing some paths in process algebra -- Process calculus based upon evaluation to committed form -- A process algebra with distributed priorities -- Symbolic transition graph with assignment -- Models for concurrent constraint programming -- Comparing transition systems with independence and asynchronous transition systems -- A presheaf semantics of value-passing processes -- Elementary control structures -- On transformations of concurrent object programs -- On bisimulations for the asynchronous ?-calculus -- On the expressiveness of internal mobility in name-passing calculi -- Decoding choice encodings -- Infinite results -- Decidability of bisimulation equivalence for normed pushdown processes -- The modal mu-calculus alternation hierarchy is strict -- Bisimulation collapse and the process taxonomy -- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic -- A Facile tutorial -- Testing probabilistic automata -- Extended Markovian Process Algebra -- Rewriting logic as a semantic framework for concurrency: a progress report -- Truly concurrent constraint programming -- Constraints as processes -- A calculus of mobile agents -- Algebraic interpretation of lambda calculus with resources -- Concurrent graph and term graph rewriting -- Petri boxes and finite precedence -- Constrained properties, semilinear systems, and Petri nets -- Linear constraint systems as high-level nets -- A space-efficient on-the-fly algorithm for real-time model checking -- State equivalences for rectangular hybrid automata -- Verifying abstractions of timed systems -- Towards automatic temporal logic verification of value passing process algebra using abstract interpretation -- Modelling and verification of Distributed Algorithms -- An algorithmic approach for checking closure properties of ?-regular languages -- Towards automata for branching time and partial order -- Asynchronous cellular automata for pomsets without auto-concurrency -- Action refinement and property inheritance in systems of sequential agents -- A calculus for concurrent objects -- Refinement in Interworkings -- Equivalences of Statecharts -- Modular verification for shared-variable concurrent programs -- The impact of hardware models on shared memory consistency conditions -- Synchronous development of asynchronous systems.
520 _aThis book constitutes the refereed proceedings of the 7th International Conference on Concurrency Theory, CONCUR '96, held in Pisa, Italy, in August 1996. The volume presents 37 revised full papers selected from a total of 133 submissions; also included are seven invited papers. The contributions are grouped into topical sections on process algebras, categorical approaches, the pi-calculus, decidability and complexity, probability, functional and constraint programming, Petri nets, verification, automata and causality, practical models, and shared-memory systems.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aLogic design.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aProgramming Techniques.
650 2 4 _aComputer Communication Networks.
700 1 _aMontanari, Ugo.
_eeditor.
700 1 _aSassone, Vladimiro.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540616047
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1119
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-61604-7
942 _2EBK7419
_cEBK
999 _c36713
_d36713