Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words

DOI10.1007/11817949_33MaRDI QIDQ5756590zbMATH OpenOpenAlexFDO

Authors Orna Kupferman, Sarai Sheinvald-Faragy

Publication date 4 September 2007

Published in CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11817949_33

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata
• Short Witnesses and Accepting Lassos in ω-Automata
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• scientific article; zbMATH DE number 5872401
• scientific article; zbMATH DE number 1775458

Cited in

(10)

• On relative and probabilistic finite counterability
• Certifying inexpressibility
• POMDPs under probabilistic semantics
• Short Witnesses and Accepting Lassos in ω-Automata
• Survey on Directed Model Checking
• Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata
• Exhibition of a structural bug with wings
• Finite-word hyperlanguages
• How hard is finding shortest counter-example lassos in model checking?
• Tighter construction of tight Büchi automata

Describes a project that uses

Uses Software

• LTL2BA

This page was built for publication: Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756590)