SPECIAL ISSUE:
23rd International Conference on Concurrency Theory (CONCUR 2012)
Newcastle upon Tyne, United Kingdom, 2012



Preface
M. Koutny and I. Ulidowski


Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems
Roy Mennicke


Algebraic Structure of Combined Traces
Lukasz Mikulski


Linearizability with Ownership Transfer
Alexey Gotsman and Hongseok Yang


Reachability Problem for Weak Multi-Pushdown Automata
Wojciech Czerwiński, Piotr Hofman and Sławomir Lasota


A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets
Victor Khomenko, Roland Meyer and Reiner Hüchting


All Linear-Time Congruences for Familiar Operators
Antti Valmari


Avoiding Shared Clocks in Networks of Timed Automata
Sandie Balaguer and Thomas Chatain


Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems
Henning Kerstan and Barbara König



DOI: 10.2168/LMCS-CONCUR:2012

Creative Commons