Multipebble Simulations for Alternating Automata-Reference-Cited by-同舟云学术

Multipebble Simulations for Alternating Automata

Published:2010 Issue: Volume: Page:297-312
ISSN:0302-9743
Container-title:CONCUR 2010 - Concurrency Theory
language:
Short-container-title:

Author:

Clemente Lorenzo,Mayr Richard

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-15375-4_21

Reference11 articles.

1. Abdulla, P.A., Chen, Y.-F., Holik, L., Vojnar, T.: Mediating for reduction (on minimizing alternating Büchi automata). In: FSTTCS 2009, Dagstuhl, Germany. LIPIcs, vol. 4, pp. 1–12 (2009)

2. Clemente, L., Mayr, R.: Multipebble simulations for alternating automata. Technical Report EDI-INF-RR-1376, University of Edinburgh, School of Informatics (2010), http://www.inf.ed.ac.uk/publications/report/1376.html

3. Lecture Notes in Computer Science;K. Etessami,2002

4. Etessami, K., Wilke, T., Schuller, R.A.: Fair simulation relations, parity games, and state space reduction for Büchi automata. SIAM J. Comput. 34(5), 1159–1175 (2005)

5. Fritz, C., Wilke, T.: Simulation relations for alternating Büchi automata. Theor. Comput. Sci. 338(1-3), 275–314 (2005)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. EFFICIENT REDUCTION OF NONDETERMINISTIC AUTOMATA WITH APPLICATION TO LANGUAGE INCLUSION TESTING;LOG METH COMPUT SCI;2019

2. Revealing vs. Concealing: More Simulation Games for Büchi Inclusion;Language and Automata Theory and Applications;2013

3. Experimental Aspects of Synthesis;Electronic Proceedings in Theoretical Computer Science;2011-02-18

4. Büchi Automata Can Have Smaller Quotients;Automata, Languages and Programming;2011