Pages that link to "Item:Q1341752"
From MaRDI portal
The following pages link to Reasoning about infinite computations (Q1341752):
Displaying 50 items.
- Inherent Vacuity in Lattice Automata (Q2947173) (← links)
- Synthesizing Non-Vacuous Systems (Q2961552) (← links)
- Size-Change Termination and Satisfiability for Linear-Time Temporal Logics (Q3172880) (← links)
- The Complexity of Reversal-Bounded Model-Checking (Q3172883) (← links)
- Temporal Logic and Fair Discrete Systems (Q3176360) (← links)
- Automata Theory and Model Checking (Q3176362) (← links)
- Explicit-State Model Checking (Q3176363) (← links)
- SAT-Based Model Checking (Q3176368) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- Model Checking Probabilistic Systems (Q3176386) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
- Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL (Q3183543) (← links)
- (Q3221399) (← links)
- (Q3384177) (← links)
- REASONING ABOUT TRANSFINITE SEQUENCES (Q3426789) (← links)
- Linear-Time Model Checking: Automata Theory in Practice (Q3503888) (← links)
- Mapping Properties of Heterogeneous Ontologies (Q3534659) (← links)
- The Quest for a Tight Translation of Büchi to co-Büchi Automata (Q3586001) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata (Q3617729) (← links)
- On Omega-Languages Defined by Mean-Payoff Conditions (Q3617739) (← links)
- Synthesis from Component Libraries (Q3617743) (← links)
- Description Logics (Q3638996) (← links)
- Linear-time temporal logics with Presburger constraints: an overview ★ (Q3647243) (← links)
- Runtime Verification Using a Temporal Description Logic (Q3655197) (← links)
- Temporal equilibrium logic: a survey (Q4583305) (← links)
- Expressiveness and succinctness of a logic of robustness (Q4586143) (← links)
- (Q5013884) (← links)
- (Q5015285) (← links)
- (Q5020519) (← links)
- (Q5020999) (← links)
- (Q5021013) (← links)
- Multi-Valued Reasoning about Reactive Systems (Q5060674) (← links)
- Results on alternating-time temporal logics with linear past (Q5079770) (← links)
- On Repetition Languages (Q5089230) (← links)
- Minimizing GFG Transition-Based Automata (Q5091262) (← links)
- A CTL* Model Checker for Petri Nets (Q5100762) (← links)
- Consistently-detecting monitors (Q5111620) (← links)
- (Q5129940) (← links)
- Backward Deterministic Büchi Automata on Infinite Words (Q5136295) (← links)
- How Deterministic are Good-For-Games Automata? (Q5136308) (← links)
- Knowledge-based programs (Q5137342) (← links)
- Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations (Q5169969) (← links)
- An Automata-based Approach for CTL⋆ With Constraints (Q5179062) (← links)
- Computing with Infinite Terms and Infinite Reductions (Q5208870) (← links)
- Random Models for Evaluating Efficient Büchi Universality Checking (Q5224494) (← links)
- Alternating automata: Unifying truth and validity checking for temporal logics (Q5234701) (← links)
- Ramsey-Based Inclusion Checking for Visibly Pushdown Automata (Q5277899) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)