Publication:4551134

From MaRDI portal
Revision as of 11:49, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


zbMath0991.68044MaRDI QIDQ4551134

Paul Gastin, Denis Oddoux

Publication date: 4 September 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2102/21020053


68Q45: Formal languages and automata

68Q60: Specification and verification (program logics, model checking, etc.)


Related Items

From Monadic Logic to PSL, Automata-Theoretic Model Checking Revisited, From LTL to Symbolically Represented Deterministic Automata, Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking, GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic, Analog property checkers: a DDR2 case study, Minimal counterexamples for linear-time probabilistic verification, Symbolic bounded synthesis, Linear temporal logic symbolic model checking, Runtime verification using the temporal description logic \(\mathcal{ALC}\)-LTL revisited, A compositional automata-based semantics and preserving transformation rules for testing property patterns, Mediating for reduction (on minimizing alternating Büchi automata), Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic, Verifying a signature architecture: a comparative case study, Tool support for learning Büchi automata and linear temporal logic, Temporal property verification as a program analysis task, More efficient on-the-fly LTL verification with Tarjan's algorithm, Unnamed Item, On the Relationship between LTL Normal Forms and Büchi Automata, Büchi Store: An Open Repository of Büchi Automata, Unbeast: Symbolic Bounded Synthesis, Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL, On-the-Fly Stuttering in the Construction of Deterministic ω-Automata, Mechanizing the Powerset Construction for Restricted Classes of ω-Automata, From Philosophical to Industrial Logics, Model Checking LTL Formulae in RAISE with FDR, On-the-fly Emptiness Check of Transition-Based Streett Automata


Uses Software