DocumentCode
2720169
Title
Higher dimensional transition systems
Author
Cattani, Gian Luca ; Sassone, Vladimiro
Author_Institution
Dept. of Comput. Sci., Aarhus Univ., Denmark
fYear
1996
fDate
27-30 Jul 1996
Firstpage
55
Lastpage
62
Abstract
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
Keywords
automata theory; parallel programming; process algebra; programming theory; set theory; abstract categorical account; concurrency; elementary set-theoretic formalisation; embedding; event structures; higher dimensional automata; higher dimensional transition; higher dimensional transition systems; natural notion; nondegenerate automata; open maps; strong history preserving bisimulation; Automata; Buildings; Computer science; Concrete; Concurrent computing; Fitting; History; Humans; Interleaved codes; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1996. LICS '96. Proceedings., Eleventh Annual IEEE Symposium on
Conference_Location
New Brunswick, NJ
ISSN
1043-6871
Print_ISBN
0-8186-7463-6
Type
conf
DOI
10.1109/LICS.1996.561303
Filename
561303
Link To Document