10. CONCUR 1999: Eindhoven, The Netherlands
Jos C. M. Baeten, Sjouke Mauw (Eds.): CONCUR '99: Concurrency Theory, 10th International Conference, Eindhoven, The Netherlands, August 24-27, 1999, Proceedings. Springer 1999 Lecture Notes in Computer Science ISBN 3-540-66425-4
Invited Lectures
- Rance Cleaveland: Temporal Process Logic (Abstract). 1
- Javier Esparza, Stefan Römer: An Unfolding Algorithm for Synchronous Products of Transition Systems. 2-20
- Rob J. van Glabbeek: Petri Nets, Configuration Structures and Higher Dimensional Automata. 21-27
- Catuscia Palamidessi: Expressiveness and Distributed Implementation of Conciurrent Calculi with Link Mobility. 28-29
Tutorials
- Jan Tretmans: Testing Concurrent Systems: A Formal Approach. 46-65
Accepted Papers
- Luca de Alfaro: Computing Minimum and Maximum Reachability Times in Probabilistic Systems. 66-81
- Rajeev Alur, Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. Mang: Automating Modular Verification. 82-97
- Paul C. Attie: Synthesis of Large Concurrent Programs via Pairwise Composition. 130-145
- Christel Baier, Joost-Pieter Katoen, Holger Hermanns: Approximate Symbolic Model Checking of Continuous-Time Markov Chains. 146-161
- Béatrice Bérard, Laurent Fribourg: Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic. 178-193
- Burkhard Bieber, Hans Fleischhack: Model Checking of Time Petri Nets Based on Partial Order Semantics. 210-225
- Frank S. de Boer, Gianluigi Zavattaro: Generic Process Algebras for Asynchronous Communication. 226-241
- Josee Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden: Metrics for Labeled Markov Systems. 258-273
- Arkadi Estrin, Michael Kaminski: The Expressive Power of Temporal Logic of Actions (Extended Abstract). 274-287
- Yuxi Fu: Open Bisimulations on Chi Processes. 304-319
- Yuh-Jzer Joung: Localizability of Fairness Constraints and Their Distributed Implementations. 336-351
- Barbara König: Generating Type Systems for Process Graphs. 352-367
- Antonín Kucera, Richard Mayr: Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. 368-382
- Marius Minea: Partial Order Reduction for Model Checking of Timed Automata. 431-446
- Flemming Nielson, Hanne Riis Nielson, René Rydhof Hansen, Jacob Grydholt Jensen: Validating Firewalls in Mobile Ambients. 463-477
- Thomas Noll: On Coherence Properties in Team Rewriting Models of Concurrency. 478-493
- Antti Puhakka, Antti Valmari: Weakest-Congruence Results for Livelock-Preserving Equivalences. 510-524
- Glynn Winskel: Event Structures as Presheaves -Two Representation Theorems. 541-556
- Nobuko Yoshida, Matthew Hennessy: Suptyping and Locality in Distributed Higher Order Processes (extended abstract). 557-572
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team