|
Modelirovanie i Analiz Informatsionnykh Sistem, 2008, Volume 15, Number 4, Pages 3–9
(Mi mais111)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Finite automorphism groups of Petri Nets
Yu. A. Belov Yaroslavl State University
Abstract:
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, monotonic isomorphism.
Received: 20.11.2008
Citation:
Yu. A. Belov, “Finite automorphism groups of Petri Nets”, Model. Anal. Inform. Sist., 15:4 (2008), 3–9
Linking options:
https://www.mathnet.ru/eng/mais111 https://www.mathnet.ru/eng/mais/v15/i4/p3
|
Statistics & downloads: |
Abstract page: | 304 | Full-text PDF : | 90 | References: | 65 |
|