A complete characterization of deterministic regular liveness properties

DOI10.1016/j.tcs.2007.07.038zbMath1143.68045OpenAlexW2011840823MaRDI QIDQ2465051

Ulrich Ultes-Nitsche, Frank Nießner

Publication date: 19 December 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.07.038

zbMATH Keywords

propertieslivenessmodel checking

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Defining liveness
• Recognizing safety and liveness
• On the structure of non-manipulable equilibria
• Complementing deterministic Büchi automata in polynomial time
• Reasoning about infinite computations
• Proving the Correctness of Multiprocess Programs
• Decision problems forω-automata