Abstract
Symbolic model checking of various important properties like reachability, containment and equivalence of constraint automata could be unsolvable problems in general. This paper identifies several classes of constraint automata for which these properties can be guaranteed to be solvable by reformulating them as the evaluation problem of solvable or approximately solvable classes of constraint logic problems. The paper also presents rewrite rules to simplify constraint automata and illustrates the techniques on several example control systems.
This research was supported in part by NSF grant IRI-9625055 and a Gallup Research Professorship.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In Proc. Conf. on Computer-Aided Verification, pages 55–67, 1994.
J.-H. Byon and P.Z. Revesz. DISCO: A constraint database system with sets. In Proc. Workshop on Constraint Databases and Applications, number 1034 in LNCS, pages 68–83. Springer-Verlag, September 1995.
A. Cimatti, F. Giunchiglia, and M. Roveri. Abstraction in planning via model checking. In Proc. Symposium on Abstraction, Reformulation and Approximation, pages 37–41, 1998.
J.J. Comuzzi and J.M. Hart. Program slicing using weakest precondition. In Proc. Industrial Benefit and Advances in Formal Methods, number 1051 in LNCS. Springer-Verlag, 1996.
G. Delzanno and A. Podelski. Model checking in clp. In Second International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer LNCS, 1999.
L. Fribourg and H. Olsén. A decompositional approach for computing least fixed-points of datalog programs with z-counters. Constraints, 3–4:305–336, 1997.
L. Fribourg and J.D.C. Richardson. Symbolic verification with gap-order constraints. In Prof. LOPSTR, 1996.
S. Graf and H. Saidi. Constructing abstract graphs using pvs. In Proc. Computer Aided Verification, number 1102 in LNCS. Springer-Verlag, 1996.
N. Halbwachs. Delay analysis in synchronous programs. In Proc. Conf. on Computer-Aided Verification, pages 333–346, 1993.
T.A. Henzinger, P.-H. Ho, and H. Wong-Toi. Hytech: A model checker for hybrid systems. In Proc. Computer Aided Verification, number 1254 in LNCS, pages 460–463. Springer-Verlag, 1997.
J. Jaffar and J.-L. Lassez. Constraint logic programming. In Proc. 14th ACM POPL, pages 111–119, 1987.
P.C. Kanellakis, G.M. Kuper, and P.Z. Revesz. Constraint query languages. In Proc. of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 299–313, New York, 1990. ACM Press.
P.C. Kanellakis, G.M. Kuper, and P.Z. Revesz. Constraint query languages. Journal of Computer and System Sciences, 51:26–52, 1995.
A. Kerbrat. Reachable state space analysis of lotos specifications. In Proc. 7th International Conference on Formal Description Techniques, pages 161–176, 1994.
R. Kosaraju. Decidability of reachability in vector addition systems. In Proc. of the 14th Annual ACM Symposium on Theory of Computing, pages 267–280, 1982.
M. Lowry and M. Subramaniam. Abstraction for analytic verification of concurrent software systems. In Proc. Symposium on Abstraction, Reformulation and Approximation, pages 85–94, 1998.
E. Mayr. An algorithm for the general petri net reachability problem. In Proc. of the 13th Annual ACM Symposium on Theory of Computing, pages 238–246, 1981.
K. McMillan. Symbolic Model Checking. Kluwer, 1993.
M.L. Minsky. Recursive unsolvability of post’s problem of ‘tag’ and other topics in the theory of turing machines. Annals of Mathematics, 74(3):437–455, 1961.
M. L. Minsky. Computation: Finite and Infinite Machines. Prentice Hall, 1967.
J. Peterson. Petri Net Theory and Modeling of Systems. Prentice-Hall,Inc., 1981.
R. Ramakrishnan. Database Management Systems. McGraw-Hill, 1998.
W. Reisig. Petri Nets: an Introduction. Springer, 1985.
P.Z. Revesz. Safe datalog queries with linear constraints. In M. Maher and J.-F. Puget, editors, Proc. Fourth International Conference on Principles and Practice of Constraint Programming, number 1520 in LNCS. Springer-Verlag, 1998.
P.Z. Revesz. Datalog programs with difference constraints. In Proc. Twelfth International Conference on Applications of Prolog, pages 69–76, September 1999.
P.Z. Revesz. A closed-form evaluation for Datalog queries with integer (gap)-order constraints. Theoretical Computer Science, 116:117–149, 1993.
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
Revesz, P.Z. (2000). Reformulation and Approximation in Model Checking. In: Choueiry, B.Y., Walsh, T. (eds) Abstraction, Reformulation, and Approximation. SARA 2000. Lecture Notes in Computer Science(), vol 1864. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44914-0_12
Download citation
DOI: https://doi.org/10.1007/3-540-44914-0_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67839-7
Online ISBN: 978-3-540-44914-0
eBook Packages: Springer Book Archive