scientific article
From MaRDI portal
Publication:3906386
zbMath0456.68016MaRDI QIDQ3906386
Edmund M. Clarke, E. Allen Emerson
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Completeness and decidability results for CTL in constructive type theory ⋮ Undecidability of partial order logics ⋮ Uniform inevitability is tree automaton ineffable ⋮ An automata theoretic decision procedure for the propositional mu- calculus ⋮ A methodology for designing proof rules for fair parallel programs ⋮ Fixed point characterization of infinite behavior of finite-state systems ⋮ Preface to the special issue: Temporal logics of agency ⋮ On monitoring linear temporal properties ⋮ An (almost) fuzzy logic of action and preferences, its quasi-model interpretations, and the problem of its decidability ⋮ Simulation relations for fault-tolerance ⋮ On temporal logic versus Datalog ⋮ Branching vs. Linear Time: Semantical Perspective ⋮ The Birth of Model Checking ⋮ DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC ⋮ Discriminative Model Checking ⋮ Towards a process calculus for REST: current state of the art ⋮ Verification of multi-linked heaps ⋮ \textit{Once} and \textit{for all} ⋮ Modal transition systems with weight intervals ⋮ Priority scheduling of distributed systems based on model checking ⋮ Unnamed Item ⋮ Mathematical modal logic: A view of its evolution ⋮ Genetic Programming and Model Checking: Synthesizing New Mutual Exclusion Algorithms ⋮ Impartial Anticipation in Runtime-Verification ⋮ A tableau calculus for first-order branching time logic ⋮ Games for the \(\mu\)-calculus ⋮ A hierarchy of temporal logics with past ⋮ Axiomatising extended computation tree logic ⋮ Arity hierarchy for temporal logics ⋮ Component-wise incremental LTL model checking ⋮ The modeling library of eavesdropping methods in quantum cryptography protocols by model checking ⋮ Compositional Branching-Time Measurements ⋮ Bridging the gap between fair simulation and trace inclusion ⋮ Knowledge Based Scheduling of Distributed Systems ⋮ Alternative semantics for temporal logics ⋮ Decision procedures and expressiveness in the temporal logic of branching time ⋮ On model checking for the \(\mu\)-calculus and its fragments ⋮ Proving the Refuted: Symbolic Model Checkers as Proof Generators ⋮ Meanings of Model Checking ⋮ \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) ⋮ On Distributive Fixed-Point Expressions ⋮ From Philosophical to Industrial Logics ⋮ From Monadic Logic to PSL ⋮ Automata-Theoretic Model Checking Revisited ⋮ Satisfiability of Linear Time Mu-Calculus on Finite Traces ⋮ Semantics of algorithmic languages ⋮ On the Complexity of Branching-Time Logics ⋮ Probabilistic temporal logics via the modal mu-calculus ⋮ An infinite hierarchy of temporal logics over branching time ⋮ Results on the propositional \(\mu\)-calculus ⋮ Local higher-order fixpoint iteration ⋮ Hierarchical verification of asynchronous circuits using temporal logic
