CONCUR 2009 - Concurrency Theory: 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009, Proceedings (Lecture Notes in Computer Science (5710))

Annotation This 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 Front Matter....Pages - Perspectives on Transactional Memory....Pages 1-14 The Effect of Tossing Coins in Omega-Automata....Pages 15-29 Bigraphical Categories....Pages 30-36 BlenX Static and Dynamic Semantics....Pages 37-52 Flow Policy Awareness for Distributed Mobile Code....Pages 53-68 Volume and Entropy of Regular Timed Languages: Discretization Approach....Pages 69-83 A Logical Interpretation of the λ -Calculus into the π -Calculus, Preserving Spine Reduction and Types....Pages 84-98 Encoding Asynchronous Interactions Using Open Petri Nets....Pages 99-114 Distributed Asynchronous Automata....Pages 115-130 Algebra for Infinite Forests with an Application to the Temporal Logic EF....Pages 131-145 Deriving Syntax and Axioms for Quantitative Regular Behaviours....Pages 146-162 Weighted Bisimulation in Linear Algebraic Form....Pages 163-177 A Logic-Based Framework for Reasoning about Composite Data Structures....Pages 178-195 Measuring Permissivity in Finite Games....Pages 196-210 Contracts for Mobile Processes....Pages 211-228 Power of Randomization in Automata on Infinite Strings....Pages 229-243 Probabilistic Weighted Automata....Pages 244-258 Partially-Commutative Context-Free Processes....Pages 259-273 Testing Finitary Probabilistic Processes....Pages 274-288 A Demonic Approach to Information in Probabilistic Systems....Pages 289-304 HYPE: A Process Algebra for Compositional Flows and Emergent Behaviour....Pages 305-320 Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs....Pages 321-337 Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers....Pages 338-353 Model-Checking Games for Fixpoint Logics with Partial Order Models....Pages 354-368 Reachability in Succinct and Parametric One-Counter Automata....Pages 369-383 Winning Regions of Pushdown Parity Games: A Saturation Method....Pages 384-398 Concurrent Kleene Algebra....Pages 399-414 Concavely-Priced Probabilistic Timed Automata....Pages 415-430 Compositional Control Synthesis for Partially Observable Systems....Pages 431-447 Howe’s Method for Calculi with Passivation....Pages 448-462 On the Relationship between π -Calculus and Finite Place/Transition Petri Nets....Pages 463-480 Modeling Radio Networks....Pages 481-495 Time-Bounded Verification....Pages 496-510 Secure Enforcement for Global Process Specifications....Pages 511-526 On Convergence of Concurrent Systems under Regular Interactions....Pages 527-541 Computing Stuttering Simulations....Pages 542-556 Weak Time Petri Nets Strike Back!....Pages 557-571 A General Testability Theory....Pages 572-586 Counterexamples in Probabilistic LTL Model Checking for Markov Chains....Pages 587-602 Query-Based Model Checking of Ad Hoc Network Protocols....Pages 603-619 Strict Divergence for Probabilistic Timed Automata....Pages 620-636 Back Matter....Pages - This volume contains the proceedings of the 20th Conference on Concurrency Theory (CONCUR 2009), held in Bologna, September 1–4, 2009. The purpose of the CONCUR conference is to bring together researchers, developers, and s- dentsinordertoadvancethetheoryofconcurrencyandpromoteitsapplications. This year the CONCUR conference was in its 20th edition, and to celebrate 20 years of CONCUR, the conference program included a special session organized by the IFIP Working Groups 1.8 “Concurrency Theory” and 2.2 “Formal - scriptionofProgrammingConcepts”aswellas aninvitedlecturegivenby Robin Milner, one of the fathers of the concurrency theory research area. This edition of the conference attracted 129 submissions. We wish to thank all their authors for their interest in CONCUR 2009. After careful discussions, the Program Committee selected 37 papers for presentation at the conference. Each of them was accurately refereed by at least three reviewers (four reviewers for papers co-authored by members of the Program Committee), who delivered detailedandinsightfulcommentsandsuggestions.TheconferenceChairswarmly thank all the members of the Program Committee and all their sub-referees for the excellent support they gave, as well as for the friendly and constructive discussions. We would also like to thank the authors for having revised their papers to address the comments and suggestions by the referees. The conference program was enriched by the outstanding invited talks by Martin Abadi, Christel Baier, Corrado Priami and, as mentioned above, Robin Milner.