论文信息 - Generating BDDs for Symbolic Model Checking in CCS

Generating BDDs for Symbolic Model Checking in CCS

Finite transition systems can easily be represented by binary decision diagrams (BDDs) through the characteristic function of the transition relation. Burch et al. have shown how model checking of a powerful version of the Μ-calculus can be performed on such BDDs.

Thomas Filkorn | Dirk Taubner | Reinhard Enders

[1] Jan Friso Groote,et al. An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence , 1990, ICALP.

[2] Dirk Taubner,et al. Finite Representations of CCS and TCSP Programs by Automata and Petri Nets , 1989, Lecture Notes in Computer Science.

[3] Rance Cleaveland,et al. The Concurrency Workbench , 1990, Automatic Verification Methods for Finite State Systems.

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

[5] Jean-Claude Fernandez,et al. An Implementation of an Efficient Algorithm for Bisimulation Equivalence , 1990, Sci. Comput. Program..

[6] Dirk Taubner,et al. Computer Aided Verification of Parallel Processes , 1991, VIS.

[7] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[8] David Walker,et al. Local Model Checking in the Modal mu-Calculus , 1991, Theor. Comput. Sci..

[9] Edmund M. Clarke,et al. Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[10] Chin-Laung Lei,et al. Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.