A hierarchy of polynomial-time computable simulations for automata

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

Volumn 2421 LNCS, Issue , 2002, Pages 131-144

  Etessami, Kousha ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; ELECTRONIC TRADING; FINITE AUTOMATA; MODEL CHECKING; POLYNOMIAL APPROXIMATION; ALGORITHMS; COMPUTER GAMES;

EXPLICIT-STATE MODEL CHECKING; LABELED TRANSITION SYSTEMS; NATURAL GENERALIZATION; POLYNOMIAL-TIME; POTENTIAL REDUCTION; SIMULATION RELATION; STATE REDUCTION; TRANSITION SYSTEM; NUMBER OF STATE;

COMPUTER GAMES; COMPUTATION THEORY;

EID: 33745774238     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45694-5_10     Document Type: Conference Paper

References (13)

1. S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web. Morgan Kaufmann, 1999.
2. K. Etessami and G. Holzmann. Optimizing Büchi automata. In Proc. of 11th Int. Conf on Concurrency Theory (CONCUR), pages 153-167, 2000.
3. K. Etessami, T. Wilke, and R. Schuller. Fair simulation relations, parity games, and state space reduction for Büchi automata. In Proc. of ICALP'2001, pages 694-707, 2001.
4. T. Henzinger, O. Kupferman, and S. Rajamani. Fair simulation. In Proc. of 9th Int. Conf. on Concurrency Theory (CONCUR'97), number 1243 in LNCS, pages 273-287, 1997.
5. M. Hennessey and R. Milner. Algebraic laws for nondeterminism and concurrency. J. of the ACM, 32(1):137-161, 1985.
6. G.J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279-295, 1997.
7. T. Henzinger and S. Rajamani. Fair bisimulation. In 6th Int. Conf. on Tools and Algorithms for Construction and Analysis of Systems (TACAS'2000), LNCS 1785, pages 299-314, 2000.
8. N. Immerman and K. Kozen. Definability with bounded number of bound variables. Inform. and Comput., 83:121-139, 1989.
9. M. Jurdziński. Small progress measures for solving parity games. In Proc. 17th Symp. Theoretical Aspects of Comp. Sci. (STACS), pages 290-301, 2000.
10. R. Kaushik, P. Shenoy, P. Bohannon, and E. Gudes. Explointing local similarity for indexing of paths in graph structured data. In Proc. of 18th Int. Conf. on Data Engineering (ICDE), 2002.
11. S. Safra. On the complexity of ω-automata. In Proc. of 29th Ann. Symp. on Foundations of Comp. Sci., pages 319-327, 1988.
12. F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In Proceedings of 12th Int. Conf. on Computer Aided Verification, 2000.
13. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st Symp. on Logic in Comp. Sci. (LICS), pages 322-331, 1986.