Abstract
State/Event Linear Temporal Logic (SE-LTL) provides a concise and intuitive way to express properties incorporating both states and events. However, as SE-LTL is not preserved under classical stutter-equivalence, conventional Partial Order Reduction (POR) cannot be directly used to check them. In this paper, we propose a novel technique to exploit POR for checking SE-LTL. This technique detects a “state part” of a Büchi automaton (BA) translated from an SE-LTL formula. POR is integrated into the construction of the synchronous products of BAs and Labeled Kripke Structures (LKS), where “state parts” direct the use of POR. The integrated POR modifies conventional POR by introducing an identification of visible actions with respect to events. In addition, we compare our technique with the existing POR for weak SE-LTL and give a method to combine them to obtain more reduction. We have implemented our technique in the SPIN model checker. The experimental results illustrate the potential of the technique for reduction compared with pure state-based POR and SE-LTL model checking without POR.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work was supported by the National High-tech R&D Program of China (863 Program) under Grant No. 2015AA015303, Funding of Jiangsu Innovation Program for Graduate Education KYLX_0315, the Fundamental Research Funds for the Central Universities, Joint Research Funds of National Natural Science Foundation of China and Civil Aviation Administration of China (U1533130).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Beneš, N., Brim, L., Buhnova, B., Černá, I., Sochor, J., Vařeková, P.: Partial order reduction for state/event LTL with application to component-interaction automata. Sci. Comput. Program. 76(10), 877–890 (2011)
Chaki, S., Clarke, E.M., Ouaknine, J., Sharygina, N., Sinha, N.: Concurrent software verification with states, events, and deadlocks. Formal Asp. Comput. 17(4), 461–483 (2005)
Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching-time temporal logic. In: Kozen, D. (ed.) Logics of Programs, Workshop, Yorktown Heights, New York. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1981)
Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)
Gastin, P., Oddoux, D.: Fast LTL to Büchi automata translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53–65. Springer, Heidelberg (2001)
Godefroid, P., Wolper, P.: A partial approach to model checking. Inf. Comput. 110(2), 305–326 (1994)
Holzmann, G.J.: Design and Validation of Computer Protocols. Prentice Hall, Upper Saddle River (1990)
Holzmann, G.J.: The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley, Boston (2004)
Huth, M., Ryan, M.: Logic in Computer Science: Modelling and Reasoning About Systems. Cambridge University Press, Cambridge (2004)
Kamel, M., Leue, S.: Formalization and validation of the General Inter-ORB Protocol (GIOP) using PROMELA and SPIN. STTT 2(4), 394–409 (2000)
Kan, S., Huang, Z., Chen, Z., Li, W., Huang, Y.: Partial Order Reduction for Checking LTL Formulae with the Next-time Operator (2016). doi:10.1093/logcom/exw004
Lawford, M., Pantelic, V., Zhang, H.: Towards integrated verification of timed transition models. Fundam. Inform. 70(1–2), 75–110 (2006)
Peled, D.: All from one, one for all: on model checking using representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 409–423. Springer, Heidelberg (1993)
Queille, J., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) International Symposium on Programming. LNCS, vol. 137, pp. 337–351. Springer, Heidelberg (1982)
Sun, J., Liu, Y., Dong, J.S., Wang, H.H.: Specifying and verifying event-based fairness enhanced systems. In: Liu, S., Araki, K. (eds.) ICFEM 2008. LNCS, vol. 5256, pp. 5–24. Springer, Heidelberg (2008)
Valmari, A.: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.) Advances in Petri Nets 1990. LNCS, vol. 483, pp. 491–515. Springer, Heidelberg (1991)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Kan, S., Huang, Z., Chen, Z. (2016). Partial Order Reduction for State/Event Systems. In: Ogata, K., Lawford, M., Liu, S. (eds) Formal Methods and Software Engineering. ICFEM 2016. Lecture Notes in Computer Science(), vol 10009. Springer, Cham. https://doi.org/10.1007/978-3-319-47846-3_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-47846-3_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-47845-6
Online ISBN: 978-3-319-47846-3
eBook Packages: Computer ScienceComputer Science (R0)