Pages that link to "Item:Q3766825"
From MaRDI portal
The following pages link to “Sometimes” and “not never” revisited (Q3766825):
Displaying 50 items.
- On temporal logic versus Datalog (Q1401358) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Verification of reactive systems using temporal logic with clocks (Q1575841) (← links)
- Simulation relations for fault-tolerance (Q1688554) (← links)
- Supervisory control and reactive synthesis: a comparative introduction (Q1693819) (← links)
- Reasoning about graded strategy quantifiers (Q1706169) (← links)
- Which fragments of the interval temporal logic HS are tractable in model checking? (Q1731517) (← links)
- Sublogics of a branching time logic of robustness (Q1740655) (← links)
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
- Inconsistency-tolerant temporal reasoning with hierarchical information (Q1749966) (← links)
- A hierarchy of failures-based models: theory and application (Q1763727) (← links)
- A compositional approach to CTL\(^*\) verification (Q1770366) (← links)
- Weak Muller acceptance conditions for tree automata (Q1770388) (← links)
- Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy (Q1784961) (← links)
- Cycle detection in computation tree logic (Q1784962) (← links)
- Module checking (Q1854407) (← links)
- An infinite hierarchy of temporal logics over branching time (Q1854487) (← links)
- Syntax-directed model checking of sequential programs (Q1858441) (← links)
- Future temporal logic needs infinitely many modalities (Q1877549) (← links)
- A propositional probabilistic logic with discrete linear time for reasoning about evidence (Q1928821) (← links)
- GR(1)*: GR(1) specifications extended with existential guarantees (Q1982646) (← links)
- Alternating-time temporal logics with linear past (Q1989330) (← links)
- On the expressive power of hybrid branching-time logics (Q1989342) (← links)
- Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\) (Q1989347) (← links)
- Timed vacuity (Q2024362) (← links)
- Temporal logic with recursion (Q2051830) (← links)
- Tableaux and sequent calculi for \textsf{CTL} and \textsf{ECTL}: satisfiability test with certifying proofs and models (Q2095426) (← links)
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
- HyperPCTL model checking by probabilistic decomposition (Q2165513) (← links)
- Model checking interval temporal logics with regular expressions (Q2182727) (← links)
- Model-checking precision agriculture logistics: the case of the differential harvest (Q2220343) (← links)
- Finite-word hyperlanguages (Q2232276) (← links)
- Proving the existence of fair paths in infinite-state systems (Q2234061) (← links)
- Strategies, model checking and branching-time properties in Maude (Q2239275) (← links)
- On the expressiveness of TPTL and MTL (Q2266987) (← links)
- Automatic and hierarchical verification for concurrent systems (Q2277847) (← links)
- Model-checking graded computation-tree logic with finite path semantics (Q2285155) (← links)
- Model checking for hybrid branching-time logics (Q2291813) (← links)
- The model checking fingerprints of CTL operators (Q2317834) (← links)
- An automata-theoretic approach to model-checking systems and specifications over infinite data domains (Q2331081) (← links)
- Iterated Boolean games (Q2346405) (← links)
- Compositional verification of asynchronous concurrent systems using CADP (Q2350492) (← links)
- A goal-directed decision procedure for hybrid PDL (Q2351150) (← links)
- Next-preserving branching bisimulation (Q2355689) (← links)
- On the expressive power of temporal logic (Q2366686) (← links)
- On the universal and existential fragments of the \(\mu\)-calculus (Q2368950) (← links)
- Complexity results on branching-time pushdown model checking (Q2373715) (← links)
- Linear templates of ACTL formulas with an application to SAT-based verification (Q2398494) (← links)
- To be fair, use bundles (Q2408744) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
