Abstract
Verification of complex systems specification often encounters the so-called state space explosion problem, which prevents exhaustive model-checking in many practical cases. Many techniques have been developed to counter this problem by reducing the state space, either by retaining a smaller number of relevant states, or by using a smart representation. Among the latter, modular state spaces [CP00, LP04] have turned out to be an efficient analysis technique in many cases [Pet05]. When the system uses a priority mechanism (e.g. timed systems [LP07]), there is increased coupling between the modules — preemption between modules can occur, thus disabling local events. This paper shows that the approach is still applicable even when considering dynamic priorities, i.e. priorities depending both on the transition and the current marking.
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
Bause, F.: Analysis of Petri nets with a dynamic priority method. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 215–234. Springer, Heidelberg (1997)
Christensen, S., Petrucci, L.: Modular analysis of Petri nets. The Computer Journal 43(3), 224–242 (2000)
Lakos, C., Petrucci, L.: Modular analysis of systems composed of semiautonomous subsystems. In: Proc. 4th Int. Conf. on Application of Concurrency to System Design (ACSD 2004), Hamilton, Canada, pp. 185–194. IEEE Comp. Soc. Press, Los Alamitos (2004)
Lakos, C., Petrucci, L.: Modular state space exploration for timed Petri nets. Journal of Software Tools for Technology Transfer 9(3-4), 393–411 (2007)
Mäkelä, M.: Model Checking Safety Properties in Modular High-Level Nets. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 201–220. Springer, Heidelberg (2003)
Mnaouer, A.B., Sekiguchi, T., Fujii, Y., Ito, T., Tanaka, H.: Colored Petri nets based modeling and simulation of the static and dynamic allocation policies of the asynchronous bandwidth in the fieldbus protocol. In: Billington, J., Díaz, M., Rozenberg, G. (eds.) APN 1999. LNCS, vol. 1605, pp. 93–130. Springer, Heidelberg (1999)
Petrucci, L.: Cover picture story: Experiments with modular state spaces. Petri Net Newsletter 68, Cover page and 5–10 (2005)
Petrucci, L., Kristensen, L.M., Billington, J., Qureshi, Z.H.: Developing a formal specification for the mission system of a maritime surveillance aircraft. In: Proc. 3rd Int. Conf. on Application of Concurrency to System Design (ACSD 2003), Guimarães, Portugal, pp. 92–101. IEEE Comp. Soc. Press, Los Alamitos (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lakos, C., Petrucci, L. (2011). Modular State Spaces for Prioritised Petri Nets. In: Calinescu, R., Jackson, E. (eds) Foundations of Computer Software. Modeling, Development, and Verification of Adaptive Systems. Monterey Workshop 2010. Lecture Notes in Computer Science, vol 6662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21292-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-21292-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21291-8
Online ISBN: 978-3-642-21292-5
eBook Packages: Computer ScienceComputer Science (R0)