LEADER 05416nam 22007935 450 001 9910144026803321 005 20200706221826.0 010 $a3-540-45187-0 024 7 $a10.1007/b11938 035 $a(CKB)1000000000212113 035 $a(SSID)ssj0000322218 035 $a(PQKBManifestationID)11247765 035 $a(PQKBTitleCode)TC0000322218 035 $a(PQKBWorkID)10281256 035 $a(PQKB)10018676 035 $a(DE-He213)978-3-540-45187-7 035 $a(MiAaPQ)EBC3087270 035 $a(PPN)155164600 035 $a(EXLCZ)991000000000212113 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCONCUR 2003 - Concurrency Theory $e14th International Conference, Marseille, France, September 3-5, 2003, Proceedings /$fedited by Roberto Amadio, Denis Lugiez 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (XI, 524 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2761 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-40753-7 320 $aIncludes bibliographical references and index. 327 $aPartial Orders and Asynchronous Systems -- Distributed Monitoring of Concurrent and Asynchronous Systems -- Synthesis of Distributed Algorithms Using Asynchronous Automata -- Compression of Partially Ordered Strings -- Process Algebra -- Bundle Event Structures and CCSP -- Syntactic Formats for Free -- Priority Rewrite Systems for OSOS Process Languages -- Games -- Quantitative Verification and Control via the Mu-Calculus -- Playing Games with Boxes and Diamonds -- The Element of Surprise in Timed Games -- Infinite Systems -- Deciding Bisimilarity between BPA and BPP Processes -- Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management -- Probabilistic Automata -- Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic,... -- A Process-Algebraic Language for Probabilistic I/O Automata -- Compositionality for Probabilistic Automata -- Model-Checking -- Satisfiability and Model Checking for MSO-Definable Temporal Logics Are in PSPACE -- Equivalence Checking of Non-flat Systems Is EXPTIME-Hard -- Model Checking a Path -- Model-Checking and HMSC -- Multi-valued Model Checking via Classical Model Checking -- An Extension of Pushdown System and Its Model Checking Method -- Netcharts: Bridging the Gap between HMSCs and Executable Specifications -- High-Level Message Sequence Charts and Projections -- Security -- Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus -- Unifying Simulatability Definitions in Cryptographic Systems under Different Timing Assumptions -- Contract Signing, Optimism, and Advantage -- Mobility -- Full Abstraction for HOPLA -- Modeling Consensus in a Process Calculus -- Linear Forwarders -- Compositional Methods and Real Time -- Abstract Patterns of Compositional Reasoning -- Relating Fairness and Timing in Process Algebras -- A Compositional Semantic Theory for Synchronous Component-Based Design -- Probabilistic Models -- Conditional Expectation and the Approximation of Labelled Markov Processes -- Comparative Branching-Time Semantics for Markov Chains -- Quantitative Relations and Approximate Process Equivalences. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2761 606 $aArchitecture, Computer 606 $aComputer logic 606 $aComputer communication systems 606 $aComputer programming 606 $aProgramming languages (Electronic computers) 606 $aComputers 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 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 615 0$aArchitecture, Computer. 615 0$aComputer logic. 615 0$aComputer communication systems. 615 0$aComputer programming. 615 0$aProgramming languages (Electronic computers). 615 0$aComputers. 615 14$aComputer System Implementation. 615 24$aLogics and Meanings of Programs. 615 24$aComputer Communication Networks. 615 24$aProgramming Techniques. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aComputation by Abstract Devices. 676 $a004.35 702 $aAmadio$b Roberto$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLugiez$b Denis$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910144026803321 996 $aCONCUR 2003 - concurrency theory$9949860 997 $aUNINA