Complexity of Distributed Petri Net Synthesis
Pages 15 - 28
Abstract
Distributed Petri Net Synthesis corresponds to the task to decide, for a transition system A (with event set E) and a natural number , whether there exists a surjective location map and a Petri net N (with transition set E) such that, if two transitions share a common pre-place, then they have the same location (), whose reachability graph is isomorphic to A (in which case such a solution should be produced as well). In this paper, we show that this problem is -complete.
References
[1]
van der Aalst WMP Process Mining - Discovery, Conformance and Enhancement of Business Processes 2011 Cham Springer
[2]
Badouel E, Bernardinello L, and Darondeau P Petri Net Synthesis 2015 Heidelberg Springer
[3]
Badouel E, Caillaud B, and Darondeau P Distributing finite automata through Petri net synthesis Formal Asp. Comput. 2002 13 6 447-470
[4]
Best E and Darondeau P Clarke E, Virbitskaite I, and Voronkov A Petri net distributability Perspectives of Systems Informatics 2012 Heidelberg Springer 1-18
[5]
Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: A region-based theory for state assignment in speed-independent circuits. IEEE Trans. CAD Integr. Circuits Syst. 16(8), 793–812 (1997).
[6]
Desel J and Reisig W The synthesis problem of Petri nets Acta Inf. 1996 33 4 297-315
[7]
Devillers R Factorisation of transition systems Acta Informatica 2017 55 4 339-362
[8]
Holloway LE, Krogh BH, and Giua A A survey of Petri net methods for controlled discrete event systems Discret. Event Dyn. Syst. 1997 7 2 151-190
[9]
Moore C and Robson JM Hard tiling problems with simple tiles Discret. Comput. Geom. 2001 26 4 573-590
[10]
Mukund, M.: Transition system models for concurrency. DAIMI Report Series 21(399) (1992). https://tidsskrift.dk/daimipb/article/view/6633
[11]
Starke, P.H.: Analyse von Petri-Netz-Modellen. Teubner, Leitfäden und Monographien der Informatik (1990)
Index Terms
- Complexity of Distributed Petri Net Synthesis
Index terms have been assigned to the content through auto-classification.
Recommendations
Synthesis of Petri net models: a rough set approach
Concurrency specification and programmingThe synthesis problem of concurrent data models from experimental tables based on rough set approach has earlier been discussed [14], [15]. Classical Petri nets have been used as a model for concurrency. In this paper we propose the nets with inhibitor ...
Petri Net Synthesis from a Reachability Set
Application and Theory of Petri Nets and ConcurrencyAbstractClassical Petri net synthesis is a method to generate a Petri net from a labelled transition system. In this paper, by contrast, it is assumed that a (finite) set of markings is given, and an algorithm is described which generates a Petri net of ...
Comments
Information & Contributors
Information
Published In
Jul 2022
440 pages
© Springer Nature Switzerland AG 2022.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 08 July 2022
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 31 Jan 2025