An automata-theoretic approach to linear temporal logic
From MaRDI portal
Publication:6560392
DOI10.1007/3-540-60915-6_6zbMATH Open1543.68236MaRDI QIDQ6560392
Publication date: 21 June 2024
Formal languages and automata (68Q45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On equations for regular languages, finite automata, and sequential networks
- Alternating finite automata on \(\omega\)-words
- Using branching time temporal logic to synthesize synchronization skeletons
- The complementation problem for Büchi automata with applications to temporal logic
- Alternating automata on infinite trees
- Descriptive set theory
- Succinct representation of regular languages by Boolean automata
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Space-bounded reducibility among combinatorial problems
- Reasoning about infinite computations
- Relationships between nondeterministic and deterministic tape complexities
- Is the Interesting Part of Process Logic uninteresting?: A Translation from PL to PDL
- Synthesis of Communicating Processes from Temporal Logic Specifications
- “Sometimes” and “not never” revisited
- The complexity of propositional linear temporal logics
- Alternation
- Proving Liveness Properties of Concurrent Programs
- Solving Sequential Conditions by Finite-State Strategies
- Testing and generating infinite sequences by a finite automaton
- Decidability of Second-Order Theories and Automata on Infinite Trees
Related Items (4)
Practical applications of the alternating cycle decomposition ⋮ Linear-time logics -- a coalgebraic perspective ⋮ First order Büchi automata and their application to verification of LTL specifications ⋮ On the exploitation of control knowledge for enhancing automated planning
This page was built for publication: An automata-theoretic approach to linear temporal logic
