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

Lecture Notes in Computer Science- Germany

doi 10.1007/978-3-642-15643-4_17

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Berlin Heidelberg

Related search

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

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

On Complementing Nondeterministic Büchi Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003German

Coinductive Algorithms for Büchi Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019German

Tighter Bounds for the Determinisation of Büchi Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Timed Unfoldings for Networks of Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Pumping Lemmas for Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Fuzzy-Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Discrete Timed Automata

English

Learn With SAT to Minimize Büchi Automata

Electronic Proceedings in Theoretical Computer Science, EPTCS
Software
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy