LEADER 05725nam 22008055 450 001 9910768179203321 005 20200705002733.0 010 $a3-540-45694-5 024 7 $a10.1007/3-540-45694-5 035 $a(CKB)1000000000212001 035 $a(SSID)ssj0000322217 035 $a(PQKBManifestationID)11268103 035 $a(PQKBTitleCode)TC0000322217 035 $a(PQKBWorkID)10286720 035 $a(PQKB)10028041 035 $a(DE-He213)978-3-540-45694-0 035 $a(MiAaPQ)EBC3072814 035 $a(PPN)155184717 035 $a(EXLCZ)991000000000212001 100 $a20121227d2002 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCONCUR 2002 - Concurrency Theory $e13th International Conference, Brno, Czech Republic, August 20-23, 2002. Proceedings /$fedited by Lubos Brim, Petr Jancar, Mojmir Kretinsky, Antonin Kucera 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (XII, 609 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2421 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-44043-7 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Talks -- Refinement and Verification Applied to an In-Flight Data Acquisition Unit* -- A Deductive Proof System for CTL* -- Event-State Duality: The Enriched Case -- Expressive Power of Temporal Logics -- Types, or: Where?s the Difference Between CCS and ?? -- Invited Tutorials -- to Modal and Temporal Mu-Calculi -- Types for Cryptographic Protocols -- Verification, Model Checking -- Network Invariants in Action* -- Regular Model Checking Made Simple and Effcient* -- A Hierarchy of Polynomial-Time Computable Simulations for Automata -- A Decidable Class of Asynchronous Distributed Controllers -- Alphabet-Based Synchronisation is Exponentially Cheaper -- Safe Realizability of High-Level Message Sequence Charts* -- Widening the Boundary between Decidable and Undecidable Hybrid Systems* -- Logic -- A Spatial Logic for Concurrency (Part II) -- Reducing Model Checking from Multi-valued CTL* to CTL* -- Local Model Checking Games for Fixed Point Logic with Chop -- A Decidable Fixpoint Logic for Time-Outs* -- Mobility -- A Calculus of Mobile Resources* -- Using Ambients to Control Resources* -- Typing and Subtyping Mobility in Boxed Ambients* -- Orchestrating Transactions in Join Calculus* -- Probabilistic Systems -- Simulation for Continuous-Time Markov Chains -- Weak Bisimulation is Sound and Complete for PCTL* -- Decision Algorithms for Probabilistic Bisimulation* -- Models of Computation, Process Algebra -- Axiomatizing an Algebra of Step Reactions for Synchronous Languages -- Regular Sets of Pomsets with Autoconcurrency -- The Fusion Machine -- HOPLA?A Higher-Order Process Language -- A First Order Coalgebraic Model of ?-Calculus Early Observational Equivalence* -- Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes -- Security -- A Framework for the Analysis of Security Protocols* -- On Name Generation and Set-Based Analysis in the Dolev-Yao Model -- On the Decidability of Cryptographic Protocols with Open-Ended Data Structures -- Petri Nets -- Causality Semantics of Petri Nets with Weighted Inhibitor Arcs -- Refinement-Robust Fairness -- Bisimulation -- Decidability of Strong Bisimilarity for Timed BPP -- Undecidability of Weak Bisimilarity for Pushdown Processes -- Why Is Simulation Harder than Bisimulation?. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2421 606 $aComputers 606 $aArchitecture, Computer 606 $aComputer logic 606 $aProgramming languages (Electronic computers) 606 $aComputer programming 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 $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 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 615 0$aComputers. 615 0$aArchitecture, Computer. 615 0$aComputer logic. 615 0$aProgramming languages (Electronic computers). 615 0$aComputer programming. 615 14$aTheory of Computation. 615 24$aComputer System Implementation. 615 24$aLogics and Meanings of Programs. 615 24$aComputation by Abstract Devices. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aProgramming Techniques. 676 $a004.35 702 $aBrim$b Lubos$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aJancar$b Petr$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKretinsky$b Mojmir$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKucera$b Antonin$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Conference on Concurrency Theory 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910768179203321 996 $aCONCUR 2002 - concurrency theory$9981577 997 $aUNINA