The complementation problem for Büchi automata with applications to temporal logic
type: Item
instance of: scholarly article
title: The complementation problem for Büchi automata with applications to temporal logic
zbMATH Open document ID: 0613.03015
DOI: 10.1016/0304-3975(87)90008-9
author: B. George
published in: Theoretical Computer Science
publication date: 1987-01-01T00:00:00Z
review text: Cf. the review of the preliminary version [Lect. Notes Comput. Sci. 194, 465-474 (1985)] in Zbl 0577.03019.
Mathematics Subject Classification ID: 03D05
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03B45
zbMATH DE Number: 3991485
zbMATH Keywords: omega regularity
zbMATH Keywords: infinite words
zbMATH Keywords: complementing Büchi automata
zbMATH Keywords: decision procedure
zbMATH Keywords: extended temporal logic
zbMATH Keywords: satisfiability problem
zbMATH Keywords: repeating acceptance
MaRDI profile type: Publication
full work available at URL: 0304-3975(87)90008-9
OpenAlex ID: W1976773489
cites work: Equivalence of infinite behavior of finite automata
cites work: Q5525343
cites work: The monadic second order theory of all countable ordinals
cites work: Theories of automata on \(\omega\)-tapes: a simplified approach
cites work: Q4079524
cites work: Process logic: Expressiveness, decidability, completeness
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Q4090322
cites work: Descriptively complete process logic
cites work: Proving Liveness Properties of Concurrent Programs
cites work: The temporal semantics of concurrent programs
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: Q5616162
cites work: Q5541339
cites work: Q4134970
cites work: Q5614656
cites work: The complexity of propositional linear temporal logics
cites work: Q3888985
cites work: Q3214824
cites work: Q3341881
cites work: Automata-theoretic techniques for modal logics of programs
cites work: Reasoning about infinite computations
cites work: Q3948585
cites work: Temporal logic can be more expressive
description: scientific article; zbMATH DE number 3991485