Homology and Bisimulation of Asynchronous Transition Systems and Petri Nets
Logic in Computer Science
2023-04-19 v1 Algebraic Topology
Abstract
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.
Keywords
Cite
@article{arxiv.1307.5377,
title = {Homology and Bisimulation of Asynchronous Transition Systems and Petri Nets},
author = {Ahmet A. Husainov},
journal= {arXiv preprint arXiv:1307.5377},
year = {2023}
}
Comments
21 pages