LEADER 05210nam 22006735 450 001 9910483828403321 005 20230406024656.0 010 $a3-642-04081-0 024 7 $a10.1007/978-3-642-04081-8 035 $a(CKB)1000000000784710 035 $a(SSID)ssj0000316972 035 $a(PQKBManifestationID)11258587 035 $a(PQKBTitleCode)TC0000316972 035 $a(PQKBWorkID)10287267 035 $a(PQKB)11008041 035 $a(DE-He213)978-3-642-04081-8 035 $a(MiAaPQ)EBC3064542 035 $a(PPN)139955321 035 $a(EXLCZ)991000000000784710 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCONCUR 2009 - Concurrency Theory $e20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009, Proceedings /$fedited by Mario Bravetti, Gianluigi Zavattaro 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XIII, 638 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5710 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-04080-2 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- Perspectives on Transactional Memory -- The Effect of Tossing Coins in Omega-Automata -- Bigraphical Categories -- BlenX Static and Dynamic Semantics -- Contributed Papers -- Flow Policy Awareness for Distributed Mobile Code -- Volume and Entropy of Regular Timed Languages: Discretization Approach -- A Logical Interpretation of the ?-Calculus into the ?-Calculus, Preserving Spine Reduction and Types -- Encoding Asynchronous Interactions Using Open Petri Nets -- Distributed Asynchronous Automata -- Algebra for Infinite Forests with an Application to the Temporal Logic EF -- Deriving Syntax and Axioms for Quantitative Regular Behaviours -- Weighted Bisimulation in Linear Algebraic Form -- A Logic-Based Framework for Reasoning about Composite Data Structures -- Measuring Permissivity in Finite Games -- Contracts for Mobile Processes -- Power of Randomization in Automata on Infinite Strings -- Probabilistic Weighted Automata -- Partially-Commutative Context-Free Processes -- Testing Finitary Probabilistic Processes -- A Demonic Approach to Information in Probabilistic Systems -- HYPE: A Process Algebra for Compositional Flows and Emergent Behaviour -- Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs -- Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers -- Model-Checking Games for Fixpoint Logics with Partial Order Models -- Reachability in Succinct and Parametric One-Counter Automata -- Winning Regions of Pushdown Parity Games: A Saturation Method -- Concurrent Kleene Algebra -- Concavely-Priced Probabilistic Timed Automata -- Compositional Control Synthesis for Partially Observable Systems -- Howe?s Method for Calculi with Passivation -- On the Relationship between ?-Calculus and Finite Place/Transition Petri Nets -- Modeling Radio Networks -- Time-Bounded Verification -- Secure Enforcement for Global Process Specifications -- On Convergence of Concurrent Systems under Regular Interactions -- Computing Stuttering Simulations -- Weak Time Petri Nets Strike Back! -- A General Testability Theory -- Counterexamples in Probabilistic LTL Model Checking for Markov Chains -- Query-Based Model Checking of Ad Hoc Network Protocols -- Strict Divergence for Probabilistic Timed Automata. 330 $aThis book constitutes the refereed proceedings of the 20th International Conference on Concurrency Theory, CONCUR 2009, held in Bologna, Italy, September 1-4, 2009. The 37 revised full papers presented together with four invited papers were carefully reviewed and selected from 129 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 ;$v5710 606 $aComputer science 606 $aComputer programming 606 $aComputer science?Mathematics 606 $aComputer Science Logic and Foundations of Programming 606 $aProgramming Techniques 606 $aTheory of Computation 606 $aModels of Computation 606 $aMathematics of Computing 615 0$aComputer science. 615 0$aComputer programming. 615 0$aComputer science?Mathematics. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aProgramming Techniques. 615 24$aTheory of Computation. 615 24$aModels of Computation. 615 24$aMathematics of Computing. 676 $a005.1015113 702 $aBravetti$b Mario$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aZavattaro$b Gianluigi$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a9910483828403321 996 $aCONCUR 2009 - Concurrency Theory$9773718 997 $aUNINA