CONCUR B

37 papers

YearTitle / Authors
2011A Compositional Framework for Controller Synthesis.
Christel Baier, Joachim Klein, Sascha Klüppelholz
2011A Connector Algebra for P/T Nets Interactions.
Roberto Bruni, Hernán C. Melgratti, Ugo Montanari
2011A Spectrum of Behavioral Relations over LTSs on Probability Distributions.
Silvia Crafa, Francesco Ranzato
2011A Temporal Logic for the Interaction of Strategies.
Farn Wang, Chung-Hao Huang, Fang Yu
2011Advanced Ramsey-Based Büchi Automata Inclusion Testing.
Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar
2011An Automaton over Data Words That Captures EMSO Logic.
Benedikt Bollig
2011Bisimulations Meet PCTL Equivalences for Probabilistic Automata.
Lei Song, Lijun Zhang, Jens Chr. Godskesen
2011CONCUR 2011 - Concurrency Theory - 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings
Joost-Pieter Katoen, Barbara König
2011Carrying Probabilities to the Infinite World.
Parosh Aziz Abdulla
2011Causal Nets: A Modeling Language Tailored towards Process Discovery.
Wil M. P. van der Aalst, Arya Adriansyah, Boudewijn F. van Dongen
2011Coarse Abstractions Make Zeno Behaviours Difficult to Detect.
Frédéric Herbreteau, B. Srivathsan
2011Controlling Reversibility in Higher-Order Pi.
Ivan Lanese, Claudio Antares Mezzina, Alan Schmitt, Jean-Bernard Stefani
2011Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes.
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
2011Dynamic Reactive Modules.
Jasmin Fisher, Thomas A. Henzinger, Dejan Nickovic, Nir Piterman, Anmol V. Singh, Moshe Y. Vardi
2011Efficient CTL Model-Checking for Pushdown Systems.
Fu Song, Tayssir Touili
2011Efficient Contextual Unfolding.
César Rodríguez, Stefan Schwoon, Paolo Baldan
2011Fixed-Delay Events in Generalized Semi-Markov Processes Revisited.
Tomás Brázdil, Jan Krcál, Jan Kretínský, Vojtech Rehák
2011Full Abstraction in a Subtyped pi-Calculus with Linear Types.
Romain Demangeon, Kohei Honda
2011Generalized Universality.
Eli Gafni, Rachid Guerraoui
2011Granularity and Concurrent Separation Logic.
Jonathan Hayman
2011On Causal Semantics of Petri Nets.
Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke
2011On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing.
Paritosh K. Pandya, Simoni S. Shah
2011On Locality and the Exchange Law for Concurrent Processes.
C. A. R. Hoare, Akbar Hussain, Bernhard Möller, Peter W. O'Hearn, Rasmus Lerchedahl Petersen, Georg Struth
2011Parameterized Complexity Results for 1-safe Petri Nets.
M. Praveen, Kamal Lodaya
2011Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations.
Salvatore La Torre, Margherita Napoli
2011Reasoning about Threads with Bounded Lock Chains.
Vineet Kahlon
2011Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems.
Stefan Göller, Anthony Widjaja Lin
2011Semantic Analysis of Gossip Protocols for Wireless Sensor Networks.
Ruggero Lanotte, Massimo Merro
2011Static Livelock Analysis in CSP.
Joël Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell
2011The Complexity of Nash Equilibria in Limit-Average Games.
Michael Ummels, Dominik Wojtczak
2011The Decidability of the Reachability Problem for CCS!
Chaodong He
2011Timed Automata Can Always Be Made Implementable.
Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur, Claus R. Thrane
2011Tractable Reasoning in a Fragment of Separation Logic.
Byron Cook, Christoph Haase, Joël Ouaknine, Matthew J. Parkinson, James Worrell
2011Two Variable vs. Linear Temporal Logic in Model Checking and Games.
Michael Benedikt, Rastislav Lenhardt, James Worrell
2011Typed ψ-calculi.
Hans Hüttel
2011Vector Addition System Reversible Reachability Problem.
Jérôme Leroux
2011Weak Kripke Structures and LTL.
Lars Kuhtz, Bernd Finkbeiner