论文信息 - Automated Verification of Infinite State Concurrent Systems

Automated Verification of Infinite State Concurrent Systems

The paper shows how to use partitioning techniques to generate abstract state spaces (models) preserving similarity and injectivity. Since these relations are weaker than bisimilarity and surjectivity, our algorithms generate smaller models. This method can be applied for improving several existing partitioning algorithms used for generating finite models of concurrent programs, Time Petri Nets and Timed Automata.

[1] Wojciech Penczek,et al. Propositional Temporal Logics and Equivalences , 1992, CONCUR.

[2] Nicolas Halbwachs,et al. An implementation of three algorithms for timing verification based on automata emptiness , 1992, [1992] Proceedings Real-Time Systems Symposium.

[3] Stavros Tripakis,et al. Analysis of Timed Systems Based on Time-Abstracting Bisimulation , 1996, CAV.

[4] Orna Grumberg,et al. Simulation Based Minimization , 2000, CADE.

[5] Nicolas Halbwachs,et al. Minimal State Graph Generation , 1992, Sci. Comput. Program..

[6] Rajeev Alur,et al. Minimization of Timed Transition Systems , 1992, CONCUR.

[7] Orna Grumberg,et al. Model checking and modular verification , 1991, TOPL.

[8] Thomas A. Henzinger,et al. Computing simulations on finite and infinite graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[9] Wojciech Penczek,et al. Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets , 2001, ICATPN.

[10] Edmund M. Clarke,et al. Characterizing Finite Kripke Structures in Propositional Temporal Logic , 1988, Theor. Comput. Sci..

[11] David L. Dill,et al. Timing Assumptions and Verification of Finite-State Concurrent Systems , 1989, Automatic Verification Methods for Finite State Systems.