20. CONCUR 2009: Bologna, Italy

Invited Papers

• Martín Abadi, Tim Harris:
  Perspectives on Transactional Memory. 1-14
  
• Christel Baier, Nathalie Bertrand, Marcus Größer:
  The Effect of Tossing Coins in Omega-Automata. 15-29
  
• Robin Milner:
  Bigraphical Categories. 30-36
  
• Corrado Priami, Paola Quaglia, Alessandro Romanel:
  BlenX Static and Dynamic Semantics. 37-52
  

Contributed Papers

• Ana Almeida Matos:
  Flow Policy Awareness for Distributed Mobile Code. 53-68
  
• Eugene Asarin, Aldric Degorre:
  Volume and Entropy of Regular Timed Languages: Discretization Approach. 69-83
  
• Steffen van Bakel, Maria Grazia Vigliotti:
  A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types. 84-98
  
• Paolo Baldan, Filippo Bonchi, Fabio Gadducci:
  Encoding Asynchronous Interactions Using Open Petri Nets. 99-114
  
• Nicolas Baudru:
  Distributed Asynchronous Automata. 115-130
  
• Mikolaj Bojanczyk, Tomasz Idziaszek:
  Algebra for Infinite Forests with an Application to the Temporal Logic EF. 131-145
  
• Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva:
  Deriving Syntax and Axioms for Quantitative Regular Behaviours. 146-162
  
• Michele Boreale:
  Weighted Bisimulation in Linear Algebraic Form. 163-177
  
• Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu:
  A Logic-Based Framework for Reasoning about Composite Data Structures. 178-195
  
• Patricia Bouyer, Marie Duflot, Nicolas Markey, Gabriel Renault:
  Measuring Permissivity in Finite Games. 196-210
  
• Giuseppe Castagna, Luca Padovani:
  Contracts for Mobile Processes. 211-228
  
• Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
  Power of Randomization in Automata on Infinite Strings. 229-243
  
• Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
  Probabilistic Weighted Automata. 244-258
  
• Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota:
  Partially-Commutative Context-Free Processes. 259-273
  
• Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan:
  Testing Finitary Probabilistic Processes. 274-288
  
• Josée Desharnais, François Laviolette, Amélie Turgeon:
  A Demonic Approach to Information in Probabilistic Systems. 289-304
  
• Vashti Galpin, Luca Bortolussi, Jane Hillston:
  HYPE: A Process Algebra for Compositional Flows and Emergent Behaviour. 305-320
  
• Richard H. G. Garner, Tom Hirschowitz, Aurélien Pardon:
  Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs. 321-337
  
• Sergio Giro, Pedro R. D'Argenio, Luis María Ferrer Fioriti:
  Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers. 338-353
  
• Julian Gutierrez, Julian C. Bradfield:
  Model-Checking Games for Fixpoint Logics with Partial Order Models. 354-368
  
• Christoph Haase, Stephan Kreutzer, Joël Ouaknine, James Worrell:
  Reachability in Succinct and Parametric One-Counter Automata. 369-383
  
• Matthew Hague, C.-H. Luke Ong:
  Winning Regions of Pushdown Parity Games: A Saturation Method. 384-398
  
• C. A. R. Hoare, Bernhard Möller, Georg Struth, Ian Wehrman:
  Concurrent Kleene Algebra. 399-414
  
• Marcin Jurdzinski, Marta Z. Kwiatkowska, Gethin Norman, Ashutosh Trivedi:
  Concavely-Priced Probabilistic Timed Automata. 415-430
  
• Wouter Kuijper, Jaco van de Pol:
  Compositional Control Synthesis for Partially Observable Systems. 431-447
  
• Sergueï Lenglet, Alan Schmitt, Jean-Bernard Stefani:
  Howe's Method for Calculi with Passivation. 448-462
  
• Roland Meyer, Roberto Gorrieri:
  On the Relationship between π-Calculus and Finite Place/Transition Petri Nets. 463-480
  
• Calvin C. Newport, Nancy A. Lynch:
  Modeling Radio Networks. 481-495
  
• Joël Ouaknine, Alexander Rabinovich, James Worrell:
  Time-Bounded Verification. 496-510
  
• Jérémy Planul, Ricardo Corin, Cédric Fournet:
  Secure Enforcement for Global Process Specifications. 511-526
  
• Pavithra Prabhakar, Sayan Mitra, Mahesh Viswanathan:
  On Convergence of Concurrent Systems under Regular Interactions. 527-541
  
• Francesco Ranzato, Francesco Tapparo:
  Computing Stuttering Simulations. 542-556
  
• Pierre-Alain Reynier, Arnaud Sangnier:
  Weak Time Petri Nets Strike Back!. 557-571
  
• Ismael Rodríguez:
  A General Testability Theory. 572-586
  
• Matthias Schmalz, Daniele Varacca, Hagen Völzer:
  Counterexamples in Probabilistic LTL Model Checking for Markov Chains. 587-602
  
• Anu Singh, C. R. Ramakrishnan, Scott A. Smolka:
  Query-Based Model Checking of Ad Hoc Network Protocols. 603-619
  
• Jeremy Sproston:
  Strict Divergence for Probabilistic Timed Automata. 620-636