Multi-Valued Reasoning about Reactive Systems
From MaRDI portal
Publication:5060674
DOI10.1561/0400000083OpenAlexW4312417342MaRDI QIDQ5060674
Publication date: 11 January 2023
Published in: Foundations and Trends® in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1561/0400000083
Uses Software
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
- Unnamed Item
- Unnamed Item
- A hierarchy of temporal logics with past
- The complementation problem for Büchi automata with applications to temporal logic
- Automata-theoretic techniques for modal logics of programs
- Complementing deterministic Büchi automata in polynomial time
- The temporal semantics of concurrent programs
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Reasoning about infinite computations
- Latticed-LTL synthesis in the presence of noisy inputs
- NuSMV: A new symbolic model checker
- Improved Ramsey-Based Büchi Complementation
- Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete
- Unifying Büchi Complementation Constructions.
- Finite-Valued Weighted Automata.
- What’s Decidable about Weighted Automata?
- Temporal Logic and Fair Discrete Systems
- Automata Theory and Model Checking
- Formally Reasoning About Quality
- On the Merits of Temporal Testers
- Ranking Automata and Games for Prioritized Requirements
- Complementation, Disambiguation, and Determinization of Büchi Automata Unified
- Quantitative Languages
- Weak alternating automata are not that weak
- Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata
- Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- The complexity of propositional linear temporal logics
- Nondeterministic Space is Closed under Complementation
- Alternation
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- On Temporal Logic and Signal Processing
- Computational Complexity
- Formalizing and Reasoning about Quality
- An automata-theoretic approach to branching-time model checking
- Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
- Model Checking Quantitative Linear Time Logic
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Lattice Automata
- Automata, Languages and Programming
- Automata, Languages and Programming
- BÜCHI COMPLEMENTATION MADE TIGHTER
- Decision problems forω-automata
- Testing and generating infinite sequences by a finite automaton
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Depth-First Search and Linear Graph Algorithms
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: Multi-Valued Reasoning about Reactive Systems
