Abstract
τ-confluence is a reduction technique used in enumerative model-checking of labeled transition systems to avoid the state explosion problem. In this paper, we propose a new on-the-fly algorithm to calculate partial τ-confluence, and propose new techniques to do so on large systems in a compositional manner. Using information inherent in the way a large system is composed of smaller systems, we show how we can deduce partial τ-confluence in a computationally cheap manner. Finally, these techniques are applied to a number of case studies, including the rel/REL atomic multicast protocol.
Keywords
- Transitive Closure
- Label Transition System
- Expression Tree
- Automate Theorem Prover
- Outgoing Transition
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 has been partially supported by the European Research Consortium in Informatics and Mathematics (ERCIM).
Download conference paper PDF
References
Andersen, H.R.: Model checking and boolean graphs. Theoretical Computer Science 126(1), 3–30 (1994)
Blom, S., van de Pol, J.: State space reduction by proving confluence. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, p. 596. Springer, Heidelberg (2002)
Blom, S.C.C.: Partial τ-confluence for efficient state space generation. Technical Report SEN–R0123, CWI, Amsterdam (2001)
Roscoe, A.W., et al.: Hierarchical compression for model-checking CSP or how to check 1020 dining philosophers for deadlock. In: TACAS 1995, vol. NS-95-2 (1995)
Fernandez, J.-C., Garavel, H., Mounier, L., Rasse, A., Rodriguez, C., Sifakis, J.: A toolbox for the verification of LOTOS programs. In: International Conference on Software Engineering, pp. 246–259 (1992)
Garavel, H., Lang, F.: Svl: a scripting language for compositional verification. In: International Conference on Formal Techniques for Networked and Distributed Systems, pp. 377–392. Kluwer Academic Publishers, Dordrecht (2001)
Graf, S., Steffen, B.: Compositional minimization of finite state systems. In: Clarke, E., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol. 531. Springer, Heidelberg (1991)
Groote, J.F., Sellink, M.P.A.: Confluence for process verification. Theoretical Computer Science 170(1–2), 47–81 (1996)
Groote, J.F., van de Pol, J.: State space reduction using partial τ-confluence. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, p. 383. Springer, Heidelberg (2000)
Fernandez, J.C., Garavel, H., Kerbrat, A., Mounier, L., Mateescu, R., Sighireanu, M.: Cadp: a protocol validation and verification toolbox. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, Springer, Heidelberg (1996)
Krimm, J.-P., Mounier, L.: Compositional state space generation from lotos programs. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217, Springer, Heidelberg (1997)
Mateescu, R., Sighireanu, M.: Efficient on-the-fly model-checking for regular alternation-free mu-calculus. Science of Computer Programming (to appear)
Nalumasu, R., Gopalakrishnan, G.: An efficient partial order reduction algorithm with an alternative proviso implementation. Formal Methods in System Design 20(3) (May 2002)
Peled, D.A., Pratt, V.R., Holzmann, G.J. (eds.): Partial Order Methods in Verification. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 29. American Mathematical Society, Providence (1997)
Ramakrishna, Y.S., Smolka, S.A.: Partial-order reduction in the weak modal mu-calculus. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243. Springer, Heidelberg (1997)
Valmari, A.: Stubborn set methods for process algebras. In: Workshop on Partial Order Methods in Verification. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 29, American Mathematical Society, Providence (1997)
Ying, M.: Weak confluence and τ-inertness. Theoretical Computer Science 238(1–2), 465–475 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pace, G.J., Lang, F., Mateescu, R. (2003). Calculating τ-Confluence Compositionally. In: Hunt, W.A., Somenzi, F. (eds) Computer Aided Verification. CAV 2003. Lecture Notes in Computer Science, vol 2725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45069-6_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-45069-6_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40524-5
Online ISBN: 978-3-540-45069-6
eBook Packages: Springer Book Archive