Parameterised boolean equation systems

Theoretical Computer Science

Volumn 343, Issue 3, 2005, Pages 332-369

  Groote, Jan Friso ^a   Willemse, Tim A C ^a,b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

First order modal calculus; Infinite state systems; Model checking; Parameterised boolean equation systems

Indexed keywords

APPROXIMATION THEORY; COMPUTER SCIENCE; DATA PROCESSING; PROBLEM SOLVING;

FIRST ORDER MODAL Μ-CALCULUS; INFINITE STATE SYSTEMS; MODEL CHECKING; PARAMETERIZED BOOLEAN EQUATION SYSTEMS;

BOOLEAN ALGEBRA;

EID: 25844481952     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.06.016     Document Type: Conference Paper

References (26)

1. P. Abdulla, A. Bouajjani, B. Jonsson, On-the-fly analysis of systems with unbounded, lossy fifo channels, in: A.J. Hu, M.Y. Vardi (Eds.), 10th Internat. Conf. on Computer Aided Verification, CAV'98, Lecture Notes in Computer Science, Vol. 1427, Springer, 1998, pp. 305-318.
2. H. Bekič, Definable operations in general algebras, and the theory of automata and flow charts, in: C.B. Jones (Ed.), Programming Languages and Their Definition - Hans Bekič (1936-1982), Lecture Notes in Computer Science, Vol. 177, Springer, 1984, pp. 30-55.
3. M.A. Bezem, J.F. Groote, Invariants in process algebra with data, in: B. Jonsson, J. Parrow (Eds.), Proc. Concur'94, Uppsala, Sweden, Lecture Notes in Computer Science, Vol. 836, Springer, 1994, pp. 401-416.
4. B. Boigelot, P. Godefroid, B. Willems, P. Wolper, The power of qdds, in: P. van Hentenryck (Ed.), Static Analysis, 4th Internat. Symp. SAS'97, Lecture Notes in Computer Science, Vol. 1302, Springer, 1997, pp. 172-186.
5. J.C. Bradfield Verifying Temporal Properties of Systems, Progress in Theoretical Computer Science 1992 Birkhäuser
6. J. Bradfield, and C. Stirling Modal logics and mu-calculi an introduction J.A. Bergstra A. Ponse S.A. Smolka Handbook of Process Algebra 2001 Elsevier 293 330
7. R.E. Bryant, S.K. Lahiri, S.A. Seshia, Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions, in: 14th Internat. Conf. on Computer Aided Verification, CAV 2002, Lecture Notes in Computer Science, Vol. 2404, Springer, 2002, pp. 78-92.
8. T. Bultan, R. Gerber, W. Pugh, Symbolic model checking of infinite state systems using pressburger arithmetic, in: O. Grumberg (Ed.), Ninth Internat. Conf. on Computer Aided Verification, CAV'97, Lecture Notes in Computer Science, Vol. 1254, Springer, 1997, pp. 400-411.
9. P. Cousot, Semantic foundations of program analysis, in: S.S. Muchnick, N.D. Jones (Eds.), Program Flow Analysis: Theory and Applications, Prentice-Hall, Englewood Cliffs, New Jersey, USA, 1981, pp. 303-342 (Chapter 10).
10. E.A. Emerson, C.-L. Lei, Efficient model checking in fragments of the propositional mu-calculus, in: First IEEE Symp. Logic in Computer Science, LICS'86, IEEE Computer Society Press, 1986, pp. 267-278.
11. J.F. Groote, R. Mateescu, Verification of temporal properties of processes in a setting with data, in: A.M. Haeberer (Ed.), AMAST'98, Lecture Notes in Computer Science, Vol. 1548, Springer, 1999, pp. 74-90.
12. J.F. Groote, J.C. van de Pol, Equational Binary Decision Diagrams, in: Proc. LPAR 2000, Reunion Island, LNAI 1955, 2000, pp. 161-178.
13. J.F. Groote, and A. Ponse The syntax and semantics of μ CRL A. Ponse C. Verhoef S.F.M. van Vlijmen Algebra of Communicating Processes '94, Workshops in Computing Series 1995 Springer 26 62
14. J.F. Groote, and M.A. Reniers Algebraic process verification J.A. Bergstra A. Ponse S.A. Smolka Handbook of Process Algebra 2001 Elsevier North-Holland 1151 1208 (Chapter 17)
15. J.F. Groote, T.A.C. Willemse, Model-checking processes with data. Sci. Comput. Program. 56 (2005) 251-273.
16. J.F. Groote, T.A.C. Willemse, Parameterised boolean equation systems (Extended Abstract), in: P. Gardner, N. Yoshida (Eds.), Proc. of CONCUR 2004, London, Lecture Notes in Computer Science, Vol. 3170, Springer, 2004, pp. 308-324.
17. J.F. Groote, T.A.C. Willemse, Parameterised boolean equation systems, Technical Report CSR 04-09, Eindhoven University of Technology, Department of Mathematics and Computer Science, 2004.
18. D. Gurov, S. Berezin, and B. Kapron A modal μ -calculus and a proof system for value-passing processes Proc. Infinity, Workshop on Verification of Infinite State Systems, Pisa 1996 149 163
19. D. Kozen Results on the propositional mu-calculus Theoret. Comput. Sci. 27 1983 333 354
20. A. Mader, Modal μ -calculus, model checking and gaußelimination, in: E. Brinksma, R.W. Cleaveland, K.G. Larsen, T. Margaria, B. Steffen (Eds.), Tools and Algorithms for Construction and Analysis of Systems, First International Workshop, TACAS '95, Aarhus, Denmark, Lecture Notes in Computer Science, Vol. 1019, Springer, 1995, pp. 72-88.
21. A. Mader, Verification of Modal Properties Using Boolean Equation Systems, PhD Thesis, Technical University of Munich, 1997.
22. J. Rathke, and M. Hennessy Local model checking for value-passing processes Proc. of TACS'97, the Internat. Symp. on Theoretical Aspects of Computer Software, Sendai, 1997 1997
23. D.S. Scott, J.W. de Bakker, A theory of programs, 1969.
24. C. Stirling Modal and Temporal Properties of Processes, Texts in Computer Science 2001 Springer
25. B. Vergauwen, J. Lewi, Efficient local correctness checking for single and alternating boolean equation systems, in: S. Abiteboul, E. Shamir (Eds.), Proc. ICALP'94, Lecture Notes in Computer Science, Vol. 820, Springer, 1994, pp. 302-315.
26. T.A.C. Willemse, Semantics and Verification in Process Algebras with Data and Timing, PhD Thesis, Eindhoven University of Technology, February 2003.