Correct Hardware Design and Verification Methods

From MaRDI portal

Revision as of 17:32, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5897059

Jump to:navigation, search

DOI10.1007/B93958zbMath1179.68070OpenAlexW219731125MaRDI QIDQ5897059

Fabio Somenzi, Moshe Y. Vardi, Orna Kupferman, Sankar Gurumurthy

Publication date: 5 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL ⋮ Towards a grand unification of Büchi complementation constructions ⋮ Coinductive Algorithms for Büchi Automata ⋮ Automata-Theoretic Model Checking Revisited ⋮ From LTL to Symbolically Represented Deterministic Automata ⋮ Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking ⋮ State of Büchi Complementation ⋮ Mediating for reduction (on minimizing alternating Büchi automata) ⋮ From complementation to certification

This page was built for publication: Correct Hardware Design and Verification Methods

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5897059&oldid=16690913"