Pages that link to "Item:Q1051419"
From MaRDI portal
The following pages link to Using branching time temporal logic to synthesize synchronization skeletons (Q1051419):
Displaying 50 items.
- Completeness and decidability results for CTL in constructive type theory (Q287375) (← links)
- Axiomatization of a branching time logic with indistinguishability relations (Q288245) (← links)
- A logic of separating modalities (Q290917) (← links)
- On temporal logics with data variable quantifications: decidability and complexity (Q342712) (← links)
- Synthesis of large dynamic concurrent programs from dynamic specifications (Q346790) (← links)
- Automata-theoretic decision of timed games (Q386611) (← links)
- MR4UM: a framework for adding fault tolerance to UML state diagrams (Q391245) (← links)
- A quadratic construction for Zielonka automata with acyclic communication structure (Q407518) (← links)
- A tableau-based decision procedure for CTL\(^*\) (Q432138) (← links)
- Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
- Complexity of synthesis of composite service with correctness guarantee (Q439758) (← links)
- Synthesis from scenario-based specifications (Q439960) (← links)
- Rewrite rules for \(\mathrm{CTL}^\ast\) (Q518745) (← links)
- Finite-state concurrent programs can be expressed succinctly in triple normal form (Q522959) (← links)
- Preface to the special issue: Temporal logics of agency (Q616042) (← links)
- Completeness of a branching-time logic with possible choices (Q622622) (← links)
- Deductive verification of alternating systems (Q939163) (← links)
- Performability assessment by model checking of Markov reward models (Q968359) (← links)
- Differential dynamic logic for hybrid systems (Q1040772) (← links)
- Automating the addition of fault tolerance with discrete controller synthesis (Q1041296) (← links)
- Model checking for hybrid logic (Q1047796) (← links)
- A decision procedure for combinations of propositional temporal logic and other specialized theories (Q1097264) (← links)
- The complexity of reasoning about knowledge and time. I: Lower bounds (Q1119565) (← links)
- On undecidability of propositional temporal logics on trace systems (Q1199555) (← links)
- Submodule construction as equation solving in CCS (Q1262748) (← links)
- Proving partial order properties (Q1322161) (← links)
- A theory of timed automata (Q1322162) (← links)
- A logic for reasoning about time and reliability (Q1343864) (← links)
- Supervisory control and reactive synthesis: a comparative introduction (Q1693819) (← links)
- Sublogics of a branching time logic of robustness (Q1740655) (← links)
- MetateM: An introduction (Q1904643) (← links)
- On hierarchically developing reactive systems (Q1959436) (← links)
- On the expressive power of hybrid branching-time logics (Q1989342) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← 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)
- Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\) (Q2249659) (← links)
- Decision procedures and expressiveness in the temporal logic of branching time (Q2265816) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- Model checking for hybrid branching-time logics (Q2291813) (← links)
- Compositional verification of asynchronous concurrent systems using CADP (Q2350492) (← links)
- Complexity results on branching-time pushdown model checking (Q2373715) (← links)
- Operational semantics of Framed Tempura (Q2378283) (← links)
- Linear templates of ACTL formulas with an application to SAT-based verification (Q2398494) (← links)
- From model checking to equilibrium checking: reactive modules for rational verification (Q2407463) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- A propositional linear time logic with time flow isomorphic to \(\omega^2\) (Q2447179) (← links)
- CTL update of Kripke models through protections (Q2453698) (← links)
- A modular approach to defining and characterising notions of simulation (Q2495641) (← links)
- Theorem proving using clausal resolution: from past to present (Q2695485) (← links)
