2002 · 55 citations · 11 references
ComputingComputer ScienceMathematicsDynamical SystemsFormal MethodsSet TheoryAutomata TheoryCategory TheoryFinite AutomataFinite-state MachinesModel CheckingModel TheoryAutomata EquivalenceBisimulationBisimulation AnalysisCategorical SemanticsEquivalence Of Transition SystemsSet-theoretic FoundationsStrong BisimulationTransition Systems
We introduce the notion of higher dimensional transition systems as a model of concurrency providing an elementary, set-theoretic formalisation of the idea of higher dimensional transition. We show an embedding of the category of higher dimensional transition systems into that of higher dimensional automata which cuts down to an equivalence when we restrict to non-degenerate automata. Moreover, we prove that the natural notion of bisimulation for such structures is a generalisation of the strong history preserving bisimulation, and provide an abstract categorical account of it via open maps. Finally, we define a notion of unfolding for higher dimensional transition systems and characterise the structures so obtained as a generalisation of event structures.
11
Glynn Winskel · 1987 · 392 citations
José Meseguer, Ugo Montanari · Information and Computation · 1990 · 353 citations
André Joyal, Mogens Nielsen, Glynn Winskel · Information and Computation · 1996 · 269 citations
Modeling concurrency with geometry
Vaughn Pratt · 1991 · 214 citations · Full text