## A Symbolic Shortest Path Algorithm for Computing Subgame-Perfect Nash Equilibria

- Pedro Arturo Góngora, David A. Rosenblueth
- Applied Mathematics and Computer Science
- 2015

Highly Influenced

@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} }

- Published 1993 in Distributed Computing
DOI:10.1007/BF02242704

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

78 Extracted Citations

14 Extracted References

Similar Papers