LEADER 06696nam 22007935 450 001 9910483851903321 005 20251226203236.0 010 $a3-540-37377-2 024 7 $a10.1007/11817949 035 $a(CKB)1000000000233071 035 $a(SSID)ssj0000316969 035 $a(PQKBManifestationID)11237052 035 $a(PQKBTitleCode)TC0000316969 035 $a(PQKBWorkID)10287317 035 $a(PQKB)11415807 035 $a(DE-He213)978-3-540-37377-3 035 $a(MiAaPQ)EBC3068163 035 $a(PPN)123137373 035 $a(EXLCZ)991000000000233071 100 $a20100301d2006 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCONCUR 2006 - Concurrency Theory $e17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006 /$fedited by Christel Baier, Holger Hermanns 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XIII, 525 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4137 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-37376-4 320 $aIncludes bibliographical references and index. 327 $aInvited Contributions -- Modeling Timed Concurrent Systems -- Some Remarks on Definability of Process Graphs -- Sanity Checks in Formal Verification -- Invited Tutorials -- Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi -- Probability and Nondeterminism in Operational Models of Concurrency -- Model Checking -- A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems -- Proving Liveness by Backwards Reachability -- Model Checking Quantified Computation Tree Logic -- Process Calculi -- Liveness, Fairness and Impossible Futures -- Checking a Mutex Algorithm in a Process Algebra with Fairness -- A Complete Axiomatic Semantics for the CSP Stable-Failures Model -- Transition Systems of Elementary Net Systems with Localities -- Minimization and Equivalence Checking -- Operational Determinism and Fast Algorithms -- Minimization, Learning, and Conformance Testing of Boolean Programs -- A Capability Calculus for Concurrency and Determinism -- Types -- A New Type System for Deadlock-Free Processes -- Sortings for Reactive Systems -- Dynamic Access Control in a Concurrent Object Calculus -- Semantics -- Concurrent Rewriting for Graphs with Equivalences -- Event Structure Semantics for Nominal Calculi -- Encoding ?Duce in the ??-Calculus -- Probability -- A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification -- Probabilistic I/O Automata: Theories of Two Equivalences -- Reachability in Recursive Markov Decision Processes -- Strategy Improvement for Stochastic Rabin and Streett Games -- Bisimulation and Simulation -- Weak Bisimulation Up to Elaboration -- Generic Forward and Backward Simulations -- On Finite Alphabets and Infinite Bases III: Simulation -- Real Time -- Inference of Event-Recording Automata Using Timed Decision Trees -- Controller Synthesis for MTL Specifications -- On Interleaving in Timed Automata -- Formal Languages -- A Language for Task Orchestration and Its Semantic Properties -- Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words -- Second-Order Simple Grammars. 330 $aThis volume contains the proceedings of the 17th International Conference on Concurrency Theory (CONCUR) held in Bonn, Germany, August 27?30, 2006. The purpose of the CONCUR conference series 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 applications and the scientific relevance of their foundations. The scope of CONCUR covers all areas of semantics, logics, and verification techniques for concurrent systems. Topics include basic models and logics of concurrent and distributed computation (such as process algebras, Petri nets, domain theoretic or game theoretic models, modal and temporal logics), specialized models or classes of systems (such as circuits, synchronous systems, real-time and hybrid systems, stochastic systems, databases, mobile and migrating systems, parametric protocols, security protocols), related verification techniques and tools (such as staff space exploration, model-checking, synthesis, abstraction, automated deduction, testing), and related programming models (such as distributed, constraint- or object-oriented, graph rewriting, as well as associated typesystems, static analyses, abstract machines, and environments). This volume starts with five invited papers covering the invited lectures and tutorials of the conference. The remaining 29 papers were selected by the Programme Committee out of 101 submissions after a very intensive reviewing and discussion phase. We would like to thank the members of the Programme Committee and the external reviewers for their excellent and hard work. The conference programme contained three invited lectures and two invited tutorials. . 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4137 606 $aComputer systems 606 $aComputer science 606 $aCompilers (Computer programs) 606 $aComputer programming 606 $aComputer networks 606 $aComputer System Implementation 606 $aComputer Science Logic and Foundations of Programming 606 $aTheory of Computation 606 $aCompilers and Interpreters 606 $aProgramming Techniques 606 $aComputer Communication Networks 615 0$aComputer systems. 615 0$aComputer science. 615 0$aCompilers (Computer programs). 615 0$aComputer programming. 615 0$aComputer networks. 615 14$aComputer System Implementation. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aTheory of Computation. 615 24$aCompilers and Interpreters. 615 24$aProgramming Techniques. 615 24$aComputer Communication Networks. 676 $a004/.35 701 $aBaier$b Christel$0312039 701 $aHermanns$b Holger$f1967-$0555144 712 12$aInternational Conference on Concurrency Theory 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483851903321 996 $aCONCUR 2006 - Concurrency Theory$94522719 997 $aUNINA