On the Hereditary Properties of Modular Nets
Modelirovanie i analiz informacionnyh sistem, Tome 19 (2012) no. 6, pp. 9-20.

Voir la notice de l'article provenant de la source Math-Net.Ru

Hereditary graph properties are those that can be inherited from the graph to all its subgraphs (such as planarity). Modular nets of active resources is a (Petri nets)-powerful formalism with simple modular syntax. Boundedness and liveness are fundamental semantic properties for Petri net models. It is shown that boundedness and liveness, being not hereditary in general, are downward-hereditary (net-to-subnet) and upward-hereditary (subnet-to-net) for the particular types of AR-subnets. It is also shown that boundedness is downward-hereditary and unboundedness is upward-hereditary for arbitrary subnets after a specific module interface transformation (so-called R-normalization).
Keywords: Petri nets, active resources, modular verification, boundedness, liveness.
@article{MAIS_2012_19_6_a0,
     author = {V. A. Bashkin},
     title = {On the {Hereditary} {Properties} of {Modular} {Nets}},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {9--20},
     publisher = {mathdoc},
     volume = {19},
     number = {6},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2012_19_6_a0/}
}
TY  - JOUR
AU  - V. A. Bashkin
TI  - On the Hereditary Properties of Modular Nets
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2012
SP  - 9
EP  - 20
VL  - 19
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2012_19_6_a0/
LA  - ru
ID  - MAIS_2012_19_6_a0
ER  - 
%0 Journal Article
%A V. A. Bashkin
%T On the Hereditary Properties of Modular Nets
%J Modelirovanie i analiz informacionnyh sistem
%D 2012
%P 9-20
%V 19
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2012_19_6_a0/
%G ru
%F MAIS_2012_19_6_a0
V. A. Bashkin. On the Hereditary Properties of Modular Nets. Modelirovanie i analiz informacionnyh sistem, Tome 19 (2012) no. 6, pp. 9-20. http://geodesic.mathdoc.fr/item/MAIS_2012_19_6_a0/

[1] V. A. Bashkin, “Seti aktivnykh resursov”, Modelirovanie i analiz informatsionnykh sistem, 14:4 (2007), 13–19

[2] V. A. Bashkin, “Formalizatsiya semantiki sistem s nenadezhnymi agentami pri pomoschi setei aktivnykh resursov”, Programmirovanie, 2010, no. 4, 3–15

[3] V. A. Bashkin, I. A. Lomazova, “Resource Driven Automata Nets”, Fundamenta Informaticae, 109:3 (2011), 223–236 | MR | Zbl

[4] V. A. Bashkin, “Modulnye seti aktivnykh resursov”, Avtomatika i vychislitelnaya tekhnika, 2012, no. 1, 5–18

[5] E. Best, R. Devillers, M. Koutny, Petri Net Algebra, EATCS Monographs on TCS, Springer, Berlin, 2001 | MR

[6] E. Best, W. Fra̧czak, R. P. Hopkins, H. Klaudel, E. Pelz, “M-nets: an algebra of high level Petri nets, with an application to the semantics of concurrent programming languages”, Acta Inf., 35 (1998), 813–857 | MR | Zbl

[7] M. Borowiecki, I. Broere, M. Frick, P. Mihok, S. Peter, “A survey of hereditary properties of graphs”, Discuss. Mathem.: Graph Theory, 17:1 (1997), 5–50 | MR | Zbl

[8] S. Christensen, L. Petrucci, “Modular analysis of Petri nets”, The Computer Journal, 43:3 (2000), 224–242 | Zbl

[9] P. Jančar, “Decidability questions for bisimilarity of Petri nets and some related problems”, Proc. of STACS'94, LNCS, 775, 1994, 581–592 | MR | Zbl

[10] E. Kindler, “A compositional partial order semantics for Petri net components”, Proc. of ATPN'1997, LNCS, 1248, Springer, 1997, 235–252 | MR

[11] K. Klai, S. Haddad, J.-M. Ilié, “Modular Verification of Petri Nets Properties: A Structure-Based Approach”, Proc. of FORTE'2005, LNCS, 3731, 2005, 189–203 | Zbl

[12] V. E. Kotov, Seti Petri, Nauka, M., 1984 | MR

[13] I. A. Lomazova, “Nested Petri nets — a Formalism for Specification and Verification of Multi-Agent Distributed Systems”, Fundamenta Informaticae, 43 (2000), 195–214 | MR | Zbl

[14] F. Kharari, Teoriya grafov, Mir, M., 1973 | MR