The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Albert Benveniste, Stefan Haar, Eric Fabre, Claude Jard
    Distributed Monitoring of Concurrent and Asynchronous Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:1-26 [Conf]
  2. Alin Stefanescu, Javier Esparza, Anca Muscholl
    Synthesis of Distributed Algorithms Using Asynchronous Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:27-41 [Conf]
  3. Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, Sudipto Guha, Mihalis Yannakakis
    Compression of Partially Ordered Strings. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:42-56 [Conf]
  4. Rob J. van Glabbeek, Frits W. Vaandrager
    Bundle Event Structures and CCSP. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:57-71 [Conf]
  5. Bartek Klin, Pawel Sobocinski
    Syntactic Formats for Free. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:72-86 [Conf]
  6. Irek Ulidowski
    Priority Rewrite Systems for OSOS Process Languages. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:87-101 [Conf]
  7. Luca de Alfaro
    Quantitative Verification and Control via the Mu-Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:102-126 [Conf]
  8. Rajeev Alur, Salvatore La Torre, P. Madhusudan
    Playing Games with Boxes and Diamonds. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:127-141 [Conf]
  9. Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, Mariëlle Stoelinga
    The Element of Surprise in Timed Games. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:142-156 [Conf]
  10. Petr Jancar, Antonín Kucera, Faron Moller
    Deciding Bisimilarity between BPA and BPP Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:157-171 [Conf]
  11. Ahmed Bouajjani, Peter Habermehl, Tomás Vojnar
    Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:172-187 [Conf]
  12. Nancy A. Lynch
    Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic, ... [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:187-188 [Conf]
  13. Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
    A Process-Algebraic Language for Probabilistic I/O Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:189-203 [Conf]
  14. Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager
    Compositionality for Probabilistic Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:204-222 [Conf]
  15. Paul Gastin, Dietrich Kuske
    Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:218-232 [Conf]
  16. Zdenek Sawa
    Equivalence Checking of Non-Flat Systems Is EXPTIME-hard. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:233-248 [Conf]
  17. Nicolas Markey, Ph. Schnoebelen
    Model Checking a Path. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:248-262 [Conf]
  18. Arie Gurfinkel, Marsha Chechik
    Multi-Valued Model Checking via Classical Model Checking. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:263-277 [Conf]
  19. Naoya Nitta, Hiroyuki Seki
    An Extension of Pushdown System and Its Model Checking Method. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:278-292 [Conf]
  20. Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan
    Netcharts: Bridging the gap between HMSCs and executable specifications. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:293-307 [Conf]
  21. Blaise Genest, Loïc Hélouët, Anca Muscholl
    High-Level Message Sequence Charts and Projections. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:308-322 [Conf]
  22. Paulo Mateus, John C. Mitchell, Andre Scedrov
    Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:323-345 [Conf]
  23. Michael Backes
    Unifying Simulatability Definitions in Cryptographic Systems under Different Timing Assumptions. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:346-360 [Conf]
  24. Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov
    Contract Signing, Optimism, and Advantage. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:361-377 [Conf]
  25. Mikkel Nygaard, Glynn Winskel
    Full Abstraction for HOPLA. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:378-392 [Conf]
  26. Uwe Nestmann, Rachele Fuzzati, Massimo Merro
    Modeling Consensus in a Process Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:393-407 [Conf]
  27. Philippa Gardner, Cosimo Laneve, Lucian Wischik
    Linear Forwarders. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:408-422 [Conf]
  28. Nina Amla, E. Allen Emerson, Kedar S. Namjoshi, Richard J. Trefler
    Abstract Patterns of Compositional Reasoning. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:423-438 [Conf]
  29. Flavio Corradini, Maria Rita Di Berardini, Walter Vogler
    Relating Fairness and Timing in Process Algebras. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:438-452 [Conf]
  30. Barry Norton, Gerald Lüttgen, Michael Mendler
    A Compositional Semantic Theory for Synchronous Component-based Design. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:453-467 [Conf]
  31. Vincent Danos, Josee Desharnais, Prakash Panangaden
    Conditional Expectation and the Approximation of Labelled Markov Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:468-482 [Conf]
  32. Christel Baier, Holger Hermanns, Joost-Pieter Katoen, Verena Wolf
    Comparative Branching-Time Semantics. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:482-497 [Conf]
  33. Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky
    Quantitative Relations and Approximate Process Equivalences. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:498-512 [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