The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Robin Milner
    The Polyadic Pi-calculus (Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:1- [Conf]
  2. Michele Boreale, Rocco De Nicola
    Testing Equivalence for Mobile Processes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:2-16 [Conf]
  3. Lalita Jategaonkar, Albert R. Meyer
    Testing Equivalence for Petri Nets with Action Refinement: Preliminary Report. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:17-31 [Conf]
  4. Davide Sangiorgi, Robin Milner
    The Problem of ``Weak Bisimulation up to''. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:32-46 [Conf]
  5. Ed Brinksma
    On the Uniqueness of Fixpoints Modulo Observation Congruence. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:47-61 [Conf]
  6. Jan Friso Groote, Faron Moller
    Verification of Parallel Systems via Decomposition. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:62-76 [Conf]
  7. Rob Gerth, Ruurd Kuiper, John Segers
    Interface Refinement in Reactive Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:77-93 [Conf]
  8. Matthew Hennessy
    Concurrent Testing of Processes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:94-107 [Conf]
  9. Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn
    A Theory of Process with Localities (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:108-122 [Conf]
  10. Olaf Burkart, Bernhard Steffen
    Model Checking for Context-Free Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:123-137 [Conf]
  11. Søren Christensen, Hans Hüttel, Colin Stirling
    Bisimulation Equivalence is Decidable for all Context-Free Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:138-147 [Conf]
  12. Søren Christensen
    Distributed Bisimularity is Decidable for a Class of Infinite State-Space Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:148-161 [Conf]
  13. Amir Pnueli
    How Vital is Liveness? Verifying Timing Properties of Reactive and Hybrid Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:162-175 [Conf]
  14. Frank A. Stomp
    Preserving Specific Properties in Programm Development: How to Debug Programs (Conference Version). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:176-191 [Conf]
  15. Doron Peled
    Sometimes 'Some' is as Good as 'All'. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:192-206 [Conf]
  16. Roope Kaivola, Antti Valmari
    The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:207-221 [Conf]
  17. Ursula Goltz, Ruurd Kuiper, Wojciech Penczek
    Propositional Temporal Logics and Equivalences. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:222-236 [Conf]
  18. Vaughan R. Pratt
    The Duality of TIme and Information. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:237-253 [Conf]
  19. Eric Goubault, Thomas P. Jensen
    Homology of Higher Dimensional Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:254-268 [Conf]
  20. Arend Rensink
    Posets for Configurations! [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:269-285 [Conf]
  21. José Meseguer, Ugo Montanari, Vladimiro Sassone
    On the Semantics of Petri Nets. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:286-301 [Conf]
  22. Eric Badouel, Philippe Darondeau
    Structural Operational Specifications and the Trace Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:302-316 [Conf]
  23. Butler W. Lampson, Nancy A. Lynch, Jørgen F. Søgaard-Andersen
    At-Most-Once Message Delivery. A Case Study in Algorithm Verification. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:317-324 [Conf]
  24. Nick Reingold, Da-Wei Wang, Lenore D. Zuck
    Games I/O Automata Play (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:325-339 [Conf]
  25. Rajeev Alur, Costas Courcoubetis, Nicolas Halbwachs, David L. Dill, Howard Wong-Toi
    Minimization of Timed Transition Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:340-354 [Conf]
  26. Jim Davies, Steve Schneider
    Using CSP to Verify a Timed Protocol over a Fair Medium. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:355-369 [Conf]
  27. Henri B. Weinberg, Lenore D. Zuck
    Timed Ethernet: Real-Time Formal Specification of Ethernet. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:370-385 [Conf]
  28. Günter Karjoth
    Implementing LOTOS Specifications by Communicating State Machines. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:386-400 [Conf]
  29. Jos C. M. Baeten, Jan A. Bergstra
    Discrete Time Process Algebra. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:401-420 [Conf]
  30. Steven Klusener
    The Silent Step in Time. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:421-435 [Conf]
  31. Frits W. Vaandrager, Nancy A. Lynch
    Action Transducers and Timed Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:436-455 [Conf]
  32. Kim Guldstrand Larsen, Arne Skou
    Compositional Verification of Probabilistic Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:456-471 [Conf]
  33. Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka
    Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:472-485 [Conf]
  34. Ehud Y. Shapiro
    Embeddings Among Concurrent Programming Languages (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:486-503 [Conf]
  35. Alexander Moshe Rabinovich
    Logic of Trace Languages (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:504-517 [Conf]
  36. Joachim Parrow, Peter Sjödin
    Multiway Synchrinizaton Verified with Coupled Simulation. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:518-533 [Conf]
  37. Steven M. German
    Programming in a General Model of Synchronization. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:534-549 [Conf]
  38. Florence Maraninchi
    Operational and Compositional Semantics of Synchronous Automaton Compositions. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:550-564 [Conf]
  39. Gul Agha, Ian A. Mason, Scott F. Smith, Carolyn L. Talcott
    Towards a Theory of Actor Computation. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:565-579 [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