scientific article; zbMATH DE number 1973991
From MaRDI portal
Publication:4422087
zbMath1037.68553MaRDI QIDQ4422087
Flavio Lerda, Dimitra Giannakopoulou
Publication date: 3 September 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2529/25290308.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (22)
From LTL to deterministic automata. A safraless compositional approach ⋮ Efficient approach of translating LTL formulae into Büchi automata ⋮ Automata Theory and Model Checking ⋮ Determinization and limit-determinization of Emerson-Lei automata ⋮ Multi-Valued Reasoning about Reactive Systems ⋮ Degeneralization algorithm for generation of Büchi automata based on contented situation ⋮ From linear temporal logics to Büchi automata: the early and simple principle ⋮ Transparent partial order reduction ⋮ Unnamed Item ⋮ Linear temporal logic symbolic model checking ⋮ Approximate Automata for Omega-Regular Languages ⋮ Büchi Store: An Open Repository of Büchi Automata ⋮ State Coverage Metrics for Specification-Based Testing with Büchi Automata ⋮ Unnamed Item ⋮ Automata-Theoretic Model Checking Revisited ⋮ A weakness measure for GR(1) formulae ⋮ GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic ⋮ Practical synthesis of reactive systems from LTL specifications via parity games ⋮ Tool support for learning Büchi automata and linear temporal logic ⋮ Minimizing GFG Transition-Based Automata ⋮ On-the-fly Emptiness Check of Transition-Based Streett Automata ⋮ On the Relationship between LTL Normal Forms and Büchi Automata
Uses Software
This page was built for publication:
