scientific article; zbMATH DE number 1500666

zbMATH Open0958.68119MaRDI QIDQ4501688FDOQ4501688

Authors: Ron van der Meyden, Nikolay V. Shilov 

Publication date: 9 April 2001

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

model checkingmodal logic

Mathematics Subject Classification ID

Knowledge representation (68T30) Logics of knowledge and belief (including belief change) (03B42) Temporal logic (03B44) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (32)

• Undecidable cases of model checking probabilistic temporal-epistemic logic (extended abstract)
• Parameterised verification for multi-agent systems
• Uniform strategies, rational relations and jumping automata
• Title not available (Why is that?)
• Of temporary coalitions in terms of concurrent game models, announcements, and temporal projection
• Model Checking Information Flow in Reactive Systems
• Model-checking graded computation-tree logic with finite path semantics
• Combined model checking for temporal, probabilistic, and real-time logics
• Bounded model checking for knowledge and real time
• Knowledge = observation + memory + computation
• A compositional automata-based approach for model checking multi-agent systems
• Approximating Perfect Recall when Model Checking Strategic Abilities: Theory and Applications
• Title not available (Why is that?)
• An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
• Title not available (Why is that?)
• Well-structured model checking of multiagent systems
• 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
• Model Checking Knowledge and Linear Time: PSPACE Cases
• To know or not to know: Epistemic approaches to security protocol verification
• Relating paths in transition systems: the fall of the modal mu-calculus
• Exponential acceleration of model checking for perfect recall systems
• Title not available (Why is that?)
• Specification and Verification of Multi-Agent Systems
• Exponential improvement of time complexity of model checking for multiagent systems with perfect recall
• Symbolic Model Checking of Tense Logics on Rational Kripke Models
• The complexity of epistemic model checking: clock semantics and branching time
• Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions
• Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall
• Computer Aided Verification
• Infinite games with finite knowledge gaps

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 Q4501688)