22. CONCUR 2011: Aachen, Germany

Joost-Pieter Katoen, Barbara König (Eds.): CONCUR 2011 - Concurrency Theory - 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings. Lecture Notes in Computer Science 6901 Springer 2011, ISBN 978-3-642-23216-9

Invited Talks

Parosh Aziz Abdulla:
Carrying Probabilities to the Infinite World. 1-16
Eli Gafni, Rachid Guerraoui:
Generalized Universality. 17-27
Wil M. P. van der Aalst, Arya Adriansyah, Boudewijn F. van Dongen:
Causal Nets: A Modeling Language Tailored towards Process Discovery. 28-42
Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke:
On Causal Semantics of Petri Nets. 43-59

Paritosh K. Pandya, Simoni S. Shah:
On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing. 60-75
Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur, Claus R. Thrane:
Timed Automata Can Always Be Made Implementable. 76-91
Frédéric Herbreteau, B. Srivathsan:
Coarse Abstractions Make Zeno Behaviours Difficult to Detect. 92-107

Lei Song, Lijun Zhang, Jens Chr. Godskesen:
Bisimulations Meet PCTL Equivalences for Probabilistic Automata. 108-123
Silvia Crafa, Francesco Ranzato:
A Spectrum of Behavioral Relations over LTSs on Probability Distributions. 124-139
Tomás Brázdil, Jan Krcál, Jan Kretínský, Vojtech Rehák:
Fixed-Delay Events in Generalized Semi-Markov Processes Revisited. 140-155
Ruggero Lanotte, Massimo Merro:
Semantic Analysis of Gossip Protocols for Wireless Sensor Networks. 156-170

Benedikt Bollig:
An Automaton over Data Words That Captures EMSO Logic. 171-186
Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar:
Advanced Ramsey-Based Büchi Automata Inclusion Testing. 187-202
Salvatore La Torre, Margherita Napoli:
Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations. 203-218

Jonathan Hayman:
Granularity and Concurrent Separation Logic. 219-234
Byron Cook, Christoph Haase, Joël Ouaknine, Matthew J. Parkinson, James Worrell:
Tractable Reasoning in a Fragment of Separation Logic. 235-249
C. A. R. Hoare, Akbar Hussain, Bernhard Möller, Peter W. O'Hearn, Rasmus Lerchedahl Petersen, Georg Struth:
On Locality and the Exchange Law for Concurrent Processes. 250-264

Hans Hüttel:
Typed ψ-calculi. 265-279
Romain Demangeon, Kohei Honda:
Full Abstraction in a Subtyped pi-Calculus with Linear Types. 280-296
Ivan Lanese, Claudio Antares Mezzina, Alan Schmitt, Jean-Bernard Stefani:
Controlling Reversibility in Higher-Order Pi. 297-311

Roberto Bruni, Hernán C. Melgratti, Ugo Montanari:
A Connector Algebra for P/T Nets Interactions. 312-326
Jérôme Leroux:
Vector Addition System Reversible Reachability Problem. 327-341
César Rodríguez, Stefan Schwoon, Paolo Baldan:
Efficient Contextual Unfolding. 342-357
M. Praveen, Kamal Lodaya:
Parameterized Complexity Results for 1-safe Petri Nets. 358-372

Chaodong He:
The Decidability of the Reachability Problem for CCS! 373-388
Joël Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell:
Static Livelock Analysis in CSP. 389-403
Jasmin Fisher, Thomas A. Henzinger, Dejan Nickovic, Nir Piterman, Anmol V. Singh, Moshe Y. Vardi:
Dynamic Reactive Modules. 404-418

Lars Kuhtz, Bernd Finkbeiner:
Weak Kripke Structures and LTL. 419-433
Fu Song, Tayssir Touili:
Efficient CTL Model-Checking for Pushdown Systems. 434-449
Vineet Kahlon:
Reasoning about Threads with Bounded Lock Chains. 450-465

Farn Wang, Chung-Hao Huang, Fang Yu:
A Temporal Logic for the Interaction of Strategies. 466-481
Michael Ummels, Dominik Wojtczak:
The Complexity of Nash Equilibria in Limit-Average Games. 482-496
Michael Benedikt, Rastislav Lenhardt, James Worrell:
Two Variable vs. Linear Temporal Logic in Model Checking and Games. 497-511
Christel Baier, Joachim Klein, Sascha Klüppelholz:
A Compositional Framework for Controller Synthesis. 512-527

Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota:
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. 528-542
Stefan Göller, Anthony Widjaja Lin:
Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems. 543-558

Last update Thu May 24 04:15:17 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page