CONCUR 2007 – Concurrency Theory: 18th International Conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007. Proceedings

Fred B. Schneider (auth.), Luís Caires, Vasco T. Vasconcelos (eds.)3540744061, 9783540744061

The 17th International Conference on Concurrency Theory was held in Lisbon, Portugal, in September 2007. The conference drew leading experts in concurrency theory who came to share their findings and discuss the latest developments in the field. This volume constitutes the refereed proceedings of the conference.

Thirty full papers are presented along with three important invited papers. Readers will discover many important findings and applications in concurrency theory.

Topics include model checking, process calculi, minimization and equivalence checking, types, semantics, probability, bisimulation and simulation, real time, and formal languages.

---

Table of contents :
Front Matter….Pages –
Mapping the Security Landscape: A Role for Language Techniques….Pages 1-1
The Saga of the Axiomatization of Parallel Composition….Pages 2-16
Rule-Based Modelling of Cellular Signalling….Pages 17-41
Making Random Choices Invisible to the Scheduler….Pages 42-58
Strategy Logic….Pages 59-73
Solving Games Via Three-Valued Abstraction Refinement….Pages 74-89
Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness….Pages 90-104
On Modal Refinement and Consistency….Pages 105-119
Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems….Pages 120-135
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage….Pages 136-150
A Nice Labelling for Tree-Like Event Structures of Degree 3….Pages 151-165
Causal Message Sequence Charts….Pages 166-180
Checking Coverage for Infinite Collections of Timed Scenarios….Pages 181-196
Is Observational Congruence Axiomatisable in Equational Horn Logic?….Pages 197-211
The Must Preorder Revisited….Pages 212-225
Topology-Dependent Abstractions of Broadcast Networks….Pages 226-240
On the Expressive Power of Global and Local Priority in Process Calculi….Pages 241-255
A Marriage of Rely/Guarantee and Separation Logic….Pages 256-271
Fair Cooperative Multithreading….Pages 272-286
Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures….Pages 287-302
Automatic Derivation of Compositional Rules in Automated Compositional Reasoning….Pages 303-316
Compositional Event Structure Semantics for the Internal π -Calculus….Pages 317-332
Interpreting a Finitary Pi-calculus in Differential Interaction Nets….Pages 333-348
Mobility Control Via Passports….Pages 349-363
Coalgebraic Models for Reactive Systems….Pages 364-379
Reactive Systems over Directed Bigraphs….Pages 380-394
Asynchronous Games: Innocence Without Alternation….Pages 395-411
Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes….Pages 412-427
Strategy Synthesis for Markov Decision Processes and Branching-Time Logics….Pages 428-444
Timed Concurrent Game Structures….Pages 445-459
Pushdown Module Checking with Imperfect Information….Pages 460-475
Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages….Pages 476-491
Temporal Antecedent Failure: Refining Vacuity….Pages 492-506
Back Matter….Pages –