Decision procedures and expressiveness in the temporal logic of branching time
Journal of Computer and System Sciences
Reasoning about knowledge
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Bounded Model Checking for Deontic Interpreted Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
MCMAS: a model checker for multi-agent systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A temporal epistemic logic with a reset operation
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Verification of the TESLA protocol in MCMAS-X
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Towards verifying compliance in agent-based web service compositions
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Towards verifying contract regulated service composition
Autonomous Agents and Multi-Agent Systems
Verification of the TESLA protocol in MCMAS-X
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
| Hi-index | 0.00 |
We solve the problem left open in [5] by providing a complete axiomatisation of deontic interpreted systems on a language that includes full CTL as well as the Ki, Oi and ${\mathcal{\widehat{\rm {K}}}}^j_i$ modalities. Additionally we show that the logic employed enjoys the finite model property, hence decidability is guaranteed. To achieve these results we follow and extend the technique used by Halpern and Emerson in [2].