scientific article; zbMATH DE number 1487477
From MaRDI portal
Publication:4493881
zbMath0954.68102MaRDI QIDQ4493881
Publication date: 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (22)
From LTL to deterministic automata. A safraless compositional approach ⋮ Model checking \(\omega \)-regular properties with decoupled search ⋮ Efficient approach of translating LTL formulae into Büchi automata ⋮ Automata Theory and Model Checking ⋮ Determinization and limit-determinization of Emerson-Lei automata ⋮ From LTL to unambiguous Büchi automata via disambiguation of alternating automata ⋮ Degeneralization algorithm for generation of Büchi automata based on contented situation ⋮ LTL under reductions with weaker conditions than stutter invariance ⋮ Unified temporal logic ⋮ A tableau construction for finite linear-time temporal logic ⋮ From linear temporal logics to Büchi automata: the early and simple principle ⋮ Bridging the gap between single- and multi-model predictive runtime verification ⋮ MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs ⋮ Linear temporal logic symbolic model checking ⋮ Generic Emptiness Check for Fun and Profit ⋮ Büchi Store: An Open Repository of Büchi Automata ⋮ An Incremental and Modular Technique for Checking LTL∖X Properties of Petri Nets ⋮ Automata-Theoretic Model Checking Revisited ⋮ On-the-fly Emptiness Check of Transition-Based Streett Automata ⋮ Checking Timed Büchi Automata Emptiness Using LU-Abstractions ⋮ 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:
