CONCUR 12 Accepted Papers

Fides Aarts, Faranak Heidarian and Frits Vaandrager. A Theory of History Dependent Abstractions for Learning Interface Automata
Guy Avni and Orna Kupferman. Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction
Sandie Balaguer and Thomas Chatain. Avoiding Shared Clocks in Networks of Timed Automata
Béatrice Bérard, Serge Haddad, Mathieu Sassolas and Nathalie Sznajder. Concurrent Games on VASS with Inhibition
Luca Bortolussi and Jane Hillston. Fluid Model Checking
Romain Brenguier, Stefan Göller and Ocan Sankur. A Comparison of Succinctly Represented Finite-State Systems
Krishnendu Chatterjee, Mickael Randour and Jean-Francois Raskin. Strategy Synthesis for Multi-dimensional Quantitative Objectives
Taolue Chen, Vojtech Forejt, Marta Kwiatkowska, Aistis Simaitis, Ashutosh Trivedi and Michael Ummels. Playing Stochastic Games Precisely
Tzu-Chun Chen and Kohei Honda. Specifying Stateful Asynchronous Properties for Distributed Programs
Aiswarya Cyriac, Paul Gastin and K Narayan Kumar. MSO Decidability of Multi-Pushdown Systems via Split-Width
Arnaud Da Costa, Francois Laroussinie and Nicolas Markey. Quantified CTL: Expressiveness and Model Checking
Frank de Boer, Cosimo Laneve, Gianluigi Zavattaro and Mahdi Jaghoori. Decidability Problems for Actor Systems
Romain Demangeon and Kohei Honda. Nested Protocols in Session Types
Emmanuel Filiot, Raffaella Gentilini and Jean-Francois Raskin. Quantitative Languages Defined by Functional Automata
Luca Fossati, Kohei Honda and Nobuko Yoshida. Intensional and Extensional Characterisation of Global Progress in the pi-Calculus
Matthias Függer and Josef Widder. Efficient Checking of Link-reversal-based Concurrent Systems
Daniel Gebler and Wan Fokkink. Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics
Alexey Gotsman and Hongseok Yang. Linearizability with Ownership Transfer
Daniel Hirschkoff, Jean-Marie Madiot and Davide Sangiorgi. Duality and i/o-types in the pi-calculus
Piotr Hofman, Sławomir Lasota and Wojciech Czerwiński. Reachability Problem for Weak Multi-pushdown Automata
Ryszard Janicki, Xiang Yin and Nadezhda Zubkova. Modeling Interval Order Structures with Partially Commutative Monoids
Alexander Kaiser, Daniel Kroening and Thomas Wahl. Efficient Coverability Analysis by Proof Minimization
Henning Kerstan and Barbara König. Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory
Sophia Knight, Catuscia Palamidessi, Prakash Panangaden and Frank Valencia. Spatial Information Distribution in Constraint-based Process Calculi
Julien Lange and Emilio Tuosto. Synthesising Choreographies from Local Session Types
Mohsen Lesani, Victor Luchangco and Mark Moir. A Framework for Formally Verifying Software Transactional Memory Algorithms
Roy Mennicke. Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems
Roland Meyer, Victor Khomenko and Reiner Huechting. A Polynomial Translation of pi-Calculus (FCP) to Safe Petri Nets
Lukasz Mikulski. Algebraic Structure of Combined Traces
Fabio Mogavero, Aniello Murano, Giuseppe Perelli and Moshe Vardi. What Makes ATL* Decidable? A Decidable Fragment of Strategy Logic
Cesar Rodriguez and Stefan Schwoon. Verification of Petri Nets with Read Arcs
Mark Timmer, Joost-Pieter Katoen, Jaco Van De Pol and Marielle I A Stoelinga. Efficient Modelling and Generation of Markov Automata
Max Tschaikowski and Mirco Tribastone. Exact Fluid Lumpability for Markovian Process Algebra
Antti Valmari. All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs
Nengkun Yu and Mingsheng Ying. Reachability and Termination Analysis of Concurrent Quantum Programs