Abstract
The verification of dynamic properties of a reactive systems by model-checking leads to a potential combinatorial explosion of the state space that has to be checked. In order to deal with this problem, we define a strategy based on local verifications rather than on a glo- bal verification. The idea is to split the system into subsystems called modules, and to verify the properties on each module in separation. We prove for a class of PLTL properties that if a property is satisfied on each module, then it is globally satisfied. We call such properties mo- dular properties. We propose a modular decomposition based on the B refinement process. We present in this paper an usual class of dynamic properties in the shape of □(p ⇒ Q), where p is a proposition and Q is a simple temporal formula, such as ◯q,◊q, or qUr (with q and r being propositions). We prove that these dynamic properties are modular. For these specific patterns, we have exhibited some syntactic conditions of modularity on their corresponding Büchi automata. These conditions define a larger class which contains other patterns such as □(p⇒ ◯(qUr)). Finally, we show through the example of an industrial Robot that this method is valid in a practical way.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J.-R. Abrial. The B Book: Assigning Programs to Meanings. ISBN 0521-496195. Cambridge University Press, 1996.
J. R. Abrial and L. Mussat. Introducing dynamic constraints in b. In Second Conference on the B method, France, LNCS 1393, pages 83–128. Springer Verlag, April 1998.
A. Arnold. Systèmes de transitionsionis et sémantique des processus communicants. Masson, 1992.
A. Arnold and S. Brlek. Automatic verification of properties in transition systems. Software-Practice and Experience, 25(6):579–596, 1995.
F. Bellegarde, J. Julliand, and O. Kouchnarenko. Ready-simulation is not ready to express a modular refinement relation. In Proc. Int. Conf. on Fondamental Aspects of Software Engineering, FASE’2000, volume 1783 of Lecture Notes in Computer Science, pages 266–283. Springer-Verlag, April 2000.
C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275–288, 1992.
Cuéllar, I. Wildgruber, and D. Barnard. Combining the design of industrial systems with effective verification techniques. In FME’94, LNCS n. 873, pages 639–658. Springer Verlag, 1994.
P. Godefroid. Partial-order methods for the verification of concurrent systems. LNCS, 1032, 1996.
P. Godefroid and G.-J. Holzmann. On the verification of temporal properties. In PSTV’93, June 1993.
G.-J. Holzmann. Design and validation of computer protocols. 1991.
G.-J. Holzmann. The model checker spin. In IEEE Trans. On Software Engineering, volume 23, 1996.
G.-J. Holzmann. State compression in spin. In 3rd SPIN Workshop, Twente University, April 1997.
H. Hungar. Combining model checking and theorem proving to verify parallel processes. In C. Courcoubetis, editor, 5th International Conference on Computer Aided Verification: CAV’93, number 697 in LNCS, Elounda, June/July 1993.
J. Julliand, P.A. Masson, and H. Mountassir. Modular verification of dynamic properties for reactive systems. In International Workshop on Integrated Formal Methods (IFM’99), pages 89–108, York, UK, June 1999. Springer Verlag.
K. Laster and O. Grumberg. Modular model-checking of software. In TACAS’98, Lisbon, March-April 1998.
Z. Manna and A. Pnuelli. The Temporal Logic of Reactive and Concurrent Systems: Specification. ISBN 0-387-97664-7. Springer-Verlag, 1992.
Z. Manna and A. Pnuelli. Temporal verification of reactive systems. ISBN 0-387-94459-1. Springer Verlag, 1995.
R. Milner. Communication and Concurrency. Computer Science. Prentice-Hall, 1989.
H. Mountassir, F. Bellegarde, J. Julliand, and P.A. Masson. Coopération entre preuve et model-checking pour vériér des propriétés LTL. In congrès AF-ADL’2000, Grenoble, December 2000.
D. Peled and W. Penczeh. Using asynchronous büchi automata for efficient verification of concurrent systems. In Symposium on Protocol Specification Testing and Verification, pages 90–100, Warsaw, Pologne, June 1995.
D. A. Peled. Combining partial order reduction with on-the-fly model-checking. In CAV’94, LNCS n. 818, pages 377–390. Springer Verlag, June 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Masson, PA., Mountassir, H., Julliand, J. (2000). Modular Verification for a Class of PLTL Properties. In: Grieskamp, W., Santen, T., Stoddart, B. (eds) Integrated Formal Methods. IFM 2000. Lecture Notes in Computer Science, vol 1945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40911-4_23
Download citation
DOI: https://doi.org/10.1007/3-540-40911-4_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41196-3
Online ISBN: 978-3-540-40911-3
eBook Packages: Springer Book Archive