Homology and bisimulation of asynchronous transition systems and Petri nets

MaRDI QIDQ892055zbMATH OpenFDO

Authors Ahmet A. Khusainov

Publication date 18 November 2015

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1307.5377, http://semr.math.nsc.ru/v11/p863-877.pdf

zbMATH Keywords

simplicial complexasynchronous systembisimulationPetri netpartial actionhomology groupstrace monoid

Mathematics Subject Classification ID

Simplicial sets and complexes in algebraic topology (55U10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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.

Recommendations

• Homology groups of asynchronous systems, Petri nets, and trace languages
• On the homology of small categories and asynchronous transition systems
• scientific article; zbMATH DE number 5905566
• Petri nets and bisimulation
• The homology of partial monoid actions and Petri nets

Cited in

(4)

• The homology of partial monoid actions and Petri nets
• On the homology of small categories and asynchronous transition systems
• Homology groups of asynchronous systems, Petri nets, and trace languages
• Homothecy, bifurcations, continuity and monotonicity in timed continuous Petri nets under infinite server semantics

This page was built for publication: Homology and bisimulation of asynchronous transition systems and Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892055)