| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428455 | Information Processing Letters | 2006 | 6 Pages |
Abstract
We investigate the path model checking problem for the μ-calculus. Surprisingly, restricting to deterministic structures does not allow for more efficient model checking algorithm, as we prove that it can encode any instance of the standard model checking problem for the μ-calculus.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
