Abstract

History preserving bisimilarity and maximality preserving bisimilarity take full account of the interplay between causality and branching, and they are congruences w.r.t. action refinement for suitable classes of Petri nets. But even for finite safe Petri nets they are based on possibly infinite transition systems, and it is not obvious how to decide them. OM-bisimulation gives a characterization of history preserving bisimulation for safe nets without internal moves, and it allows a decidability result. In this paper we generalize OM-bisimulation and this decidability result to safe nets with internal moves, and also treat the case of maximality preserving bisimulation.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.