scientific article; zbMATH DE number 3870578
From MaRDI portal
Publication:3336675
Recommendations
Cited in
(only showing first 100 items - show all)- Complexity of finite-variable fragments of propositional temporal and modal logics of computation
- Automatic symmetry detection for Promela
- Vacuity in practice: temporal antecedent failure
- A hierarchy of failures-based models: theory and application
- HyperPCTL: A Temporal Logic for Probabilistic Hyperproperties
- Counting on CTL\(^*\): On the expressive power of monadic path logic
- Quantified computation tree logic
- An infinite hierarchy of temporal logics over branching time
- A theory of formal synthesis via inductive learning
- On the semantics of strategy logic
- The guarded fragment with transitive guards
- Synthesizing synchronous systems by static scheduling in space-time
- Approximation Refinement for Interpolation-Based Model Checking
- Not all bugs are created equal, but robust reachability can tell the difference
- Verification Modulo theories
- A logical query language for hypermedia systems
- Test generation from P systems using model checking
- Graph Games and Reactive Synthesis
- Dependences in strategy logic
- A theoretical foundation of the DSSSL location model
- Bounded model checking of traffic light control system
- \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
- From non-preemptive to preemptive scheduling using synchronization synthesis
- Verification of distributed systems with the axiomatic system of MSVL
- Distributed Synthesis for Alternating-Time Logics
- A parametric analysis of the state-explosion problem in model checking
- Inferring Synchronization under Limited Observability
- Arity hierarchy for temporal logics
- A clausal resolution method for extended computation tree logic ECTL
- On feasible cases of checking multi-agent systems behavior.
- Assume-guarantee synthesis for digital contract signing
- Translating Java for multiple model checkers: The Bandera back-end
- Interpretability of first-order linear temporal logics in fork algebras
- Program repair without regret
- A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria
- Determinization and memoryless winning strategies
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\)
- Probability logics for reasoning about quantum observations
- A complete axiom system for propositional projection temporal logic with cylinder computation model
- Global and local views of state fairness
- Synchronous counting and computational algorithm design
- Control machines: A new model of parallelism for compositional specifications and their effective compilation
- Improving parity games in practice
- Clausal resolution in a logic of rational agency
- Synthesis of communicating process skeletons from temporal-spatial logic specifications
- Introduction to model checking
- scientific article; zbMATH DE number 7136658 (Why is no real title available?)
- scientific article; zbMATH DE number 7438567 (Why is no real title available?)
- An algorithm for probabilistic alternating simulation
- Code aware resource management
- A temporal logic for real-time partial ordering with named transactions
- On model checking multiple hybrid views
- A formal proof of the deadline driven scheduler in PPTL axiomatic system
- Analysis of dynamic policies
- Model checking concurrent programs
- Linear temporal logic symbolic model checking
- Results on the propositional \(\mu\)-calculus
- The Birth of Model Checking
- An improved algorithm for the evaluation of fixpoint expressions
- Verification of scope-dependent hierarchical state machines
- Verification of reactive systems using temporal logic with clocks
- Temporal logics for concurrent recursive programs: satisfiability and model checking
- A technique of state space search based on unfolding
- Automated analysis of mutual exclusion algorithms using CCS
- Proof systems for satisfiability in Hennessy-Milner logic with recursion
- Weak, strong, and strong cyclic planning via symbolic model checking
- Verification of multi-linked heaps
- A complete proof system for propositional projection temporal logic
- TABLEAUX: A general theorem prover for modal logics
- Ordered multi-stack visibly pushdown automata
- Complexity results on branching-time pushdown model checking
- Reasoning about equilibria in game-like concurrent systems
- On the Complexity of Branching-Time Logics
- Mean-payoff games with \(\omega\)-regular specifications
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
- DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
- Aspect Categories and Classes of Temporal Properties
- Bounded situation calculus action theories
- Automated synthesis of asynchronizations
- Module checking
- Monitoring metric first-order temporal properties
- The Complexity of CTL* + Linear Past
- Interleaving set temporal logic
- Augmenting ATL with strategy contexts
- A multiprocess network logic with temporal and spatial modalities
- About the expressive power of CTL combinators
- Model checking mobile ad hoc networks
- An accessible verification environment for UML models of services
- Model checking and abstraction to the aid of parameterized systems (a survey)
- On the universal and existential fragments of the \(\mu\)-calculus
- Formal modeling and verification for MVB
- A CTL* Model Checker for Petri Nets
- Algebraic simulations
- A space-efficient on-the-fly algorithm for real-time model checking
- Combining symmetry reduction and under-approximation for symbolic model checking
- Relating fair testing and accordance for service replaceability
- Compositional Control Synthesis for Partially Observable Systems
- A taxonomy of fairness and temporal logic problems for Petri nets
- Tutorial on Model Checking: Modelling and Verification in Computer Science
- Formal modelling, analysis and verification of hybrid systems
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 Q3336675)
