11. CONCUR 2000:
Pennsylvania State University, Pennsylvania, USA
Catuscia Palamidessi (Ed.):
CONCUR 2000 - Concurrency Theory, 11th International Conference, University Park, PA, USA, August 22-25, 2000, Proceedings.
Lecture Notes in Computer Science 1877 Springer 2000, ISBN 3-540-67897-2 
Invited Talks
Invited Tutorials
Accepted Papers
- Orna Kupferman, P. Madhusudan, P. S. Thiagarajan, Moshe Y. Vardi:
Open Systems in Reactive Environments: Control and Synthesis.
92-107
- Keijo Heljanko:
Model Checking with Finite Complete Prefixes Is PSPACE-Complete.
108-122
- Marta Z. Kwiatkowska, Gethin Norman, Roberto Segala, Jeremy Sproston:
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata.
123-137
- Franck Cassez, Kim Guldstrand Larsen:
The Impressive Power of Stopwatches.
138-152
- Kousha Etessami, Gerard J. Holzmann:
Optimizing Büchi Automata.
153-167
- Glenn Bruns, Patrice Godefroid:
Generalized Model Checking: Reasoning about Partial State Spaces.
168-182
- Oscar H. Ibarra, Tevfik Bultan, Jianwen Su:
Reachability Analysis for Some Models of Infinite-State Transition Systems.
183-198
- Radu Negulescu:
Process Spaces.
199-213
- Frank S. de Boer, Rogier M. van Eijk, Wiebe van der Hoek, John-Jules Ch. Meyer:
Failure Semantics for the Exchange of Information in Multi-Agent Systems.
214-228
- Erika Ábrahám-Mumm, Frank S. de Boer:
Proof-Outlines for Threads in Java.
229-242
- James J. Leifer, Robin Milner:
Deriving Bisimulation Congruences for Reactive Systems.
243-258
- Roberto Bruni, David de Frutos-Escrig, Narciso Martí-Oliet, Ugo Montanari:
Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic.
259-274
- Irek Ulidowski, Shoji Yuen:
Process Languages for Rooted Eager Bisimulation.
275-289
- Arend Rensink:
Action Contraction.
290-304
- Marco Bernardo, Rance Cleaveland:
A Theory of Testing for Markovian Processes.
305-319
- Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson:
Reasoning about Probabilistic Lossy Channel Systems.
320-333
- Anna Philippou, Insup Lee, Oleg Sokolsky:
Weak Bisimulation for Probabilistic Systems.
334-349
- Michael W. Mislove:
Nondeterminism and Probabilistic Choice: Obeying the Laws.
350-364
- Luca Cardelli, Giorgio Ghelli, Andrew D. Gordon:
Secrecy and Group Creation.
365-379
- Roberto M. Amadio, Denis Lugiez:
On the Reachability Problem in Cryptographic Protocols.
380-394
- Jan Jürjens:
Secure Information Flow for Concurrent Processes.
395-409
- Victor Khomenko, Maciej Koutny:
LP Deadlock Checking Using Partial Order Dependencies.
410-425
- Dietrich Kuske, Rémi Morin:
Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets.
426-441
- Paolo Baldan, Nadia Busi, Andrea Corradini, G. Michele Pinna:
Functorial Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs.
442-457
- Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. Mang:
The Control of Synchronous Systems.
458-473
- António Ravara, Vasco Thudichum Vasconcelos:
Typing Non-uniform Concurrent Objects.
474-488
- Naoki Kobayashi, Shin Saito, Eijiro Sumii:
An Implicitly-Typed Deadlock-Free Process Calculus.
489-503
- Michele Bugliesi, Giuseppe Castagna, Silvia Crafa:
Typed Mobile Objects.
504-520
- Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni:
Synthesizing Distributed Finite-State Systems from MSCs.
521-535
- Dietrich Kuske:
Emptiness Is Decidable for Asynchronous Cellular Machines.
536-551
- Bernadette Charron-Bost, Sam Toueg, Anindya Basu:
Revisiting Safety and Liveness in the Context of Failures.
552-565
- Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre:
Well-Abstracted Transition Systems.
566-580
- Ranko Lazic, David Nowak:
A Unifying Approach to Data-Independence.
581-595
- Yuxi Fu, Zhenrong Yang:
Chi Calculus with Mismatch.
596-610
Last update Wed May 22 02:30:36 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
