LEADER 06875nam 22007575 450 001 996465435403316 005 20200701080558.0 010 $a3-540-44618-4 024 7 $a10.1007/3-540-44618-4 035 $a(CKB)1000000000211288 035 $a(SSID)ssj0000322215 035 $a(PQKBManifestationID)11232346 035 $a(PQKBTitleCode)TC0000322215 035 $a(PQKBWorkID)10283504 035 $a(PQKB)10761889 035 $a(DE-He213)978-3-540-44618-7 035 $a(MiAaPQ)EBC3073253 035 $a(PPN)155177796 035 $a(EXLCZ)991000000000211288 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCONCUR 2000 - Concurrency Theory$b[electronic resource] $e11th International Conference, University Park, PA, USA, August 22-25, 2000 Proceedings /$fedited by Catuscia Palamidessi 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (XI, 613 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1877 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-67897-2 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Talks -- Combining Theorem Proving and Model Checking through Symbolic Analysis -- Verification Is Experimentation! -- Compositional Performance Analysis Using Probabilistic I/O Automata -- Formal Models for Communication-Based Design -- Invited Tutorials -- Programming Access Control: The Klaim Experience -- Exploiting Hierarchical Structure for Efficient Formal Verification -- From Process Calculi to Process Frameworks -- Verification Using Tabled Logic Programming -- Accepted Papers -- Open Systems in Reactive Environments: Control and Synthesis -- Model Checking with Finite Complete Prefixes Is PSPACE-Complete -- Verifying Quantitative Properties of Continuous Probabilistic Timed Automata -- The Impressive Power of Stopwatches -- Optimizing Büchi Automata -- Generalized Model Checking: Reasoning about Partial State Spaces -- Reachability Analysis for Some Models of Infinite-State Transition Systems -- Process Spaces -- Failure Semantics for the Exchange of Information in Multi-Agent Systems -- Proof-Outlines for Threads in Java -- Deriving Bisimulation Congruences for Reactive Systems -- Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic -- Process Languages for Rooted Eager Bisimulation -- Action Contraction -- A Theory of Testing for Markovian Processes -- Reasoning about Probabilistic Lossy Channel Systems -- Weak Bisimulation for Probabilistic Systems -- Nondeterminism and Probabilistic Choice: Obeying the Laws -- Secrecy and Group Creation -- On the Reachability Problem in Cryptographic Protocols -- Secure Information Flow for Concurrent Processes -- LP Deadlock Checking Using Partial Order Dependencies -- Pomsets for Local Trace Languages -- Functional Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs -- The Control of Synchronous Systems -- Typing Non-uniform Concurrent Objects -- An Implicitly-Typed Deadlock-Free Process Calculus -- Typed Mobile Objects -- Synthesizing Distributed Finite-State Systems from MSCs -- Emptiness Is Decidable for Asynchronous Cellular Machines -- Revisiting Safety and Liveness in the Context of Failures -- Well-Abstracted Transition Systems -- A Unifying Approach to Data-Independence -- Chi Calculus with Mismatch. 330 $aThis volume contains the proceedings of the 11th International Conference on Concurrency Theory (CONCUR 2000) held in State College, Pennsylvania, USA, during 22-25 August 2000. The purpose of the CONCUR conferences is to bring together researchers, developers, and students in order to advance the theory of concurrency and promote its applications. Interest in this topic is continuously growing, as a consequence of the importance and ubiquity of concurrent systems and their - plications, and of the scienti?c relevance of their foundations. The scope covers all areas of semantics, logics, and veri?cation techniques for concurrent systems. Topics include concurrency related aspects of: models of computation, semantic domains, process algebras, Petri nets, event structures, real-time systems, hybrid systems, decidability, model-checking, veri?cation techniques, re?nement te- niques, term and graph rewriting, distributed programming, logic constraint p- gramming, object-oriented programming, typing systems and algorithms, case studies, tools, and environments for programming and veri?cation. The ?rst two CONCUR conferences were held in Amsterdam (NL) in 1990 and 1991. The following ones in Stony Brook (USA), Hildesheim (D), Uppsala (S), Philadelphia (USA), Pisa (I), Warsaw (PL), Nice (F), and Eindhoven (NL). The proceedings have appeared in Springer LNCS, as Volumes 458, 527, 630, 715, 836, 962, 1119, 1243, 1466, and 1664. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1877 606 $aArchitecture, Computer 606 $aProgramming languages (Electronic computers) 606 $aComputer logic 606 $aComputers 606 $aComputer programming 606 $aComputer communication systems 606 $aComputer System Implementation$3https://scigraph.springernature.com/ontologies/product-market-codes/I13057 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 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 Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 615 0$aArchitecture, Computer. 615 0$aProgramming languages (Electronic computers). 615 0$aComputer logic. 615 0$aComputers. 615 0$aComputer programming. 615 0$aComputer communication systems. 615 14$aComputer System Implementation. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aLogics and Meanings of Programs. 615 24$aComputation by Abstract Devices. 615 24$aProgramming Techniques. 615 24$aComputer Communication Networks. 676 $a003.3 702 $aPalamidessi$b Catuscia$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465435403316 996 $aCONCUR 2000 -concurrency theory$9878931 997 $aUNISA