Abstract
In this paper, we propose an operational semantics to build maximality-based labeled transition systems (MLTS) from Place/Transition Petri nets while performing aggregation of equivalent derivations of transitions according to maximality bisimulation relation. We show that generated MLTS are equivalent to MLTS generated without aggregation. As illustration, we apply results on a ticket reservation system.
Highlights
The model of Petri nets is very attractive, by its graphical aspect, and by its ability to capture parallel behavior of systems
In order to take advantage of the different results developed around the model of maximality-based labeled transition systems, we proposed in [22] an operational generation method of maximality-based labeled transition systems for Places/Transitions Petri nets
We proposed an operational method for generating reduced maximality-based labeled transition systems associated to Petri nets, based on aggregation of redundant transitions, and we showed that generated maximalitybased labeled transition systems are equivalent to those generated by operational semantics proposed in [22] modulo the maximality bisimulation relation, i.e. degree of parallelism and system properties to be verified are preserved
Summary
The model of Petri nets is very attractive, by its graphical aspect, and by its ability to capture parallel behavior of systems. Taking into account the non-atomicity of actions in a system has been deeply studied in the literature through the definition of several semantics supporting the concept of action refinement [9, 10, 11, 1, 6, 5, 12, 13, 14, 18, 20, 24, 27] Among these semantics, we can cite the maximality semantics which has deen defined independently on Petri nets and event structures by Devillers and Vogler [13, 14, 29]. Proofs can be found in [23]
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.