Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata

SIAM Journal on Computing - United States
doi 10.1137/s0097539703420675
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Coinductive Algorithms for Büchi Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Latticed Simulation Relations and Games

International Journal of Foundations of Computer Science
Computer Science
2010English

Latticed Simulation Relations and Games

English

On Complementing Nondeterministic Büchi Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Tighter Bounds for the Determinisation of Büchi Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Learn With SAT to Minimize Büchi Automata

Electronic Proceedings in Theoretical Computer Science, EPTCS
Software
2012English

Variations on Parallel Explicit Emptiness Checks for Generalized Büchi Automata

International Journal on Software Tools for Technology Transfer
Information SystemsSoftware
2016English

Efficient On-The-Fly Emptiness Check for Timed Büchi Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Algorithms for Stochastic Parity Games

2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy