The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Wan Fokkink, Natalia Ioustinova, Ernst Kesseler, Jaco van de Pol, Yaroslav S. Usenko, Yuri A. Yushtein
    Refinement and Verification Applied to an In-Flight Data Acquisition Unit. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:1-23 [Conf]
  2. Amir Pnueli, Yonit Kesten
    A Deductive Proof System for CTL. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:24-40 [Conf]
  3. Vaughan R. Pratt
    Event-State Duality: The Enriched Case. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:41-56 [Conf]
  4. Alexander Moshe Rabinovich
    Expressive Power of Temporal Logics. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:57-75 [Conf]
  5. Davide Sangiorgi
    Types, or: Where's the Difference Between CCS and pi? [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:76-97 [Conf]
  6. Julian C. Bradfield
    Introduction to Modal and Temporal Mu-Calculi (Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:98- [Conf]
  7. Andrew D. Gordon
    Types for Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:99-100 [Conf]
  8. Yonit Kesten, Amir Pnueli, Elad Shahar, Lenore D. Zuck
    Network Invariants in Action. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:101-115 [Conf]
  9. Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso
    Regular Model Checking Made Simple and Efficient. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:116-130 [Conf]
  10. Kousha Etessami
    A Hierarchy of Polynomial-Time Computable Simulations for Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:131-144 [Conf]
  11. P. Madhusudan, P. S. Thiagarajan
    A Decidable Class of Asynchronous Distributed Controllers. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:145-160 [Conf]
  12. Antti Valmari, Antti Kervinen
    Alphabet-Based Synchronisation is Exponentially Cheaper. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:161-176 [Conf]
  13. Markus Lohrey
    Safe Realizability of High-Level Message Sequence Charts. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:177-192 [Conf]
  14. Eugene Asarin, Gerardo Schneider
    Widening the Boundary between Decidable and Undecidable Hybrid Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:193-208 [Conf]
  15. Luís Caires, Luca Cardelli
    A Spatial Logic for Concurrency (Part II). [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:209-225 [Conf]
  16. Beata Konikowska, Wojciech Penczek
    Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:226-239 [Conf]
  17. Martin Lange
    Local Model Checking Games for Fixed Point Logic with Chop. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:240-254 [Conf]
  18. Maria Sorea
    A Decidable Fixpoint Logic for Time-Outs. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:255-271 [Conf]
  19. Jens Chr. Godskesen, Thomas T. Hildebrandt, Vladimiro Sassone
    A Calculus of Mobile Resources. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:272-287 [Conf]
  20. David Teller, Pascal Zimmer, Daniel Hirschkoff
    Using Ambients to Control Resources. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:288-303 [Conf]
  21. Massimo Merro, Vladimiro Sassone
    Typing and Subtyping Mobility in Boxed Ambients. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:304-320 [Conf]
  22. Roberto Bruni, Cosimo Laneve, Ugo Montanari
    Orchestrating Transactions in Join Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:321-337 [Conf]
  23. Christel Baier, Joost-Pieter Katoen, Holger Hermanns, Boudewijn R. Haverkort
    Simulation for Continuous-Time Markov Chains. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:338-354 [Conf]
  24. Josee Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden
    Weak Bisimulation is Sound and Complete for PCTL*. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:355-370 [Conf]
  25. Stefano Cattani, Roberto Segala
    Decision Algorithms for Probabilistic Bisimulation. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:371-385 [Conf]
  26. Gerald Lüttgen, Michael Mendler
    Axiomatizing an Algebra of Step Reactions for Synchronous Languages. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:386-401 [Conf]
  27. Jean Fanchon, Rémi Morin
    Regular Sets of Pomsets with Autoconcurrency. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:402-417 [Conf]
  28. Philippa Gardner, Cosimo Laneve, Lucian Wischik
    The Fusion Machine. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:418-433 [Conf]
  29. Mikkel Nygaard, Glynn Winskel
    HOPLA-A Higher-Order Process Language. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:434-448 [Conf]
  30. Maria Grazia Buscemi, Ugo Montanari
    A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:449-465 [Conf]
  31. Stephen D. Brookes
    Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:466-482 [Conf]
  32. Michele Boreale, Maria Grazia Buscemi
    A Framework for the Analysis of Security Protocols. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:483-498 [Conf]
  33. Roberto M. Amadio, Witold Charatonik
    On Name Generation and Set-Based Analysis in the Dolev-Yao Model. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:499-514 [Conf]
  34. Ralf Küsters
    On the Decidability of Cryptographic Protocols with Open-Ended Data Structures. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:515-530 [Conf]
  35. H. C. M. Kleijn, Maciej Koutny
    Causality Semantics of Petri Nets with Weighted Inhibitor Arcs. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:531-546 [Conf]
  36. Hagen Völzer
    Refinement-Robust Fairness. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:547-561 [Conf]
  37. Slawomir Lasota
    Decidability of Strong Bisimilarity for Timed BPP. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:562-578 [Conf]
  38. Jirí Srba
    Undecidability of Weak Bisimilarity for Pushdown Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:579-593 [Conf]
  39. Antonín Kucera, Richard Mayr
    Why Is Simulation Harder than Bisimulation? [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:594-610 [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