See this document in CiteSeerX!

Bisimulation from Open Maps (1994)  (Make Corrections)  (23 citations)
André Joyal, Mogens Nielsen, Glynn Winskel
Information and Computation



  Home/Search   Context   Related

 
View or download:
brics.dk/RS/94/Ref...RICSRS947.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  brics.dk/RS/94/Ref/BRICSRS94... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: An abstract definition of bisimulation is presented. It enables a uniform definition of bisimulation across a range of different models for parallel computation presented as categories. As examples, transition systems, synchronisation trees, transition systems with independence (an abstraction from Petri nets) and labelled event structures are considered. On transition systems the abstract definition readily specialises to Milner's strong bisimulation. On event structures it explains and... (Update)

Context of citations to this paper:   More

.... definition of bisimulation based on open maps applicable to any category of models equipped with a distinguished subcategory of paths [19]. It also exposed a new space of models. Presheaf categories possess a canonical choice of open maps and bisimulation, and can themselves be...

.... in [7] Finally, we would like to compare our categories of process graphs to the well developed models of parallel computation in [8]. On the one hand, one may ask whether conciseness leads to useful subcategories in their setting. Does conciseness yield interesting...

Cited by:   More
Formal Models And Game Design - Stefan Gr Unvogel (2004)   (Correct)
Concise Graphs and Functional Bisimulations - Ling Cheung And   (Correct)
Relational Semantics of Non-Deterministic Dataflow - Hildebrandt (1997)   (Correct)

Similar documents (at the sentence level):
35.3%:   Bisimulation and Open Maps - Joyal, Nielsen, Winskel (1993)   (Correct)
7.5%:   Petri Nets and Bisimulations - Nielsen, Winskel (1995)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Presheaf Models Concurrency - Cattani (1999)   (Correct)
0.2:   History Dependent Automata - Montanari, Pistore (2001)   (Correct)
0.2:   A Coinduction Principle for Recursive Data Types Based on.. - Fiore (1996)   (Correct)

Similar documents based on text:   More   All
1.1:   Linear Logic on Petri Nets - Engberg, Winskel (1994)   (Correct)
1.0:   A HOL Basis for Reasoning about Functional Programs - Agerholm (1994)   (Correct)
0.9:   From Branching to Linear Metric Domains (and back) - van Breugel (1995)   (Correct)

Related documents from co-citation:   More   All
7:   Communication and Concurrency (context) - Milner - 1989
7:   A completeness theorem for open maps (context) - Joyal, Moerdijk - 1994
6:   Equivalence Notions for Concurrent System and Refinement of Actions (context) - Goltz, van Glabbeek - 1989

BibTeX entry:   (Update)

A. Joyal, M. Nielsen, and G. Winskel. Bisimulation from open maps. Technical report, BRICS RS-94-7, 1994. http://citeseer.ist.psu.edu/joyal94bisimulation.html   More

@article{ joyal96bisimulation,
    author = "Andre Joyal and Mogens Nielsen and Glynn Winskel",
    title = "Bisimulation from Open Maps",
    journal = "Information and Computation",
    volume = "127",
    number = "2",
    pages = "164-185",
    year = "1996",
    url = "citeseer.ist.psu.edu/joyal94bisimulation.html" }
Citations (may not include all citations):
1933   Communication and concurrency (context) - Milner - 1989
484   Calculus of communicating systems (context) - Milner - 1980
236   Categories for the Working Mathematician (context) - MacLane - 1971
125   Event structures (context) - Winskel - 1987
71   Modelling concurrency with partial orders - Pratt - 1986
58   Equivalence notions for concurrent systems and refinement of.. (context) - Van Glabeek, Goltz - 1989
33   A completeness theorem for open maps (context) - Joyal, Moerdijk
10   Behaviour structures and nets (context) - Rabinovitch, Traktenbrot - 1988
7   Information and Computation (context) - Benson, Ben-Shachar - 1988
4   To appear as a chapter in the Handbook of Logic in Computer .. (context) - Winskel, Nielsen
4   Correspondence theory (context) - Van Bentham - 1984
3   Springer Lecture Notes in CS (context) - Castellani - 1985
1   To be published in New Results in Theoretical Computer Scien.. (context) - Nielsen, Clausen - 1994



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.brics.dk/RS/94/Ref/BRICS-RS-94-Ref/):   More
Decidability of Systems of Set Constraints with Negative.. - Aiken, Kozen, Wimmers (1994)   (Correct)
A Fractal which violates the Axiom of Determinacy - Riis (1994)   (Correct)
Complexity of Nondeterministic Functions - Andreev (1994)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC