scientific article; zbMATH DE number 3870578
From MaRDI portal
Publication:3336675
Recommendations
Cited in
(only showing first 100 items - show all)- A complete proof system for propositional projection temporal logic
- \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
- Hierarchical cost-parity games
- Structure-based deadlock checking of asynchronous circuits
- GR(1)*: GR(1) specifications extended with existential guarantees
- Dependences in strategy logic
- Symbolic model checking of timed guarded commands using difference decision diagrams
- Dependences in strategy logic
- Improving parity games in practice
- Compositional Control Synthesis for Partially Observable Systems
- Automated analysis of mutual exclusion algorithms using CCS
- Proof systems for satisfiability in Hennessy-Milner logic with recursion
- Branching-time logics and fairness, revisited
- A technique of state space search based on unfolding
- Process algebra and model checking
- A multiprocess network logic with temporal and spatial modalities
- Backdoors for linear temporal logic
- Requirements, specifications, and minimal refinement
- SAT-based bounded model checking for propositional projection temporal logic
- ATL* Satisfiability Is 2EXPTIME-Complete
- Mitigating covert channels based on analysis of the potential for communication
- A temporal logic for real-time partial ordering with named transactions
- HyperPCTL: A Temporal Logic for Probabilistic Hyperproperties
- scientific article; zbMATH DE number 1670484 (Why is no real title available?)
- Not all bugs are created equal, but robust reachability can tell the difference
- Augmenting ATL with strategy contexts
- Model checking of pushdown systems for projection temporal logic
- On the complexity of \(\mathsf{ATL}\) and \(\mathsf{ATL}^*\) module checking
- Model checking concurrent programs
- GR(1)*: GR(1) specifications extended with existential guarantees
- The Birth of Model Checking
- Analyzing oscillatory behavior with formal methods
- A temporal logic for real-time partial-ordering with named transactions
- Clausal resolution in a logic of rational agency
- Model checking merged program traces
- Automated temporal reasoning about reactive systems
- An arrow-based dynamic logic of normative systems and its decidability
- Counting on CTL^*: On the expressive power of monadic path logic
- Weighted versus Probabilistic Logics
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
- Model-checking graded computation-tree logic with finite path semantics
- Context-free timed formalisms: robust automata and linear temporal logics
- On the universal and existential fragments of the \(\mu\)-calculus
- Enriched μ–Calculus Pushdown Module Checking
- Inferring Synchronization under Limited Observability
- An infinite hierarchy of temporal logics over branching time
- A survey on temporal logics for specifying and verifying real-time systems
- rCOS: defining meanings of component-based software architectures
- scientific article; zbMATH DE number 7577569 (Why is no real title available?)
- Formal modelling, analysis and verification of hybrid systems
- Quantified computation tree logic
- Language and communication problems in formalization: a natural language approach
- Relating fair testing and accordance for service replaceability
- Toward model selection by formal methods
- Partial-order reduction in the weak modal mu-calculus
- Bounded situation calculus action theories
- An algorithm for probabilistic alternating simulation
- Probability logics for reasoning about quantum observations
- Characterizing finite Kripke structures in propositional temporal logic
- On the Complexity of Branching-Time Logics
- Synthesis of communicating process skeletons from temporal-spatial logic specifications
- Cancer hybrid automata: model, beliefs and therapy
- CTL model checking of MDPs over distribution spaces: algorithms and sampling-based computations
- Parameterized complexity of CTL
- Test generation from P systems using model checking
- Algebra-based synthesis of loops and their invariants (invited paper)
- Generative program analysis and beyond: the power of domain-specific languages (invited paper)
- Analysis of dynamic policies
- Verifying a network invariant for all configurations of the Futurebus+ cache coherence protocol
- Parameter space abstraction and unfolding semantics of discrete regulatory networks
- A theory of formal synthesis via inductive learning
- A CTL* Model Checker for Petri Nets
- scientific article; zbMATH DE number 7056237 (Why is no real title available?)
- Module checking
- Taking Some Burden Off an Explicit CTL Model Checker
- Symbolic computation in automated program reasoning
- Alternating-time temporal logics with linear past
- An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning
- Inconsistency-tolerant temporal reasoning with hierarchical information
- Verification of scope-dependent hierarchical state machines
- Be lazy and don't care: faster CTL model checking for recursive state machines
- Results on alternating-time temporal logics with linear past
- A Refined Resolution Calculus for CTL
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\)
- Results on the propositional \(\mu\)-calculus
- Weak, strong, and strong cyclic planning via symbolic model checking
- The Complexity of Linear-Time Temporal Logic Model Repair
- Vacuity in practice: temporal antecedent failure
- Automated synthesis of asynchronizations
- Producing explanations for rich logics
- Hybrid linear logic, revisited
- Generalized possibility computation tree logic with frequency and its model checking
- Distributed Synthesis for Alternating-Time Logics
- A hierarchy of temporal logics with past
- Elimination of detached regions in dependency graph verification
- Verification of multi-linked heaps
- On the Hybrid Extension of CTL and CTL +
- CTL^* and ECTL^* as fragments of the modal -calculus
- Model checking and abstraction to the aid of parameterized systems (a survey)
- Logical characterization of bisimulation metrics
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)