Abstract
We discuss how to transform a CSP refinement, \(S \sqsubseteq I\), to enable all its events to be hidden; this is useful because many of the state space compression functions provided by the model-checker FDR are effective only when events are hidden [1]. In an earlier paper [2] we described a suitable transformation for the case where the refinement is in the traces semantics of CSP. This paper extends the approach to the more difficult case of the stable-failures semantics. In both cases, a watchdog transformation is applied to the specification S, resulting in a watchdog processWD S, which is then composed in parallel with I, or with I in a simple context. The watchdog process monitors I and somehow indicates whether it can behave in a way that is incompatible with refinement of S. All events of the original assertion can be hidden in the transformed assertion. We also discuss the design of compression strategies that try to hide as many events as possible in the component processes of I and WD S, and compress the composition as it is being built up. We describe our implementation of the watchdog transformations and some simple compression strategies.
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
References
Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1998)
Zakiuddin, I., Moffat, N., Goldsmith, M., Whitworth, T.: Property Based Compression Strategies. In: Proceedings of Second Workshop on Automated Verification of Critical Systems (AVoCS 2002), April 15-16, University of Birmingham (2002)
de Roever, W.P., de Boer, F., Hannemann, U., Hooman, J., Lakhnech, Y., Poel, M., Zwiers, J.: Concurrency Verification: Introduction to Compositional and Noncompositional Proof Methods. Cambridge Tracts in Theoretical Computer Science 54 (2001)
Clarke, E.M., Grumberg, O.: Model Checking and Abstraction. ACM Transactions on Programming Languages and Systems. ACM Press, New York, 1512–1542 (1992)
Clarke, E., Filkorn, T., Jha, S.: Exploiting symmetry in temporal logic model checking. In: Proceedings of 5th International Conference on Computer Aided Verification (1993)
Ip, C.N., Dill, D.L.: Better Verification Through Symmetry. Computer Hardware Description Languages and their Applications. Elsevier Science Publishers B.V, Amsterdam (1996)
Emerson, E.A., Sistla, A.P.: Symmetry and Model Checking. Formal Methods in System Design: An International Journal, 105–131. Kluwer Academic Publishers (1994)
Valmari, A.: A stubborn attack on state explosion. In: 2nd Workshop on Computer Aided Verification, New Brunswick, NJ. LNCS, vol. 531, pp. 156–165. Springer, Heidelberg (1987)
Peled, D., Pnueli, A.: Proving partial order properties. Theoretical Computer Science 126, 143–182 (1994)
Godefroid, P.: Partial-order Methods for the Verification of Concurrent Systems. Springer, Heidelberg (1996)
McMillan, K.L.: Symbolic Model Checking. Kluver Academic Press, London (1993)
Formal Systems (Europe) Ltd.: FDR User Manual, 1992-99
Roscoe, A.W., Goldsmith, M., Gardiner, P.H.B., Jackson, D., Scattergood, B., Hulance, J.: Hierarchical Compression for Model-Checking CSP, or How to Check 1020 Dining Philosophers for Deadlock. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol. 1019. Springer, Heidelberg (1995)
Scattergood, J.B.: Tools for CSP and Timed CSP. Oxford University D.Phil. thesis (1998)
Valmari, A., Kervinen, A.: Alphabet-Based Synchronisation is Exponentially Cheaper. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, p. 161. Springer, Heidelberg (2002)
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
Goldsmith, M., Moffat, N., Roscoe, B., Whitworth, T., Zakiuddin, I. (2003). Watchdog Transformations for Property-Oriented Model-Checking. In: Araki, K., Gnesi, S., Mandrioli, D. (eds) FME 2003: Formal Methods. FME 2003. Lecture Notes in Computer Science, vol 2805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45236-2_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-45236-2_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40828-4
Online ISBN: 978-3-540-45236-2
eBook Packages: Springer Book Archive