LEADER 06034nam 22007215 450 001 996465630203316 005 20200704234927.0 010 $a3-540-70625-9 024 7 $a10.1007/3-540-61604-7 035 $a(CKB)1000000000234505 035 $a(SSID)ssj0000322222 035 $a(PQKBManifestationID)11256001 035 $a(PQKBTitleCode)TC0000322222 035 $a(PQKBWorkID)10286722 035 $a(PQKB)10180748 035 $a(DE-He213)978-3-540-70625-0 035 $a(PPN)155182617 035 $a(EXLCZ)991000000000234505 100 $a20121227d1996 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCONCUR '96: Concurrency Theory$b[electronic resource] $e7th International Conference, Pisa, Italy, August 26 - 29, 1996. Proceedings /$fedited by Ugo Montanari, Vladimiro Sassone 205 $a1st ed. 1996. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1996. 215 $a1 online resource (XIII, 759 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1119 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-61604-7 327 $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. 330 $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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1119 606 $aComputers 606 $aArchitecture, Computer 606 $aSoftware engineering 606 $aComputer logic 606 $aProgramming languages (Electronic computers) 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aComputer System Implementation$3https://scigraph.springernature.com/ontologies/product-market-codes/I13057 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 615 0$aComputers. 615 0$aArchitecture, Computer. 615 0$aSoftware engineering. 615 0$aComputer logic. 615 0$aProgramming languages (Electronic computers). 615 14$aTheory of Computation. 615 24$aComputer System Implementation. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aLogics and Meanings of Programs. 615 24$aComputation by Abstract Devices. 615 24$aProgramming Languages, Compilers, Interpreters. 676 $a004.0151 702 $aMontanari$b Ugo$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSassone$b Vladimiro$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465630203316 996 $aCONCUR '96: Concurrency Theory$92830951 997 $aUNISA