Abstract

We introduce the notion of higher dimensional transition systems as a model of concurrency providing an elemen-tary, set-theoretic formalisation of the idea of higher di-mensional transition. We show an embedding of the cate-gory of higher dimensional transition systems into that of higher dimensional automata which cuts down to an equiv-alence when we restrict to non-degenerate automata. More-ovel; we prove that the natural notion of bisimulation for such structures is a generalisation of the strong history pre-serving bisimulation, and provide an abstract categorical account of it via open maps. Finally, we dejine a notion of unfolding for higher dimensional transition systems and characterise the structures so obtained as a generalisation of event structures.

Citations

242	M.: Models for concurrency - Winskel, Nielsen - 1995
241	Event Structures - Winskel - 1986
158	nets are monoids - Meseguer, Montanari - 1990
121	Modeling concurrency with geometry - Pratt
113	Bisimulation from open maps - Joyal, Nielsen, et al. - 1996
43	Homology of higher-dimensional automata - Goubault, Jensen - 1992
41	Petri nets and step transition systems - Mukund - 1992
39	Configuration structures - Glabbeek, Plotkin - 1995
34	Refinement of actions in causality based models - Glabbeek, Goltz - 1990
20	Bisimulations for higher dimensional automata. Email message sent to the Concurrence mailing list on July 7 - Glabbeek - 1991
13	Models for concurrency: Towards a classification. Theor - Sassone, Nielsen, et al. - 1996
9	Local event structures and Petri nets - Hoogers, M - 1993
1	Open Maps (at) Work, BRICS Report Series RS-95-23 - CHENG, NIELSEN - 1995
1	Nets and Step Transition Systems. International Joumal of Foundations of - Petri