论文信息 - Covering Step Graph Preserving Failure Semantics

Covering Step Graph Preserving Failure Semantics

Within the framework of concurrent systems, several verification approaches require as a preliminary step the complete derivation of the state space. Partial-order methods are efficient for reducing the state explosion due to the modeling of parallelism by interleaving.

François Vernadat | François Michel | F. Vernadat | F. Michel

[1] David H. Pitt,et al. The Derivation of Conformance Tests from LOTOS Specifications , 1990, IEEE Trans. Software Eng..

[2] Wolfgang Reisig,et al. Petri Nets: Applications and Relationships to Other Models of Concurrency , 1986, Lecture Notes in Computer Science.

[3] Javier Esparza. Model Checking Using Net Unfoldings , 1994, Sci. Comput. Program..

[4] Pierre Wolper,et al. Partial-Order Methods for Temporal Verification , 1993, CONCUR.

[5] Pierre Wolper,et al. Using partial orders for the efficient verification of deadlock freedom and safety properties , 1991, Formal Methods Syst. Des..

[6] Kenneth L. McMillan,et al. Trace Theoretic Verification of Asynchronous Circuits Using Unfoldings , 1995, CAV.

[7] Patrice Godefroid,et al. Refining Dependencies Improves Partial-Order Verification Methods (Extended Abstract) , 1993, CAV.

[8] A. Valmari,et al. Stubborn Sets for Reduced State Space Generation, Proc. 11th Internat. Conf. on Application and Theory of Petri Nets , 1990 .

[9] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.

[10] Wolfgang Reisig,et al. Petri Nets: Central Models and Their Properties , 1986, Lecture Notes in Computer Science.

[11] Wolfgang Reisig,et al. Application and Theory of Petri Nets , 1982, Informatik-Fachberichte.

[12] Matthew Hennessy,et al. Acceptance trees , 1985, JACM.