Pages that link to "Item:Q1341752"

The following pages link to Reasoning about infinite computations (Q1341752):

Displaying 50 items.

• PSPACE-completeness of modular supervisory control problems (Q1773103) (← links)
• CTL\(^\ast\) with graded path modalities (Q1784942) (← links)
• Distributed synthesis for parameterized temporal logics (Q1784965) (← links)
• Visibly linear dynamic logic (Q1786616) (← links)
• Combining deduction and model checking into tableaux and algorithms for converse-PDL. (Q1854371) (← links)
• Verification by augmented finitary abstraction (Q1854391) (← links)
• Module checking (Q1854407) (← links)
• On the complexity of verifying concurrent transition systems (Q1854510) (← links)
• Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
• Quantitative solution of omega-regular games (Q1887716) (← links)
• Alternating-time temporal logics with linear past (Q1989330) (← links)
• Multi-robot LTL planning under uncertainty (Q2024360) (← links)
• A theory of monitors (Q2051767) (← links)
• Vacuity in synthesis (Q2058393) (← links)
• \( \omega \)-automata (Q2074208) (← links)
• \(\mathsf{GR}(1)\) is equivalent to \(\mathsf{R}(1)\) (Q2094389) (← links)
• Synthesis in presence of dynamic links (Q2105465) (← links)
• Verification of agent navigation in partially-known environments (Q2144175) (← links)
• Finite-word hyperlanguages (Q2232276) (← links)
• Certifying inexpressibility (Q2233423) (← links)
• Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
• Transformation from PLTL to automata via NFGs (Q2253959) (← links)
• Probabilization of logics: completeness and decidability (Q2254552) (← links)
• Model checking of linear-time properties in multi-valued systems (Q2282319) (← links)
• Determinizing monitors for HML with recursion (Q2291832) (← links)
• A verification-driven framework for iterative design of controllers (Q2335947) (← links)
• Qualitative analysis of gene regulatory networks by temporal logic (Q2355694) (← links)
• Abstract interpretation as automated deduction (Q2360874) (← links)
• From LTL to deterministic automata. A safraless compositional approach (Q2363815) (← links)
• GSTE is partitioned model checking (Q2385196) (← links)
• On the complexity of determinizing monitors (Q2399244) (← links)
• Parameterized linear temporal logics meet costs: still not costlier than LTL (Q2413483) (← links)
• Verification of gap-order constraint abstractions of counter systems (Q2435309) (← links)
• Optimized temporal monitors for SystemcC (Q2441724) (← links)
• A complete characterization of deterministic regular liveness properties (Q2465051) (← links)
• Bridging the gap between fair simulation and trace inclusion (Q2486398) (← links)
• Alternating automata and temporal logic normal forms (Q2488275) (← links)
• LTL over integer periodicity constraints (Q2503321) (← links)
• The alternation hierarchy in fixpoint logic with chop is strict too (Q2509356) (← links)
• Prime languages (Q2514149) (← links)
• From complementation to certification (Q2575735) (← links)
• Relating word and tree automata (Q2576943) (← links)
• Robust, expressive, and quantitative linear temporal logics: pick any two for free (Q2672232) (← links)
• On the unusual effectiveness of logic in computer science (Q2736585) (← links)
• Past is for free: on the complexity of verifying linear temporal properties with past (Q2842605) (← links)
• Model Checking Information Flow in Reactive Systems (Q2891409) (← links)
• Effective Synthesis of Asynchronous Systems from GR(1) Specifications (Q2891421) (← links)
• Weighted LTL with Discounting (Q2914725) (← links)
• Model-Checking Linear-Time Properties of Quantum Systems (Q2946731) (← links)
• Parameterized Weighted Containment (Q2946752) (← links)