The SCEAS System
Navigation Menu

Conferences in DBLP

International Conference on Concurrency Theory (CONCUR) (concur)
1999 (conf/concur/1999)

  1. Rance Cleaveland
    Temporal Process Logic (Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:1- [Conf]
  2. 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]
  3. Rob J. van Glabbeek
    Petri Nets, Configuration Structures and Higher Dimensional Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:21-27 [Conf]
  4. Catuscia Palamidessi
    Expressiveness and Distributed Implementation of Conciurrent Calculi with Link Mobility. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:28-29 [Conf]
  5. Petr Jancar, Faron Moller
    Techniques for Decidability and Undecidability of Bisimilarity. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:30-45 [Conf]
  6. Jan Tretmans
    Testing Concurrent Systems: A Formal Approach. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:46-65 [Conf]
  7. Luca de Alfaro
    Computing Minimum and Maximum Reachability Times in Probabilistic Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:66-81 [Conf]
  8. 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]
  9. Rajeev Alur, Bow-Yaw Wang
    ``Next'' Heuristic for On-the-Fly Model Checking. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:98-113 [Conf]
  10. Rajeev Alur, Mihalis Yannakakis
    Model Checking of Message Sequence Charts. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:114-129 [Conf]
  11. Paul C. Attie
    Synthesis of Large Concurrent Programs via Pairwise Composition. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:130-145 [Conf]
  12. 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]
  13. Albert Benveniste, Benoît Caillaud, Paul Le Guernic
    From Synchrony to Asynchrony. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:162-177 [Conf]
  14. 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]
  15. Eike Best, Alexander Lavrov
    Weak and Strong Composition of High-Level Petri-Nets. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:194-209 [Conf]
  16. 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]
  17. Frank S. de Boer, Gianluigi Zavattaro
    Generic Process Algebras for Asynchronous Communication. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:226-241 [Conf]
  18. Hubert Comon, Yan Jurski
    Timed Automata and the Theory of Real Numbers. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:242-257 [Conf]
  19. Josee Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden
    Metrics for Labeled Markov Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:258-273 [Conf]
  20. 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]
  21. Cormac Flanagan, Martín Abadi
    Object Types against Races. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:288-303 [Conf]
  22. Yuxi Fu
    Open Bisimulations on Chi Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:304-319 [Conf]
  23. Thomas A. Henzinger, Benjamin Horowitz, Rupak Majumdar
    Rectangular Hybrid Games. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:320-335 [Conf]
  24. Yuh-Jzer Joung
    Localizability of Fairness Constraints and Their Distributed Implementations. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:336-351 [Conf]
  25. Barbara König
    Generating Type Systems for Process Graphs. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:352-367 [Conf]
  26. 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]
  27. Orna Kupferman, Moshe Y. Vardi
    Robust Satisfaction. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:383-398 [Conf]
  28. Gerald Lüttgen, Michael von der Beeck, Rance Cleaveland
    Statecharts Via Process Algebra. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:399-414 [Conf]
  29. José Meseguer, Carolyn L. Talcott
    A Partial Order Event Model for Concurrent Objects. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:415-430 [Conf]
  30. Marius Minea
    Partial Order Reduction for Model Checking of Timed Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:431-446 [Conf]
  31. Rémi Morin, Brigitte Rozoy
    On the Semantics of Place/Transition Nets. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:447-462 [Conf]
  32. 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]
  33. Thomas Noll
    On Coherence Properties in Team Rewriting Models of Concurrency. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:478-493 [Conf]
  34. David Nowak, Jean-Pierre Talpin, Paul Le Guernic
    Synchronous Structures. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:494-509 [Conf]
  35. Antti Puhakka, Antti Valmari
    Weakest-Congruence Results for Livelock-Preserving Equivalences. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:510-524 [Conf]
  36. Christine Röckl, Javier Esparza
    Proof-Checking Protocols Using Bisimulations. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:525-540 [Conf]
  37. Glynn Winskel
    Event Structures as Presheaves -Two Representation Theorems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:541-556 [Conf]
  38. 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]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002