4 research outputs found
History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps
We show that history-preserving bisimilarity for higher-dimensional automata
has a simple characterization directly in terms of higher-dimensional
transitions. This implies that it is decidable for finite higher-dimensional
automata. To arrive at our characterization, we apply the open-maps framework
of Joyal, Nielsen and Winskel in the category of unfoldings of precubical sets.Comment: Minor updates in accordance with reviewer comments. Submitted to MFPS
201
Homology and Bisimulation of Asynchronous Transition Systems and Petri Nets
Homology groups of labelled asynchronous transition systems and Petri nets
are introduced. Examples of computing the homology groups are given. It is
proved that if labelled asynchronous transition systems are bisimulation
equivalent, then they have isomorphic homology groups. A method of constructing
a Petri net with given homology groups is found.Comment: 21 page