Homology and bisimulation of asynchronous transition systems and Petri nets

摘要

Homology groups of labelled asynchronous transition systemsand Petri nets are introduced. Examples of computing the homologygroups are given. It is proved that if labelled asynchronoustransition systems are bisimulation equivalent, then they have isomorphichomology groups. A method of constructing a Petri net with givenhomology groups is presented.