Abstract

AbstractIn this work, we study the interplay between monadic second order logic and the partial order theory of bounded place/transition-nets. First, we show that the causal behavior of any bounded p / t-net can be compared with respect to inclusion with the set of partial orders specified by a given MSO sentence \(\varphi \). Subsequently, we address the synthesis of Petri nets from MSO specifications. More precisely, we show that given any MSO sentence \(\varphi \), one can automatically construct a bounded Petri net whose behaviour minimally includes the set of partial orders specified by \(\varphi \). Combining this synthesis result with the comparability results we study three problems in the realm of automated correction of faulty Petri nets, and show that these problems are decidable.KeywordsMonadic second order logicPetri netsSlice languages

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.