Abstract
We consider time Petri nets with multiple-server semantics. We first prove that this setting is strictly more expressive, in terms of timed bisimulation, than its single-server counterpart. We then focus on two choices for the firing of multiple instances of the same transition: the more conservative safety-wise non deterministic choice, where all firable instances may fire in any order, and a simpler alternative, First Enabled First Fired (FEFF), where only the oldest instance may fire, obviously leading to a much more compact state-space. We prove that both semantics are not bisimilar but actually simulate each other with strong timed simulations, which in particular implies that they generate the same timed traces. FEFF is then very appropriate to deal with linear timed properties of time Petri nets.
This work has been partially funded by project ImpRo ANR-2010-BLAN-0317.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aura, T., Lilius, J.: A causal semantics for time petri nets. Theoretical Computer Science 243(2), 409–447 (2000)
Bérard, B., Cassez, F., Haddad, S., Lime, D., Roux, O.H.: Comparison of different semantics for time Petri nets. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 293–307. Springer, Heidelberg (2005)
Bérard, B., Cassez, F., Haddad, S., Lime, D., Roux, O.H.: The expressive power of time Petri nets. Theoretical Computer Science 474, 1–20 (2013)
Berthomieu, B.: La méthode des classes d’états pour l’analyse des réseaux temporels - mise en oeuvre, extension à la multi-sensibilisation. In: Modélisation des Systèmes Réactifs (MSR 2001), pp. 275–290. Hermes, Toulouse (2001)
Boucheneb, H., Bullich, A., Roux, O.H.: FIFO Time Petri Nets for conflicts handling. In: 11th International Workshop on Discrete Event Systems (WODES 2012), IFAC, Guadalajara (2012)
Boyer, M., Diaz, M.: Multiple enabledness of transitions in time Petri nets. In: Proc. of the 9th IEEE International Workshop on Petri Nets and Performance Models, Aachen, Germany, September 11–14. IEEE Computer Society (2001)
Boyer, M., Roux, O.H.: On the compared expressiveness of arc, place and transition time Petri nets. Fundamenta Informaticae 88(3), 225–249 (2008)
Cerone, A., Maggiolo-Schettini, A.: Timed based expressivity of time Petri nets for system specification. Theoretical Computer Science 216, 1–53 (1999)
Glabbeek, R., Plotkin, G.: Configuration structures. In: Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science (LICS 1995), pp. 199–209. IEEE Computer Society Press, San Diego (1995)
Khansa, W., Denat, J.-P., Collart-Dutilleul, S.: P-time Petri nets for manufacturing systems. In: International Workshop on Discrete Event Systems (WODES 1996), Edinburgh (U.K.), pp. 94–102 (August 1996)
Merlin, P.M.: A study of the recoverability of computing systems. PhD thesis, Department of Information and Computer Science, University of California, Irvine, CA (1974)
Myers, C.J., Rokicki, T.G., Meng, T.H.-Y.: Poset timing and its application to the timed cirucits. IEEE Transactions on CAD 18(6) (1999)
Ramchandani, C.: Analysis of asynchronous concurrent systems by timed Petri nets. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, Project MAC Report MAC-TR-120 (1974)
Reynier, P.-A., Sangnier, A.: Weak time petri nets strike back! In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 557–571. Springer, Heidelberg (2009)
Walter, B.: Timed net for modeling and analysing protocols with time. In: Proceedings of the IFIP Conference on Protocol Specification Testing and Verification, North Holland (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boucheneb, H., Lime, D., Roux, O.H. (2013). On Multi-enabledness in Time Petri Nets. In: Colom, JM., Desel, J. (eds) Application and Theory of Petri Nets and Concurrency. PETRI NETS 2013. Lecture Notes in Computer Science, vol 7927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38697-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-38697-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38696-1
Online ISBN: 978-3-642-38697-8
eBook Packages: Computer ScienceComputer Science (R0)