Many kinds of morphisms on Petri nets have been defined and studied. They can be used as formal techniques supporting refine- ment/abstraction of models. In this paper we introduce a new notion of morphism on marked graphs, a class of Petri nets used for the rep- resentation of systems having deterministic behavior. Such morphisms can indeed be used to represent a form of abstraction on marked graphs, consisting in folding cycles and identifying chains. We will then prove that systems joined by these morphisms show behavioral similarities.
Bernardinello, L., POMELLO CHINAGLIA POMELLO, L., Scaccabarozzi, S. (2014). Morphisms on Marked Graphs. In PNSE 2014, Petri Nets and Software Engineering 2014 (pp.113-127).
Morphisms on Marked Graphs
BERNARDINELLO, LUCA;POMELLO CHINAGLIA POMELLO, LUCIA;
2014
Abstract
Many kinds of morphisms on Petri nets have been defined and studied. They can be used as formal techniques supporting refine- ment/abstraction of models. In this paper we introduce a new notion of morphism on marked graphs, a class of Petri nets used for the rep- resentation of systems having deterministic behavior. Such morphisms can indeed be used to represent a form of abstraction on marked graphs, consisting in folding cycles and identifying chains. We will then prove that systems joined by these morphisms show behavioral similarities.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
