CONCUR B

39 papers

YearTitle / Authors
1999"Next" Heuristic for On-the-Fly Model Checking.
Rajeev Alur, Bow-Yaw Wang
1999A Partial Order Event Model for Concurrent Objects.
José Meseguer, Carolyn L. Talcott
1999An Unfolding Algorithm for Synchronous Products of Transition Systems.
Javier Esparza, Stefan Römer
1999Approximate Symbolic Model Checking of Continuous-Time Markov Chains.
Christel Baier, Joost-Pieter Katoen, Holger Hermanns
1999Automating Modular Verification.
Rajeev Alur, Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. Mang
1999CONCUR '99: Concurrency Theory, 10th International Conference, Eindhoven, The Netherlands, August 24-27, 1999, Proceedings
Jos C. M. Baeten, Sjouke Mauw
1999Computing Minimum and Maximum Reachability Times in Probabilistic Systems.
Luca de Alfaro
1999Event Structures as Presheaves -Two Representation Theorems.
Glynn Winskel
1999Expressiveness and Distributed Implementation of Conciurrent Calculi with Link Mobility.
Catuscia Palamidessi
1999From Synchrony to Asynchrony.
Albert Benveniste, Benoît Caillaud, Paul Le Guernic
1999Generating Type Systems for Process Graphs.
Barbara König
1999Generic Process Algebras for Asynchronous Communication.
Frank S. de Boer, Gianluigi Zavattaro
1999Localizability of Fairness Constraints and Their Distributed Implementations.
Yuh-Jzer Joung
1999Metrics for Labeled Markov Systems.
Josée Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden
1999Model Checking of Message Sequence Charts.
Rajeev Alur, Mihalis Yannakakis
1999Model Checking of Time Petri Nets Based on Partial Order Semantics.
Burkhard Bieber, Hans Fleischhack
1999Object Types against Races.
Cormac Flanagan, Martín Abadi
1999On Coherence Properties in Team Rewriting Models of Concurrency.
Thomas Noll
1999On the Semantics of Place/Transition Nets.
Rémi Morin, Brigitte Rozoy
1999Open Bisimulations on Chi Processes.
Yuxi Fu
1999Partial Order Reduction for Model Checking of Timed Automata.
Marius Minea
1999Petri Nets, Configuration Structures and Higher Dimensional Automata.
Rob J. van Glabbeek
1999Proof-Checking Protocols Using Bisimulations.
Christine Röckl, Javier Esparza
1999Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic.
Béatrice Bérard, Laurent Fribourg
1999Rectangular Hybrid Games.
Thomas A. Henzinger, Benjamin Horowitz, Rupak Majumdar
1999Robust Satisfaction.
Orna Kupferman, Moshe Y. Vardi
1999Statecharts Via Process Algebra.
Gerald Lüttgen, Michael von der Beeck, Rance Cleaveland
1999Suptyping and Locality in Distributed Higher Order Processes (extended abstract).
Nobuko Yoshida, Matthew Hennessy
1999Synchronous Structures.
David Nowak, Jean-Pierre Talpin, Paul Le Guernic
1999Synthesis of Large Concurrent Programs via Pairwise Composition.
Paul C. Attie
1999Techniques for Decidability and Undecidability of Bisimilarity.
Petr Jancar, Faron Moller
1999Temporal Process Logic (Abstract).
Rance Cleaveland
1999Testing Concurrent Systems: A Formal Approach.
Jan Tretmans
1999The Expressive Power of Temporal Logic of Actions (Extended Abstract).
Arkadi Estrin, Michael Kaminski
1999Timed Automata and the Theory of Real Numbers.
Hubert Comon, Yan Jurski
1999Validating Firewalls in Mobile Ambients.
Flemming Nielson, Hanne Riis Nielson, René Rydhof Hansen, Jacob Grydholt Jensen
1999Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time.
Antonín Kucera, Richard Mayr
1999Weak and Strong Composition of High-Level Petri-Nets.
Eike Best, Alexander Lavrov
1999Weakest-Congruence Results for Livelock-Preserving Equivalences.
Antti Puhakka, Antti Valmari