Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall

DOI10.1007/978-3-642-02734-5_8zbMATH Open1250.03026OpenAlexW2214827277MaRDI QIDQ3393383FDOQ3393383

Authors: Cătălin Dima 

Publication date: 20 August 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02734-5_8

Recommendations

• scientific article; zbMATH DE number 1500666
• Well-structured model checking of multiagent systems
• scientific article; zbMATH DE number 5051662
• Model Checking Knowledge and Linear Time: PSPACE Cases
• Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Specification and verification (program logics, model checking, etc.) (68Q60) Agent technology and artificial intelligence (68T42) Temporal logic (03B44)

Cites Work

• Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams
• Title not available (Why is that?)
• An Introduction to Symbolic Dynamics and Coding
• Title not available (Why is that?)
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Title not available (Why is that?)
• The tree of knowledge in action: towards a common perspective
• Common knowledge and update in finite environments
• The complexity of reasoning about knowledge and time. I: Lower bounds
• Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
• Infinite trees and automaton-definable relations over \(\omega\)-words
• Title not available (Why is that?)

Cited In (3)

• Uniform strategies, rational relations and jumping automata
• Model-checking graded computation-tree logic with finite path semantics
• Synchronous or alternating? LTL black-box checking of Mealy machines by combining the LearnLib and LTSmin

Uses Software

• MONA

This page was built for publication: Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3393383)