scientific article

zbMath0786.68060MaRDI QIDQ4037099

Moshe Y. Vardi, Mihalis Yannakakis, Pierre Wolper, Costas Courcoubetis

Publication date: 18 May 1993

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

zbMATH Keywords

verificationreachability analysisBüchi automatatemporal propertiesautomata on infinite wordsemptiness problemfinite-state programscomputer protocolsproduct automaton

Mathematics Subject Classification ID

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

Related Items (19)

Automated Verification of Parallel Nested DFS ⋮ Analysing sanity of requirements for avionics systems ⋮ Explicit-State Model Checking ⋮ Partial-Order Reduction ⋮ Model Checking of Biological Systems ⋮ GSTE is partitioned model checking ⋮ Flash memory efficient LTL model checking ⋮ Distributed breadth-first search LTL model checking ⋮ An explicit transition system construction approach to LTL satisfiability checking ⋮ Optimized temporal monitors for SystemcC ⋮ From Philosophical to Industrial Logics ⋮ Survey on Directed Model Checking ⋮ Hierarchical Adaptive State Space Caching Based on Level Sampling ⋮ Iterative bounded synthesis for efficient cycle detection in parametric timed automata ⋮ Automata-Based Termination Proofs ⋮ Checking Timed Büchi Automata Emptiness Using LU-Abstractions ⋮ Alternating automata: Unifying truth and validity checking for temporal logics ⋮ On a class of timer hybrid systems reducible to finite state automata ⋮ Checking timed Büchi automata emptiness efficiently

This page was built for publication: