Model checking knowledge and time in systems with perfect recall. (Extended abstract)
From MaRDI portal
Recommendations
- Model Checking Knowledge and Linear Time: PSPACE Cases
- scientific article; zbMATH DE number 2087624
- scientific article; zbMATH DE number 5051662
- An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
- Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall
Cited in
(39)- Bounded model checking for knowledge and real time
- Common knowledge and update in finite environments
- Exponential improvement of time complexity of model checking for multiagent systems with perfect recall
- Model-checking graded computation-tree logic with finite path semantics
- Uniform strategies, rational relations and jumping automata
- Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams
- A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic
- Using temporal logics of knowledge for specification and verification -- a case study
- Parameterised verification for multi-agent systems
- A compositional automata-based approach for model checking multi-agent systems
- Model Checking Information Flow in Reactive Systems
- An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
- Relating paths in transition systems: the fall of the modal mu-calculus
- Knowledge = observation + memory + computation
- The complexity of epistemic model checking: clock semantics and branching time
- Specification and Verification of Multi-Agent Systems
- Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall
- Well-structured model checking of multiagent systems
- Exponential acceleration of model checking for perfect recall systems
- Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions
- Symbolic Model Checking of Tense Logics on Rational Kripke Models
- scientific article; zbMATH DE number 140397 (Why is no real title available?)
- Combined model checking for temporal, probabilistic, and real-time logics
- scientific article; zbMATH DE number 2087624 (Why is no real title available?)
- scientific article; zbMATH DE number 2112166 (Why is no real title available?)
- Undecidable cases of model checking probabilistic temporal-epistemic logic (extended abstract)
- Approximating Perfect Recall when Model Checking Strategic Abilities: Theory and Applications
- scientific article; zbMATH DE number 7311252 (Why is no real title available?)
- Infinite games with finite knowledge gaps
- Computer Aided Verification
- Model Checking Knowledge and Linear Time: PSPACE Cases
- To know or not to know: Epistemic approaches to security protocol verification
- Of temporary coalitions in terms of concurrent game models, announcements, and temporal projection
- The complexity of second-order HyperLTL
- Explainability requirements as hyperproperties
- The complexity of second-order HyperLTL
- Unifying asynchronous logics for hyperproperties
- Complexity of model checking second-order hyperproperties on finite structures
- Extensions of HyperLTL for asynchronous hyperproperties
This page was built for publication: Model checking knowledge and time in systems with perfect recall. (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501688)
