Fair simulation minimization

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

Volumn 2404, Issue , 2002, Pages 610-623

  Gurumurthy, Sankar ^a   Bloem, Roderick ^b   Somenzi, Fabio ^a  

^a UNIVERSITY OF COLORADO   (United States)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS;

ACCEPTANCE CONDITIONS; DIRECT SIMULATION; EQUIVALENT STATE; FAIR SIMULATION;

COMPUTER SIMULATION LANGUAGES;

EID: 84937561488     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45657-0_51     Document Type: Conference Paper

References (13)

1. R. Bloem, K. Ravi, and F. Somenzi. Efficient decision procedures for model checking of linear time logic properties. In N. Halbwachs and D. Peled, editors, Eleventh Conference on Computer Aided Verification (CAV’99), pages 222–235. Springer-Verlag, Berlin, 1999. LNCS 1633.
2. D. L. Dill, A. J. Hu, and H. Wong-Toi. Checking for language inclusion using simulation relations. In K. G. Larsen and A. Skou, editors, Third Workshop on Computer Aided Verification (CAV’91), pages 255–265. Springer, Berlin, July 1991. LNCS 575.
3. E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy. In Proc. 32nd IEEE Symposium on Foundations of Computer Science, pages 368–377, October 1991.
4. K. Etessami and G. J. Holzmann. Optimizing B¨uchi automata. In Proc. 11th International Conference on Concurrency Theory (CONCUR2000), pages 153–167. Springer, 2000. LNCS 1877.
5. K. Etessami, T. Wilke, and A. Schuller. Fair simulation relations, parity games, and state space reduction for Büchi automata. In F. Orejas, P. G. Spirakis, and J. van Leeuwen, editors, Automata, Languages and Programming: 28th International Colloquium, pages 694–707, Crete, Greece, July 2001. Springer. LNCS 2076.
6. T. Henzinger, O. Kupferman, and S. Rajamani. Fair simulation. In Proceedings of the 9th International Conference on Concurrency Theory (CONCUR’97), pages 273–287. Springer-Verlag, 1997. LNCS 1243.
7. M. Jurdziński. Small progress measures for solving parity games. In STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, pages 290–301, Lille, France, February 2000. Springer. LNCS 1770.
8. R. P. Kurshan. Computer-Aided Verification of Coordinating Processes. Princeton University Press, Princeton, NJ, 1994.
9. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, pages 97–107, New Orleans, January 1985
10. R. Milner. Communication and Concurrency. Prentice Hall, Englewood Cliffs, NJ, 1989.
11. F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In E. A. Emerson and A. P. Sistla, editors, Twelfth Conference on Computer Aided Verification (CAV’00), pages 248–263. Springer-Verlag, Berlin, July 2000. LNCS 1855.
12. W. Thomas. On the synthesis of strategies in infinite games. In Proc. 12th Annual Symposium on Theoretical Aspects of Computer Science, pages 1–13. Springer- Verlag, 1995. LNCS 900.
13. P. Wolper, M. Y. Vardi, and A. P. Sistla. Reasoning about infinite computation paths. In Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, pages 185–194, 1983.