ISBN: 3540678972
TITLE: CONCUR 2000 - Concurrency Theory
AUTHOR: Palamidessi, Catuscia (Ed.)
TOC:

Invited Talks
Combining Theorem Proving and Model Checking through Symbolic Analysis 1
Natarajan Shankar
Verification Is Experimentation! 17
Ed Brinksma
Compositional Performance Analysis Using Probabilistic I/O Automata 25
Eugene W. Stark
Formal Models for Communication-Based Design 29
Alberto Sangiovanni-Vincentelli, Marco Sgroi and Luciano Lavagno
Invited Tutorials
Programming Access Control: The Klaim Experience 48
Rocco De Nicola, GianLuigi Ferrari and Rosario Pugliese
Exploiting Hierarchical Structure for Efficient Formal Verification 66
Rajeev Alur
From Process Calculi to Process Frameworks 69
Philippa Gardner
Verification Using Tabled Logic Programming 89
C. R. Ramakrishnan
Accepted Papers
Open Systems in Reactive Environments: Control and Synthesis 92
Orna Kupferman, P. Madhusudan, P. S. Thiagarajan and Moshe Y. Vardi
Model Checking with Finite Complete Prefixes Is PSPACE-Complete 108
Keijo Heljanko
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata 123
Marta Kwiatkowska, Gethin Norman, Roberto Segala and Jeremy Sproston
The Impressive Power of Stopwatches 138
Franck Cassez and Kim Larsen
Optimizing Bchi Automata 153
Kousha Etessami and Gerard J. Holzmann
Generalized Model Checking: Reasoning about Partial State Spaces 168
Glenn Bruns and Patrice Godefroid
Reachability Analysis for Some Models of Infinite-State Transition Systems 183
Oscar H. Ibarra, Tevfik Bultan and Jianwen Su
Process Spaces 199
Radu Negulescu
Failure Semantics for the Exchange of Information in Multi-Agent Systems 214
Frank S. de Boer, Rogier M. van Eijk, Wiebe van der Hoek and John-Jules Ch. Meyer
Proof-Outlines for Threads in Java 229
Erika brahm-Mumm and Frank S. de Boer
Deriving Bisimulation Congruences for Reactive Systems 243
James J. Leifer and Robin Milner
Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic 259
Roberto Bruni, David de Frutos-Escrig, Narciso Mart-Oliet and Ugo Montanari
Process Languages for Rooted Eager Bisimulation 275
Irek Ulidowski and Shoji Yuen
Action Contraction 290
Arend Rensink
A Theory of Testing for Markovian Processes 305
Marco Bernardo and Rance Cleaveland
Reasoning about Probabilistic Lossy Channel Systems 320
Parosh Abdulla, Christel Baier, Purushothaman Iyer and Bengt Jonsson
Weak Bisimulation for Probabilistic Systems 334
Anna Philippou, Insup Lee and Oleg Sokolsky
Nondeterminism and Probabilistic Choice: Obeying the Laws 350
Michael Mislove
Secrecy and Group Creation 365
Luca Cardelli, Giorgio Ghelli and Andrew D. Gordon
On the Reachability Problem in Cryptographic Protocols 380
Roberto M. Amadio and Denis Lugiez
Secure Information Flow for Concurrent Processes 395
Jan Jrjens
LP Deadlock Checking Using Partial Order Dependencies 410
Victor Khomenko and Maciej Koutny
Pomsets for Local Trace Languages  Recognizability, Logic & Petri Nets 426
Dietrich Kuske and Rmi Morin
Functorial Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs 442
Paolo Baldan, Nadia Busi, Andrea Corradini and G. Michele Pinna
The Control of Synchronous Systems 458
Luca de Alfaro, Thomas A. Henzinger and Freddy Y. C. Mang
Typing Non-uniform Concurrent Objects 474
Antnio Ravara and Vasco T. Vasconcelos
An Implicitly-Typed Deadlock-Free Process Calculus 489
Naoki Kobayashi, Shin Saito and Eijiro Sumii
Typed Mobile Objects 504
Michele Bugliesi, Giuseppe Castagna and Silvia Crafa
Synthesizing Distributed Finite-State Systems from MSCs 521
Madhavan Mukund, K. Narayan Kumar and Milind Sohoni
Emptiness Is Decidable for Asynchronous Cellular Machines 536
Dietrich Kuske
Revisiting Safety and Liveness in the Context of Failures 552
Bernadette Charron-Bost, Sam Toueg and Anindya Basu
Well-Abstracted Transition Systems 566
Alain Finkel, Purushothaman Iyer and Gregoire Sutre
A Unifying Approach to Data-Independence 581
Ranko Lazic and David Nowak
Chi Calculus with Mismatch 596
Yuxi Fu and Zhenrong Yang
Author Index 611
END
