CONCUR 2000 - Concurrency Theory : 11th International Conference, University Park, PA, USA, August 2000 Proceedings

by Palamidessi

• ISBN13: 9783540678977
• ISBN10: 3540678972
• Format: Paperback
• Copyright: 2000-09-01
• Publisher: Springer Verlag

Summary

This book constitutes the refereed papers of the 11th International Conference on Concurrency Theory, CONCUR 2000, held in University Park, PA, USA in August 2000. The 34 revised full papes presented together with eight invited talks or tutorials were carefully reviewed and selected from 72 submissions. The papers address concurrency-related aspects of models of computation, semantic domains, process algebras, Petri nets, event structures, real-time systems, hybrid systems, decidability, model checking, verification techniques, refinement, term and graph rewriting, distributed programming, logic constraint programming, object-oriented programming, typing systems and algorithms, case studies, tools, and environments for programming and verification.

Table of Contents

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