The following pages link to (Q3336675):
Displaying 50 items.
- Synthesis of communicating process skeletons from temporal-spatial logic specifications (Q1116944) (← links)
- Characterizing finite Kripke structures in propositional temporal logic (Q1123183) (← links)
- Control machines: A new model of parallelism for compositional specifications and their effective compilation (Q1177148) (← links)
- TABLEAUX: A general theorem prover for modal logics (Q1181709) (← links)
- Synthesizing synchronous systems by static scheduling in space-time (Q1187649) (← links)
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus (Q1325848) (← links)
- A logical query language for hypermedia systems (Q1328531) (← links)
- A technique of state space search based on unfolding (Q1346650) (← links)
- Determinization and memoryless winning strategies (Q1357005) (← links)
- A theoretical foundation of the DSSSL location model (Q1370525) (← links)
- A temporal logic for real-time partial ordering with named transactions (Q1391307) (← links)
- An improved algorithm for the evaluation of fixpoint expressions (Q1391536) (← links)
- Counting on CTL\(^*\): On the expressive power of monadic path logic (Q1398378) (← links)
- Undecidable problems in unreliable computations. (Q1401309) (← links)
- On feasible cases of checking multi-agent systems behavior. (Q1401355) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Verification of reactive systems using temporal logic with clocks (Q1575841) (← links)
- Quantified computation tree logic (Q1603537) (← links)
- Clausal resolution in a logic of rational agency (Q1606116) (← links)
- Model-checking iterated games (Q1674862) (← links)
- A theory of formal synthesis via inductive learning (Q1674868) (← links)
- Reasoning about graded strategy quantifiers (Q1706169) (← links)
- Backdoors for linear temporal logic (Q1725638) (← 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)
- Weak Muller acceptance conditions for tree automata (Q1770388) (← links)
- Cycle detection in computation tree logic (Q1784962) (← links)
- An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation (Q1785863) (← links)
- Module checking (Q1854407) (← links)
- An infinite hierarchy of temporal logics over branching time (Q1854487) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- Symbolic model checking of timed guarded commands using difference decision diagrams (Q1858438) (← links)
- The guarded fragment with transitive guards (Q1877098) (← links)
- Model checking and abstraction to the aid of parameterized systems (a survey) (Q1886449) (← links)
- A planner agent that tries its best in presence of nondeterminism (Q1948282) (← links)
- GR(1)*: GR(1) specifications extended with existential guarantees (Q1982646) (← links)
- Dependences in strategy logic (Q1987514) (← links)
- Alternating-time temporal logics with linear past (Q1989330) (← links)
- Vacuity in practice: temporal antecedent failure (Q2018060) (← links)
- Producing explanations for rich logics (Q2024339) (← links)
- One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\) (Q2029608) (← links)
- Improving parity games in practice (Q2043434) (← links)
- Context-free timed formalisms: robust automata and linear temporal logics (Q2113377) (← links)
- Language and communication problems in formalization: a natural language approach (Q2117584) (← links)
- Greening R. Thomas' framework with environment variables: a divide and conquer approach (Q2142101) (← links)
- Deadlock in packet switching networks (Q2145272) (← links)
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
- Why there is no general solution to the problem of software verification (Q2151520) (← links)
- Is my attack tree correct? (Q2167713) (← links)
