The following pages link to (Q3906386):
Displaying 50 items.
- Completeness and decidability results for CTL in constructive type theory (Q287375) (← links)
- Undecidability of partial order logics (Q294640) (← links)
- Verification of multi-linked heaps (Q439948) (← links)
- \textit{Once} and \textit{for all} (Q439961) (← links)
- Modal transition systems with weight intervals (Q444490) (← links)
- Priority scheduling of distributed systems based on model checking (Q453501) (← links)
- Component-wise incremental LTL model checking (Q510894) (← links)
- The modeling library of eavesdropping methods in quantum cryptography protocols by model checking (Q518056) (← links)
- Preface to the special issue: Temporal logics of agency (Q616042) (← links)
- Games for the \(\mu\)-calculus (Q671352) (← links)
- A hierarchy of temporal logics with past (Q672329) (← links)
- Semantics of algorithmic languages (Q760200) (← links)
- Results on the propositional \(\mu\)-calculus (Q801893) (← links)
- Towards a process calculus for REST: current state of the art (Q902704) (← links)
- Arity hierarchy for temporal logics (Q944387) (← links)
- Hierarchical verification of asynchronous circuits using temporal logic (Q1070998) (← links)
- Uniform inevitability is tree automaton ineffable (Q1108048) (← links)
- An automata theoretic decision procedure for the propositional mu- calculus (Q1119630) (← links)
- A methodology for designing proof rules for fair parallel programs (Q1377299) (← links)
- Fixed point characterization of infinite behavior of finite-state systems (Q1389678) (← links)
- On temporal logic versus Datalog (Q1401358) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Simulation relations for fault-tolerance (Q1688554) (← links)
- An infinite hierarchy of temporal logics over branching time (Q1854487) (← links)
- Local higher-order fixpoint iteration (Q2105477) (← links)
- Alternative semantics for temporal logics (Q2265815) (← links)
- Decision procedures and expressiveness in the temporal logic of branching time (Q2265816) (← links)
- Bridging the gap between fair simulation and trace inclusion (Q2486398) (← links)
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) (Q2500472) (← links)
- Probabilistic temporal logics via the modal mu-calculus (Q2566296) (← links)
- Satisfiability of Linear Time Mu-Calculus on Finite Traces (Q2817904) (← links)
- Branching vs. Linear Time: Semantical Perspective (Q3510781) (← links)
- The Birth of Model Checking (Q3512430) (← links)
- DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC (Q3512441) (← links)
- Discriminative Model Checking (Q3512513) (← links)
- Genetic Programming and Model Checking: Synthesizing New Mutual Exclusion Algorithms (Q3540062) (← links)
- Impartial Anticipation in Runtime-Verification (Q3540087) (← links)
- Knowledge Based Scheduling of Distributed Systems (Q3587250) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- On the Complexity of Branching-Time Logics (Q3644771) (← links)
- A tableau calculus for first-order branching time logic (Q4632314) (← links)
- On Distributive Fixed-Point Expressions (Q4943552) (← links)
- (Q5021005) (← links)
- Compositional Branching-Time Measurements (Q5170747) (← links)
- Proving the Refuted: Symbolic Model Checkers as Proof Generators (Q5187831) (← links)
- Meanings of Model Checking (Q5187832) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)
- Automata-Theoretic Model Checking Revisited (Q5452603) (← links)
- Axiomatising extended computation tree logic (Q5878903) (← links)
- On model checking for the \(\mu\)-calculus and its fragments (Q5941205) (← links)
