Analysis and Synthesis of Weighted Marked Graph Petri Nets
- 532 Downloads
Numerous real-world systems can be modeled with Petri nets, which allow a combination of concurrency with synchronizations and conflicts. To alleviate the difficulty of checking their behaviour, a common approach consists in studying specific subclasses. In the converse problem of Petri net synthesis, a Petri net of some subclass has to be constructed efficiently from a given specification, typically from a labelled transition system describing the behaviour of the desired net.
In this paper, we focus on a notorious subclass of persistent Petri nets, the weighted marked graphs (WMGs), also called generalised (or weighted) event (or marked) graphs or weighted T-nets. In such nets, edges have multiplicities (weights) and each place has at most one ingoing and one outgoing transition. Although extensively studied in previous works and benefiting from strong results, both their analysis and synthesis can be further investigated. To this end, we provide new conditions delineating more precisely their behaviour and give a dedicated synthesis procedure.
KeywordsWeighted Petri net Analysis Synthesis Marked graph Event graph
- 2.Best, E., Devillers, R.: Characterisation of the state spaces of live and bounded marked graph Petri nets. In: Dediu, A.-H., Martín-Vide, C., Sierra-Rodríguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 161–172. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-04921-2_13CrossRefzbMATHGoogle Scholar
- 6.Best, E., Devillers, R.: Synthesis of bounded choice-free Petri nets. In: Aceto, L., Frutos Escrig, D. (eds.) Proceedings of 26th International Conference on Concurrency Theory (CONCUR 2015), pp. 128–141 (2015). https://doi.org/10.4230/LIPIcs.CONCUR.2015.128
- 14.Devillers, R.: Products of transition systems and additions of Petri nets. In: Desel, J., Yakovlev, A. (eds.) Proceedings of 16th International Conference on Application of Concurrency to System Design (ACSD 2016), pp. 65–73 (2016). https://doi.org/10.1109/ACSD.2016.10
- 16.Devillers, R., Schlachter, U.: Factorisation of Petri net solvable transition systems. In: 39th International Conference on Applications and Theory of Petri Nets and Concurrency, Bratislava (2018)Google Scholar
- 23.Pino, J.L., Bhattacharyya, S.S., Lee, E.A.: A hierarchical multiprocessor scheduling framework for synchronous dataflow graphs. Technical report, University of California, Berkeley, May 1995Google Scholar
- 24.Silva, M., Terue, E., Colom, J.M.: Linear algebraic and linear programming techniques for the analysis of place/transition net systems. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 309–373. Springer, Heidelberg (1998). https://doi.org/10.1007/3-540-65306-6_19CrossRefGoogle Scholar