MSO Logic and the Partial Order Semantics of Place/Transition-Nets
- 552 Downloads
In 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 logic Petri nets Slice languages
The author gratefully acknowledges financial support from the European Research Council, ERC grant agreement 339691, within the context of the project Feasibility, Logic and Randomness (FEALORA).
- 1.Avellaneda, F., Morin, R.: Checking partial-order properties of vector addition systems with states. In: Proceedings of ACSD 2013, pp. 100–109. IEEE (2013)Google Scholar
- 2.Badouel, E., Darondeau, P.: On the synthesis of general Petri nets. Technical Report PI-1061, IRISA (1996)Google Scholar
- 5.Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Synthesis of Petri nets from infinite partial languages. In: Proceedings of ACSD 2008, pp. 170–179. IEEE (2008)Google Scholar
- 19.Petri, C.A.: Fundamentals of a theory of asynchronous information flow. Proc. of IFIP Congr. 62, 166–168 (1962). MunchenGoogle Scholar
- 20.Place, T., Zeitoun, M.: Separating regular languages with first-order logic. In: Proceedings of CSL/LICS, p. 75. ACM (2014)Google Scholar
- 21.Thomas, W.: Finite-state recognizability of graph properties. Theor. des Automates et Appl. 172, 147159 (1992)Google Scholar