Generating BDDs for symbolic model checking in CCS

@article{Enders1993GeneratingBF,
  title={Generating BDDs for symbolic model checking in CCS},
  author={Reinhard Enders and Thomas Filkorn and Dirk Taubner},
  journal={Distributed Computing},
  year={1993},
  volume={6},
  pages={155-164}
}
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. In this paper we show how a BDD can be generated from elementary finite transition systems given as BDDs by applying the CCS operations of parallel composition, restriction, and relabelling. The resulting BDDs only grow linearly in… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
78 Extracted Citations
14 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 14 references

Abord auto

  • R deSimone, D Vergamini
  • Rapports Techniques 111 , INRIA , Sophia…
  • 1989

An implementation of an efficient algorithm for bisimulation equivalence

  • Fernandez J-C
  • Sci of Comput Program 13:219
  • 1989
3 Excerpts

Similar Papers

Loading similar papers…