LEADER 05157nam 22006975 450 001 9910483383303321 005 20230222112257.0 010 $a3-540-85361-8 024 7 $a10.1007/978-3-540-85361-9 035 $a(CKB)1000000000490459 035 $a(SSID)ssj0000316971 035 $a(PQKBManifestationID)11258586 035 $a(PQKBTitleCode)TC0000316971 035 $a(PQKBWorkID)10288394 035 $a(PQKB)10783247 035 $a(DE-He213)978-3-540-85361-9 035 $a(MiAaPQ)EBC3063358 035 $a(MiAaPQ)EBC6280872 035 $a(PPN)128126108 035 $a(EXLCZ)991000000000490459 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCONCUR 2008 - Concurrency Theory $e19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008, Proceedings /$fedited by Franck van Breugel, Marsha Chechik 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XIII, 524 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5201 300 $aInternational conference proceedings. 311 $a3-540-85360-X 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- Beyond Nash Equilibrium: Solution Concepts for the 21st Century -- Service Choreography and Orchestration with Conversations -- Knowledge and Information in Probabilistic Systems -- Taming Concurrency: A Program Verification Perspective -- Contributed Papers -- A Model of Dynamic Separation for Transactional Memory -- Completeness and Nondeterminism in Model Checking Transactional Memories -- Semantics of Deterministic Shared-Memory Systems -- A Scalable and Oblivious Atomicity Assertion -- R-Automata -- Distributed Timed Automata with Independently Evolving Clocks -- A Context-Free Process as a Pushdown Automaton -- Modeling Computational Security in Long-Lived Systems -- Contract-Directed Synthesis of Simple Orchestrators -- Environment Assumptions for Synthesis -- Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning -- SYCRAFT: A Tool for Synthesizing Distributed Fault-Tolerant Programs -- Subsequence Invariants -- Invariants for Parameterised Boolean Equation Systems -- Unfolding-Based Diagnosis of Systems with an Evolving Topology -- On the Construction of Sorted Reactive Systems -- Dynamic Partial Order Reduction Using Probe Sets -- A Space-Efficient Probabilistic Simulation Algorithm -- Least Upper Bounds for Probability Measures and Their Applications to Abstractions -- Abstraction for Stochastic Systems by Erlang?s Method of Stages -- On the Minimisation of Acyclic Models -- Quasi-Static Scheduling of Communicating Tasks -- Strategy Construction for Parity Games with Imperfect Information -- Mixing Lossy and Perfect Fifo Channels -- On the Reachability Analysis of Acyclic Networks of Pushdown Systems -- Spatial and Behavioral Types in the Pi-Calculus -- A Spatial Equational Logic for the Applied ?-Calculus -- Structured Interactional Exceptions in Session Types -- Global Progress in Dynamically Interleaved Multiparty Sessions -- Normed BPA vs. Normed BPP Revisited -- A Rule Format for Associativity -- Deriving Structural Labelled Transitions for Mobile Ambients -- Termination Problems in Chemical Kinetics -- Towards a Unified Approach to Encodability and Separation Results for Process Calculi -- A Notion of Glue Expressiveness for Component-Based Systems. 330 $aThis book constitutes the refereed proceedings of the 19th International Conference on Concurrency Theory, CONCUR 2008, held in Toronto, Canada, August 19-22, 2008. The 33 revised full papers presented together with 2 tool papers were carefully reviewed and selected from 120 submissions. The topics include model checking, process calculi, minimization and equivalence checking, types, semantics, probability, bisimulation and simulation, real time, and formal languages. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5201 606 $aComputer programming 606 $aComputer networks 606 $aComputer science 606 $aProgramming Techniques 606 $aComputer Communication Networks 606 $aTheory of Computation 606 $aComputer Science Logic and Foundations of Programming 615 0$aComputer programming. 615 0$aComputer networks. 615 0$aComputer science. 615 14$aProgramming Techniques. 615 24$aComputer Communication Networks. 615 24$aTheory of Computation. 615 24$aComputer Science Logic and Foundations of Programming. 676 $a004 702 $avan Breugel$b Franck$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aChechik$b Marsha$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483383303321 996 $aCONCUR 2008 - Concurrency Theory$9774462 997 $aUNINA