A decision procedure for the alternation-free two-way modal μ-calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3702 LNAI, Issue , 2005, Pages 277-291

  Tanabe, Yoshinori ^a,b   Takahashi, Koichi ^b   Yamamoto, Mitsuharu ^c   Tozawa, Akihiko ^d   Hagiya, Masami ^e,f  

^a JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^b NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

^c CHIBA UNIVERSITY   (Japan)

^d IBM RESEARCH   (United States)

^e UNIVERSITY OF TOKYO   (Japan)

^f Nippon Telegraph and Telephone Corporation   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATION-FREE TWO-WAY MODAL Μ-CALCULUS; COMPLEX FORMULAS; TABLEAU SET;

DECISION MAKING; LARGE SCALE SYSTEMS; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; SET THEORY;

FORMAL LOGIC;

EID: 33646191652     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11554554_21     Document Type: Conference Paper

References (20)

1. R. E. Bryant, Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, 1992.
2. BuDDy. http://sourceforge.net/projects/buddy.
3. E. A. Emerson and E. M. Clarke. Using branching-time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2(3):241-266, 1982.
4. E. Grädel. Guarded fixed point logics and the monadic theory of countable trees. Theoretical Computer Science, 288:129-152, 2002.
5. E. Grädel, W. Thomas, and T. Wilke, editors. Automata, Logics, and Infinite Games: A Guide to Current Research, volume 2500 of Lecture Notes in Computer Science. Springer-Verlag, 2002.
6. M. Hagiya, K. Takahashi, M. Yamamoto, and T. Sato. Analysis of synchronous and asynchronous cellular automata using abstraction by temporal logic. In FLOPS2004: The Seventh Functional and Logic Programming Symposium, volume 2998 of Lecture Notes in Computer Science, pages 7-21. Springer-Verlag, 2004.
7. J. G. Henriksen, J. L. Jensen, M. E. Jørgenson, N. Klarlund, R. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems, volume 1019 of Lecture Notes in Computer Science, pages 89-110. Springer-Verlag, 1995.
8. JavaBDD. http://javabdd.sourceforge.net/.
9. D. Kozen. Results on the prepositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
10. Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications, ACM Transactions on Programming Languages and Systems, 6(1):68-93, 1984.
11. K. McMillan. Symbolic Model Checking. Kluwer Academic Publ., 1993.
12. D. Niwinski and I. Walukiewicz. Games for the μ-calculus. Theoretical Computer-Science, 163(1,2):99-116, 1996.
13. G. Pan, U. Sattler, and M. Y. Vardi. BDD-based decision procedures for K. In Proceedings of the Conference on Automated Deduction, volume 2392 of Lecture Notes in Artificial Intelligence, pages 16-30. Springer-Verlag, 2002.
14. G. Pan and M. Y. Vardi. Optimizing a BDD-based modal solver, In 19th International Conference on Automated Deduction, volume 2741 of Lecture Notes in Computer Science, pages 75-89. Springer-Verlag, 2003.
15. S. Safra. On the complexity of omega-automata. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, FoCS '88, pages 319-327. IEEE Computer Society Press, 1988.
16. K. Takahashi and M. Hagiya. Abstraction of graph transformation using temporal formulas. In Supplemental Volume of the 2003 International Conference on Dependable Systems and Networks (DSN-2003), pages W-65 to W-66, 2003.
17. A. Tozawa. On binary tree logic for XML and its satisifiability test. In Sixth Workshop on Programming and Programming Language (PPL2004), 2004.
18. A. Tonawa, Y. Tanabe, and M. Hagiya. Experiments on global type checking and termination checking for XML transducer. IBM Research Report RT0614, 2005.
19. M. Y. Vardi. Reasoning about the past with two-way automata. In Automata, Languages and Programming, 25th International Colloquium, ICALP'98, volume 1443 of Lecture Notes in Computer Science, pages 628-641. Springer-Verlag, 1998.
20. M. Yamamoto, Y. Tanabe, K. Takahashi, and M. Hagiya. Abstraction of graph transformation systems by temporal logic and its verification. In IFIP Working Conference on Verified Software: Tools, Techniques, and Experiments. (to appear).