Publication:4422087
From MaRDI portal
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
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Unnamed Item, Unnamed Item, Multi-Valued Reasoning about Reactive Systems, Minimizing GFG Transition-Based Automata, Automata-Theoretic Model Checking Revisited, GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic, A weakness measure for GR(1) formulae, From linear temporal logics to Büchi automata: the early and simple principle, Degeneralization algorithm for generation of Büchi automata based on contented situation, Transparent partial order reduction, Linear temporal logic symbolic model checking, Tool support for learning Büchi automata and linear temporal logic, Efficient approach of translating LTL formulae into Büchi automata, Determinization and limit-determinization of Emerson-Lei automata, Practical synthesis of reactive systems from LTL specifications via parity games, From LTL to deterministic automata. A safraless compositional approach, On the Relationship between LTL Normal Forms and Büchi Automata, Büchi Store: An Open Repository of Büchi Automata, State Coverage Metrics for Specification-Based Testing with Büchi Automata, Automata Theory and Model Checking, Approximate Automata for Omega-Regular Languages, On-the-fly Emptiness Check of Transition-Based Streett Automata
Uses Software