MCK

swMATH9465MaRDI QIDQ21448FDOQ21448

Author name not available (Why is that?)

Official website: http://cgi.cse.unsw.edu.au/~mck/pmck/

Cited In (51)

• Undecidable cases of model checking probabilistic temporal-epistemic logic (extended abstract)
• Parameterised verification for multi-agent systems
• Populational announcement logic (PPAL)
• Combined model checking for temporal, probabilistic, and real-time logics
• Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol
• Terminal satisfiability in GSTE
• Bounded model checking for knowledge and real time
• Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types
• Verifying real-time properties of multi-agent systems via SMT-based bounded model checking
• A Complete Quantified Epistemic Logic for Reasoning about Message Passing Systems
• First-Order Linear-Time Epistemic Logic with Group Knowledge: An Axiomatisation of the Monodic Fragment
• Checking EMTLK properties of timed interpreted systems via bounded model checking
• Connecting dynamic epistemic and temporal epistemic logics
• Model-based safety assessment of a triple modular generator with xSAP
• From Situation Calculus to Dynamic Epistemic Logic
• Formalising privacy policies in social networks
• A three-value abstraction technique for the verification of epistemic properties in multi-agent systems
• Symbolic model checking the knowledge in Herbivore protocol
• Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams
• VerICS
• CUDD
• AgentSpeak
• simpleAPL
• BDDNOW
• MCMAS
• Verics
• MOCHA
• MMC
• GBDD
• KURE
• 3APL
• jMocha
• MCMAS-SLK
• KBPs
• DEMO
• SMCDEL
• To know or not to know: Epistemic approaches to security protocol verification
• An epistemic predicate \(\mathrm{CTL}^{*}\) for finite control \(\pi\)-processes
• EPFL
• Approximate verification of strategic abilities under imperfect information
• Quantified epistemic logics for reasoning about knowledge in multi-agent systems
• Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic
• Verification and strategy synthesis for coalition announcement logic
• Symbolic model checking for temporal-epistemic logic
• Verified synthesis of knowledge-based programs in finite synchronous environments
• Practical verification of multi-agent systems against \textsc{Slk} specifications
• A first-order coalition logic for BDI-agents
• Computer Aided Verification
• Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic
• Automatic data-abstraction in model checking multi-agent systems
• Combining fault injection and model checking to verify fault tolerance, recoverability, and diagnosability in multi-agent systems

This page was built for software: MCK