8. CONCUR 1997: Warsaw, Poland

Antoni W. Mazurkiewicz, Józef Winkowski (Eds.): CONCUR '97: Concurrency Theory, 8th International Conference, Warsaw, Poland, July 1-4, 1997, Proceedings. Lecture Notes in Computer Science 1243 Springer 1997, ISBN 3-540-63141-0 BibTeX

@proceedings{DBLP:conf/concur/1997,
  editor    = {Antoni W. Mazurkiewicz and
               J{\'o}zef Winkowski},
  title     = {CONCUR '97: Concurrency Theory, 8th International Conference,
               Warsaw, Poland, July 1-4, 1997, Proceedings},
  booktitle = {CONCUR},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1243},
  year      = {1997},
  isbn      = {3-540-63141-0},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Talks

Jeremy Gunawardena: Recent Developments in the Mathematics of Reactive Systems (Extended Abstract). 1-4 BibTeX
Y. S. Ramakrishna, Scott A. Smolka: Partial-Order Reduction in the Weak Modal Mu-Calculus. 5-24 BibTeX
M. W. Shields: Cyclic Vector Languages. 25-44 BibTeX
Jesper G. Henriksen, P. S. Thiagarajan: A Product Version of Dynamic Linear Time Temporal Logic. 45-58 BibTeX

Contributions

Martín Abadi, Andrew D. Gordon: Reasoning about Cryptographic Protocols in the Spi Calculus. 59-73 BibTeX
Rajeev Alur, Thomas A. Henzinger: Modularity for Timed and Hybrid Systems. 74-88 BibTeX
Henrik Reif Andersen, Simon Mørk, Morten Ulrik Sørensen: A Universal Reactive Machine. 89-103 BibTeX
Jos C. M. Baeten, Jan A. Bergstra: Bounded Stacks, Bags and Queues. 104-118 BibTeX
Girish Bhat, Doron Peled: Adding Partial Orders to Linear Temporal Logic. 119-134 BibTeX
Ahmed Bouajjani, Javier Esparza, Oded Maler: Reachability Analysis of Pushdown Automata: Application to Model-Checking. 135-150 BibTeX
Nadia Busi, G. Michele Pinna: Synthesis of Nets with Inhibitor Arcs. 151-165 BibTeX
Rance Cleaveland, Gerald Lüttgen, Michael Mendler: An Algebraic Theory of Multiple Clocks. 166-180 BibTeX
Hartmut Ehrig, Robert Geisler, Marcus Klar, Julia Padberg: Horizontal and Vertical Structuring Techniques for Statecharts. 181-195 BibTeX
Cédric Fournet, Cosimo Laneve, Luc Maranget, Didier Rémy: Implicit Typing à la ML for the Join-Calculus. 196-212 BibTeX
Laurent Fribourg, Hans Olsén: Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic. 213-227 BibTeX
Rob J. van Glabbeek: Axiomatizing Flat Iteration. 228-242 BibTeX
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat: Probabilistic Concurrent Constraint Programming. 243-257 BibTeX
David Harel, Orna Kupferman, Moshe Y. Vardi: On the Complexity of Verifying Concurrent Transition Systems. 258-272 BibTeX
Thomas A. Henzinger, Orna Kupferman, Sriram K. Rajamani: Fair Simulation. 273-287 BibTeX
Hanna Klaudel, Robert-C. Riemann: High Level Expressions with their SOS Semantics (Extended Abstract). 288-301 BibTeX
Antonín Kucera: How to Parallelize Sequential Processes. 302-316 BibTeX
Rom Langerak, Ed Brinksma, Joost-Pieter Katoen: Causal Ambiguity and Partial Orders in Event Structures. 317-331 BibTeX
Richard Mayr: Model Checking PA-Processes. 332-346 BibTeX
Anna Patterson: Bisimulation and Propositional Intuitionistic Logic. 347-360 BibTeX
Anna Philippou, David Walker: A Rigorous Analysis of Concurrent Operations on B-Trees. 361-375 BibTeX
Peter Selinger: First-Order Axioms for Asynchrony. 376-390 BibTeX
Peter Sewell: On Implementations and Semantics of a Concurrent Programming Language. 391-405 BibTeX
Harro Wimmel, Lutz Priese: Algebraic Characterization of Petri Net Pomset Semantics. 406-420 BibTeX