📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata

First Author: Schewe S

Attributed to: Synthesis and Verification in Markov Game Structures funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-33386-6_5

Publication URI: http://dx.doi.org/10.1007/978-3-642-33386-6_5

Type: Book Chapter

Book Title: Automated Technology for Verification and Analysis (2012)

Page Reference: 42-56

ISBN: 978-3-642-33385-9

ISSN: 1773-0155