Conferences in DBLP
Rance Cleaveland Temporal Process Logic (Abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:1- [Conf ] Javier Esparza , Stefan Römer An Unfolding Algorithm for Synchronous Products of Transition Systems. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:2-20 [Conf ] Rob J. van Glabbeek Petri Nets, Configuration Structures and Higher Dimensional Automata. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:21-27 [Conf ] Catuscia Palamidessi Expressiveness and Distributed Implementation of Conciurrent Calculi with Link Mobility. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:28-29 [Conf ] Petr Jancar , Faron Moller Techniques for Decidability and Undecidability of Bisimilarity. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:30-45 [Conf ] Jan Tretmans Testing Concurrent Systems: A Formal Approach. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:46-65 [Conf ] Luca de Alfaro Computing Minimum and Maximum Reachability Times in Probabilistic Systems. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:66-81 [Conf ] Rajeev Alur , Luca de Alfaro , Thomas A. Henzinger , Freddy Y. C. Mang Automating Modular Verification. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:82-97 [Conf ] Rajeev Alur , Bow-Yaw Wang ``Next'' Heuristic for On-the-Fly Model Checking. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:98-113 [Conf ] Rajeev Alur , Mihalis Yannakakis Model Checking of Message Sequence Charts. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:114-129 [Conf ] Paul C. Attie Synthesis of Large Concurrent Programs via Pairwise Composition. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:130-145 [Conf ] Christel Baier , Joost-Pieter Katoen , Holger Hermanns Approximate Symbolic Model Checking of Continuous-Time Markov Chains. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:146-161 [Conf ] Albert Benveniste , Benoît Caillaud , Paul Le Guernic From Synchrony to Asynchrony. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:162-177 [Conf ] Béatrice Bérard , Laurent Fribourg Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:178-193 [Conf ] Eike Best , Alexander Lavrov Weak and Strong Composition of High-Level Petri-Nets. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:194-209 [Conf ] Burkhard Bieber , Hans Fleischhack Model Checking of Time Petri Nets Based on Partial Order Semantics. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:210-225 [Conf ] Frank S. de Boer , Gianluigi Zavattaro Generic Process Algebras for Asynchronous Communication. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:226-241 [Conf ] Hubert Comon , Yan Jurski Timed Automata and the Theory of Real Numbers. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:242-257 [Conf ] Josee Desharnais , Vineet Gupta , Radha Jagadeesan , Prakash Panangaden Metrics for Labeled Markov Systems. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:258-273 [Conf ] Arkadi Estrin , Michael Kaminski The Expressive Power of Temporal Logic of Actions (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:274-287 [Conf ] Cormac Flanagan , Martín Abadi Object Types against Races. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:288-303 [Conf ] Yuxi Fu Open Bisimulations on Chi Processes. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:304-319 [Conf ] Thomas A. Henzinger , Benjamin Horowitz , Rupak Majumdar Rectangular Hybrid Games. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:320-335 [Conf ] Yuh-Jzer Joung Localizability of Fairness Constraints and Their Distributed Implementations. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:336-351 [Conf ] Barbara König Generating Type Systems for Process Graphs. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:352-367 [Conf ] Antonín Kucera , Richard Mayr Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:368-382 [Conf ] Orna Kupferman , Moshe Y. Vardi Robust Satisfaction. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:383-398 [Conf ] Gerald Lüttgen , Michael von der Beeck , Rance Cleaveland Statecharts Via Process Algebra. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:399-414 [Conf ] José Meseguer , Carolyn L. Talcott A Partial Order Event Model for Concurrent Objects. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:415-430 [Conf ] Marius Minea Partial Order Reduction for Model Checking of Timed Automata. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:431-446 [Conf ] Rémi Morin , Brigitte Rozoy On the Semantics of Place/Transition Nets. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:447-462 [Conf ] Flemming Nielson , Hanne Riis Nielson , René Rydhof Hansen , Jacob Grydholt Jensen Validating Firewalls in Mobile Ambients. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:463-477 [Conf ] Thomas Noll On Coherence Properties in Team Rewriting Models of Concurrency. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:478-493 [Conf ] David Nowak , Jean-Pierre Talpin , Paul Le Guernic Synchronous Structures. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:494-509 [Conf ] Antti Puhakka , Antti Valmari Weakest-Congruence Results for Livelock-Preserving Equivalences. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:510-524 [Conf ] Christine Röckl , Javier Esparza Proof-Checking Protocols Using Bisimulations. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:525-540 [Conf ] Glynn Winskel Event Structures as Presheaves -Two Representation Theorems. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:541-556 [Conf ] Nobuko Yoshida , Matthew Hennessy Suptyping and Locality in Distributed Higher Order Processes (extended abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:557-572 [Conf ]