Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words

DOI10.1007/11817949_33zbMath1151.68462OpenAlexW1504137062MaRDI QIDQ5756590

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)

Related Items (7)

Certifying inexpressibility ⋮ On relative and probabilistic finite counterability ⋮ Exhibition of a Structural Bug with Wings ⋮ Finite-word hyperlanguages ⋮ Survey on Directed Model Checking ⋮ Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata ⋮ POMDPs under probabilistic semantics

Uses Software

• LTL2BA

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