On the Construction of Pullbacks for Safe Petri Nets
The product of safe Petri nets is a well known operation : it generalizes to concurrent systems the usual synchronous product of automata. In this paper, we consider a more general way of combining nets, called a pullback. The pullback operation generalizes the product to nets which interact both by synchronized transitions and/or by a shared sub-net (i.e. shared places and transitions). To obtain all pullbacks, we actually show that all equalizers can be defined in the category of safe nets. Combined to the known existence of products in this category, this gives more than what we need : we actually obtain that all small limits exist, i.e. that safe nets form a complete category.
KeywordsCommutative Diagram Partial Function Total Function Discrete Event System Concurrent System
Unable to display preview. Download preview PDF.
- 2.Winskel, G.: STACS 1984. LNCS, vol. 166, pp. 140–149. Springer, Heidelberg (1984)Google Scholar
- 3.Nielsen, M., Winskel, G.: Petri Nets and Bisimulation, BRICS report no. RS-95-4 (January 1995)Google Scholar
- 4.Winskel, G.: Categories of models for concurrency. In: Brookes, S.D., Winskel, G., Roscoe, A.W. (eds.) Seminar on Concurrency. LNCS, vol. 197, pp. 246–267. Springer, Heidelberg (1985)Google Scholar
- 5.Winskel, G.: Event structure semantics of CCS and related languages. LNCS, vol. 140. Springer, Heidelberg (1982); also as report PB-159, Aarhus Univ., Denmark (April 1983)Google Scholar
- 9.Koenig, B.: Parallel Composition and Unfolding of Petri Nets (Including Some Examples), private communication (2005)Google Scholar
- 10.McMillan, K.L.: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: Proc. 4th Workshop of Computer Aided Verification, Montreal, pp. 164–174 (1992)Google Scholar
- 12.Esparza, J., Schröter, C.: Reachability Analysis Using Net Unfoldings. In: Workshop of Concurrency, Specification and Programming. Informatik-Bericht 140, vol. II, pp. 255–270. Humboldt-Universität zu, Berlin (2000)Google Scholar
- 13.Melzer, S., Römer, S.: Deadlock checking using net unfoldings. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 352–363. Springer, Heidelberg (1997)Google Scholar
- 17.Fabre, E., Benveniste, A., Haar, S., Jard, C.: Distributed Monitoring of Concurrent and Asynchronous Systems. Journal of Discrete Event Systems, 33–84 (May 2005) (special issue)Google Scholar
- 18.Fabre, E.: Distributed Diagnosis based on Trellis Processes. In: 44th Conf. on Decision and Control (CDC), Seville, Spain (December 12-15, 2005)Google Scholar
- 19.Fabre, E.: Trellis processes: a compact representation for runs of concurrent systems, INRIA research report, no. RR-5554 (March 2005)Google Scholar