scientific article; zbMATH DE number 1759609

zbMath0999.68113MaRDI QIDQ4536600

Kousha Etessami, Gerard J. Holzmann

Publication date: 28 November 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (25)

From LTL to deterministic automata. A safraless compositional approach ⋮ Applicability of fair simulation ⋮ Explicit-State Model Checking ⋮ From LTL to unambiguous Büchi automata via disambiguation of alternating automata ⋮ Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic ⋮ Effective reductions of Mealy machines ⋮ LTL under reductions with weaker conditions than stutter invariance ⋮ Index appearance record with preorders ⋮ On-the-Fly Stuttering in the Construction of Deterministic ω-Automata ⋮ Markov chains and unambiguous automata ⋮ Bridging the gap between single- and multi-model predictive runtime verification ⋮ Simulation relations and applications in formal methods ⋮ Dissecting \texttt{ltlsynt} ⋮ Mechanizing the Powerset Construction for Restricted Classes of ω-Automata ⋮ LTL to self-loop alternating automata with generic acceptance and back ⋮ Unnamed Item ⋮ New Optimizations and Heuristics for Determinization of Büchi Automata ⋮ Approximate Automata for Omega-Regular Languages ⋮ Organising LTL monitors over distributed systems with a global clock ⋮ Transformation from PLTL to automata via NFGs ⋮ Unnamed Item ⋮ Automata-Theoretic Model Checking Revisited ⋮ Tool support for learning Büchi automata and linear temporal logic ⋮ On the Relationship between LTL Normal Forms and Büchi Automata ⋮ More efficient on-the-fly LTL verification with Tarjan's algorithm

This page was built for publication: