scientific article; zbMATH DE number 3714896
From MaRDI portal
Publication:3906386
Cited in
(54)- Hierarchical verification of asynchronous circuits using temporal logic
- 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
- On temporal logic versus Datalog
- Mathematical modal logic: A view of its evolution
- Simulation relations for fault-tolerance
- An infinite hierarchy of temporal logics over branching time
- Local higher-order fixpoint iteration
- Alternative semantics for temporal logics
- Decision procedures and expressiveness in the temporal logic of branching time
- Bridging the gap between fair simulation and trace inclusion
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\)
- Probabilistic temporal logics via the modal mu-calculus
- Satisfiability of linear time mu-calculus on finite traces
- Completeness and decidability results for CTL in constructive type theory
- Undecidability of partial order logics
- 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
- Genetic Programming and Model Checking: Synthesizing New Mutual Exclusion Algorithms
- Impartial Anticipation in Runtime-Verification
- Knowledge based scheduling of distributed systems
- From Philosophical to Industrial Logics
- On the Complexity of Branching-Time Logics
- 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
- A tableau calculus for first-order branching time logic
- On Distributive Fixed-Point Expressions
- scientific article; zbMATH DE number 7455743 (Why is no real title available?)
- Component-wise incremental LTL model checking
- Compositional branching-time measurements
- The modeling library of eavesdropping methods in quantum cryptography protocols by model checking
- Proving the refuted: symbolic model checkers as proof generators
- Meanings of model checking
- From Monadic Logic to PSL
- Automata-Theoretic Model Checking Revisited
- Axiomatising extended computation tree logic
- On model checking for the -calculus and its fragments
- On monitoring linear temporal properties
- An (almost) fuzzy logic of action and preferences, its quasi-model interpretations, and the problem of its decidability
- Preface to the special issue: Temporal logics of agency
- Modal and temporal logics for processes
- Games for the -calculus
- A hierarchy of temporal logics with past
- Model checking distributed temporal logic
- Semantics of algorithmic languages
- Results on the propositional \(\mu\)-calculus
- Towards a process calculus for REST: current state of the art
- Arity hierarchy for temporal logics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3906386)