Symbolic Verification with Gap-Order Constraints

Finite state automata with counters are useful for modelling systems with discrete parameters. The calculation of state invariants is an important tool in the analysis of such systems. Previous authors have presented techniques for the calculation of state invariants based on their approximation by convex polyhedra or periodic sets.

[1]  Alain Kerbrat.  Reachable state space analysis of LOTOS specifications , 1994, FORTE.

[2]  Pierre Wolper,et al.  Symbolic Verification with Periodic Sets , 1994, CAV.

[3]  Peter Z. Revesz,et al.  A Closed-Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints , 1993, Theor. Comput. Sci..

[4]  Bernard Boigelot,et al.  Symbolic Veri cation with Periodic Sets ? , 1994 .

[5]  Nicolas Halbwachs,et al.  Delay Analysis in Synchronous Programs , 1993, CAV.

[6]  Rajeev Alur,et al.  Model-checking for real-time systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[7]  Laurent Fribourg,et al.  Bottom-up Evaluation of Datalog Programs with Arithmetic Constraints , 1994, CADE.

[8]  Thomas A. Henzinger,et al.  Symbolic model checking for real-time systems , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.