The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Gérard Boudol
    The Lambda-Calculus with Multiplicities (Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:1-6 [Conf]
  2. Joost Engelfriet
    A Multiset Semantics for the pi-Calculus with Replication. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:7-21 [Conf]
  3. Mads Dam
    Model Checking Mobile Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:22-36 [Conf]
  4. Glenn Bruns
    A Practical Technique for Process Abstraction. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:37-49 [Conf]
  5. Maarten M. Fokkinga, Mannes Poel, Job Zwiers
    Modular Completeness for Communication Closed Layers. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:50-65 [Conf]
  6. Rob J. van Glabbeek
    The Linear Time - Branching Time Spectrum II. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:66-81 [Conf]
  7. Vladimiro Sassone, Mogens Nielsen, Glynn Winskel
    A Classification of Models for Concurrency. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:82-96 [Conf]
  8. Luca Aceto, David Murphy
    On the Ill-Timed but Well-Caused. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:97-111 [Conf]
  9. Roberto M. Amadio
    On the Reduction of Chocs Bisimulation to pi-Calculus Bisimulation. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:112-126 [Conf]
  10. Davide Sangiorgi
    A Theory of Bisimulation for the pi-Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:127-142 [Conf]
  11. Søren Christensen, Yoram Hirshfeld, Faron Moller
    Bisimulation Equivalence is Decidable for Basic Parallel Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:143-157 [Conf]
  12. Cliff B. Jones
    A pi-Calculus Semantics for an Object-Based Design Notation. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:158-172 [Conf]
  13. K. V. S. Prasad
    Programming with Broadcasts. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:173-187 [Conf]
  14. Uno Holmer
    Interpreting Broadcast Communication in SCCS. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:188-201 [Conf]
  15. Matthew Hennessy, H. Lin
    Proof Systems for Message-Passing Process Algebras. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:202-216 [Conf]
  16. Michael J. Butler
    Refinement and Decomposition of Value-Passing Action Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:217-232 [Conf]
  17. Pierre Wolper, Patrice Godefroid
    Partial-Order Methods for Temporal Verification. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:233-246 [Conf]
  18. Ole Høgh Jensen, Jarl Tuxen Lang, Christian Jeppesen, Kim Guldstrand Larsen
    Model Construction for Implicit Specifications in Model Logic. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:247-261 [Conf]
  19. Orna Bernholtz, Orna Grumberg
    Branching Time Temporal Logic and Amorphous Tree Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:262-277 [Conf]
  20. Jeremy Gunawardena
    A Generalized Event Structure for the Muller Unfolding of a Safe Net. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:278-292 [Conf]
  21. Eric Goubault
    Domains of Higher-Dimensional Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:293-307 [Conf]
  22. Jos C. M. Baeten, Jan A. Bergstra
    Non Interleaving Process Algebra. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:308-323 [Conf]
  23. Roberto Segala
    Quiescence, Fairness, Testing, and the Notion of Implementation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:324-338 [Conf]
  24. Rob T. Udink, Joost N. Kok
    Two Fully Abstract Models for UNITY. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:339-352 [Conf]
  25. Shengzong Zhou, Rob Gerth, Ruurd Kuiper
    Transformations Preserving Properties and Properties Preserved by Transformations in Fair Transition Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:353-367 [Conf]
  26. Marija Cubric, Prakash Panangaden
    Minimal Memory Schedules for Dataflow Networks. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:368-383 [Conf]
  27. Robert Kim Yates
    Networks of Real-Time Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:384-397 [Conf]
  28. Christian Lengauer
    Loop Parallelization in the Polytope Model. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:398-416 [Conf]
  29. Patrice Brémond-Grégoire, Insup Lee, Richard Gerber
    ACSR: An Algebra of Communicating Shared Resources with Dense Time and Priorities. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:417-431 [Conf]
  30. Wan Fokkink
    An Elimination Theorem for Regular Behaviours with Integration. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:432-446 [Conf]
  31. Bart Vergauwen, Johan Lewi
    A Linear Local Model Checking Algorithm for CTL. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:447-461 [Conf]
  32. P. W. Hoogers, H. C. M. Kleijn, P. S. Thiagarajan
    Local Event Structures and Petri Nets. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:462-476 [Conf]
  33. Jos C. M. Baeten, Chris Verhoef
    A Congruence Theorem for Structured Operational Semantics with Predicates. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:477-492 [Conf]
  34. Flemming Nielson, Hanne Riis Nielson
    From CML to Process Algebras (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:493-508 [Conf]
  35. Kohei Honda
    Types for Dynamic Interaction. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:509-523 [Conf]
  36. Vasco Thudichum Vasconcelos, Kohei Honda
    Principal Typing Schemes in a Polyadic pi-Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:524-538 [Conf]
  37. Bard Bloom
    Structured Operational Sematics for Process Algebras and Equational Axiom Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:539-540 [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