Journal ArticleDOI
A unified approach for showing language inclusion and equivalence between various types of Ω-automata
Reads0
Chats0
TLDR
The complexity of showing language containment and equivalence between a Buchi automaton and a Muller or Streett automaton is given and a six by six matrix in which each row and column is associated with one of these types of automata is given.About:
This article is published in Information Processing Letters.The article was published on 1993-07-26. It has received 26 citations till now. The article focuses on the topics: Deterministic automaton & Büchi automaton.read more
Citations
More filters
Journal ArticleDOI
Symbolic model checking: 10/sup 20/ states and beyond
TL;DR: In this paper, a model-checking algorithm for mu-calculus formulas which uses R.E. Bryant's (1986) binary decision diagrams to represent relations and formulas symbolically is described.
Book
Ω-languages
TL;DR: The Department of Languages provides a vital component in the undergraduate liberal arts education offered at the University of WisconsinEau Claire and serves at home and abroad as ambassadors for a diverse, peacefully interacting global society.
Proceedings ArticleDOI
Reasoning about edits to feature models
TL;DR: This work presents an algorithm to reason about feature model edits to help designers determine how the program membership of an SPL has changed, and takes two feature models as input (before and after edit versions) and automatically computes the change classification.
Book ChapterDOI
The Theory of Timed Automata
Rajeev Alur,David L. Dill +1 more
TL;DR: The definition provides a simple, and yet powerful, way to annotate state-transition graphs with timing constraints using finitely many real-valued clocks to model the behavior of real-time systems over time.
Journal ArticleDOI
Weak alternating automata are not that weak
Orna Kupferman,Moshe Y. Vardi +1 more
TL;DR: A quadratic translation is described, which circumvents the need for determinization, of Büchi and co-Büchi alternating automata to weak alternating Automata, and gives rise to a simple complementation algorithm for nondeterministic B Müchi automata.
References
More filters
Journal ArticleDOI
Automatic verification of finite-state concurrent systems using temporal logic specifications
TL;DR: It is argued that this technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finite-state concurrent systems.
An Automata-Theoretic Approach to Automatic Program Verification
Moshe Y. Vardi,Pierre Wolper +1 more
Journal ArticleDOI
The complexity of propositional linear temporal logics
A. P. Sistla,Edmund M. Clarke +1 more
TL;DR: The complexity of satisfiability and determination of truth in a particular finite structure are considered for different propositional linear temporal logics and it is shown that these problems are NP-complete for the logic with F and PSPACE- complete for the logics with F, X, with U, with S, X operators.
Journal ArticleDOI
Temporal logic can be more expressive
TL;DR: It is proved that there are properties of sequences that are not expressible in temporal logic, even though they are easily expressible using, for instance, regular expressions, and shown how temporal logic can be extended to express any property definable by a right-linear grammar and hence a regular expression.
Related Papers (5)
An Automata-Theoretic Approach to Automatic Program Verification
Moshe Y. Vardi,Pierre Wolper +1 more