Inherent Vacuity in Lattice Automata

DOI10.1007/978-3-319-23534-9_10zbMath1465.68178OpenAlexW2295727838MaRDI QIDQ2947173

Orna Kupferman, Hila Gonen

Publication date: 22 September 2015

Published in: Fields of Logic and Computation II (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23534-9_10

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulations for fuzzy automata
• Handbook of weighted automata
• On model checking multiple hybrid views
• Space-bounded reducibility among combinatorial problems
• Reasoning about infinite computations
• Ranking Automata and Games for Prioritized Requirements
• Nondeterministic Space is Closed under Complementation
• Approximating Deterministic Lattice Automata
• Computer Aided Verification
• Formalizing and Reasoning about Quality
• Latticed-LTL Synthesis in the Presence of Noisy Inputs
• Lattice Automata
• Formal Methods in Computer-Aided Design
• Correct Hardware Design and Verification Methods
• Sanity Checks in Formal Verification
• Minimizing Deterministic Lattice Automata
• Computer Aided Verification
• Efficient detection of vacuity in temporal model checking