Property-preserving transformations of elementary net systems based on morphisms
The main purpose of this paper is to define a set of local abstraction/refinement transformations for elementary net (EN) systems. A local transformation acts only on a specific subnet, while the rest of the EN system remains unchanged. The authors consider EN systems with labelled transitions, where labels specify interactions with the environment. Transformation rules are presented preserving labelled transitions, while unlabelled transitions are reduced. As a result of applying these transformations, an initial EN system and a transformed EN system are related by an alpha-morphism, and their reachable markings and, especially, deadlocks are preserved. Interestingly enough, it is also shown that simple Petri net transformations, introduced earlier in the literature, also yield corresponding alpha-morphisms. In addition, the authors provide two cases of applying transformations defined in the study. For the entire collection see [Zbl 1492.68020].
- Local state refinement and composition of elementary net systems: an approach based on morphisms
- scientific article; zbMATH DE number 3905851
- Elementary transition systems
- A formal framework for Petri net class transformations
- Une nouvelle transformation des réseaux de Petri généralisés : L'abstraction généralisée
- A method for stepwise refinement and abstraction of Petri nets
- A theory of bipolar synchronization scheme
- Analysis of Petri nets by stepwise refinements
- scientific article; zbMATH DE number 1696467 (Why is no real title available?)
- scientific article; zbMATH DE number 3980500 (Why is no real title available?)
- scientific article; zbMATH DE number 3575493 (Why is no real title available?)
- scientific article; zbMATH DE number 1302042 (Why is no real title available?)
- Local state refinement and composition of elementary net systems: an approach based on morphisms
- Petri nets and bisimulation
- Petri nets, algebras, morphisms, and compositionality
- Resource equivalences in Petri nets
- Rule-based refinement of Petri nets: A survey
- Vicinity respecting homomorphisms for abstracting system requirements
- Elementary transition systems
- Property preserving abstractions for the verification of concurrent systems
- Local state refinement and composition of elementary net systems: an approach based on morphisms
- scientific article; zbMATH DE number 3980500 (Why is no real title available?)
- On preserving structural and behavioural properties by composing net systems on interfaces
This page was built for publication: Property-preserving transformations of elementary net systems based on morphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163769)