Finite automorphism groups of Petri Nets
Modelirovanie i analiz informacionnyh sistem, Tome 15 (2008) no. 4, pp. 3-9
Voir la notice de l'article provenant de la source Math-Net.Ru
The notion of isomorphism and automorphism for labeled transition systems are defined, in particular monotonic isomorphism and automorphism – for well structured transition systems. It is shown, that any automorphism corresponds to a sertain bisimulation. It is prowed, that a group of monotonic automorphisms in any Petri Nets is finite.
Keywords:
group of automorphism, bisimulation of states
Mots-clés : monotonic isomorphism.
Mots-clés : monotonic isomorphism.
@article{MAIS_2008_15_4_a0,
author = {Yu. A. Belov},
title = {Finite automorphism groups of {Petri} {Nets}},
journal = {Modelirovanie i analiz informacionnyh sistem},
pages = {3--9},
publisher = {mathdoc},
volume = {15},
number = {4},
year = {2008},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MAIS_2008_15_4_a0/}
}
Yu. A. Belov. Finite automorphism groups of Petri Nets. Modelirovanie i analiz informacionnyh sistem, Tome 15 (2008) no. 4, pp. 3-9. http://geodesic.mathdoc.fr/item/MAIS_2008_15_4_a0/