MCMAS

swMATH9463MaRDI QIDQ21446FDOQ21446

Author name not available (Why is that?)

Official website: http://link.springer.com/chapter/10.1007/978-3-642-02658-4_55

Cited In (95)

• Undecidable cases of model checking probabilistic temporal-epistemic logic (extended abstract)
• Populational announcement logic (PPAL)
• Two-stage agent program verification
• Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol
• Reasoning about memoryless strategies under partial observability and unconditional fairness constraints
• Minimal Proof Search for Modal Logic K Model Checking
• Verifying real-time properties of multi-agent systems via SMT-based bounded model checking
• Verification of heterogeneous multi-agent system using MCMAS
• A three-value abstraction technique for the verification of epistemic properties in multi-agent systems
• Symbolic model checking the knowledge in Herbivore protocol
• Natural strategic ability
• Using agent JPF to build models for other model checkers
• Synthesis and verification of uniform strategies for multi-agent systems
• Symbolic Model Checking Commitment Protocols Using Reduction
• Approximate verification of strategic abilities under imperfect information
• Resilience, reliability, and coordination in autonomous multi-agent systems
• Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic
• Multi-valued verification of strategic ability
• Verified synthesis of knowledge-based programs in finite synchronous environments
• Qualitative approximate behavior composition
• Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic
• Title not available (Why is that?)
• Dependences in strategy logic
• Parameterised verification for multi-agent systems
• Augmenting ATL with strategy contexts
• Which fragments of the interval temporal logic HS are tractable in model checking?
• Model-checking graded computation-tree logic with finite path semantics
• Verifying team formation protocols with probabilistic model checking
• Verifying Time and Communication Costs of Rule-Based Reasoners
• A Tool for the Automated Verification of Nash Equilibria in Concurrent Games
• Sylvan
• Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives
• Bounded situation calculus action theories
• Progression and verification of situation calculus agents with bounded beliefs
• Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy
• A counter abstraction technique for verifying properties of probabilistic swarm systems
• Interval temporal logic model checking: the border between good and bad HS fragments
• Approximating Perfect Recall when Model Checking Strategic Abilities: Theory and Applications
• Alternating-time temporal logics with linear past
• An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
• Model checking interval temporal logics with regular expressions
• Title not available (Why is that?)
• Model-checking for resource-bounded ATL with production and consumption of resources
• A computationally grounded, weighted doxastic logic
• Checking EMTLK properties of timed interpreted systems via bounded model checking
• Reasoning about graded strategy quantifiers
• Strategies, model checking and branching-time properties in Maude
• Formalising privacy policies in social networks
• Automatic verification of concurrent stochastic systems
• Modelling accuracy and trustworthiness of explaining agents
• Automated temporal equilibrium analysis: verification and synthesis of multi-player games
• DEL-based epistemic planning: decidability and complexity
• Automatic verification of temporal-epistemic properties of cryptographic protocols
• GAVS
• CUDD
• Model checking the logic of Allen's relations \textit{Meets} and \textit{Started-by} is \(\mathbf{P}^{\mathbf{NP}}\)-complete
• BDDNOW
• Verics
• DPF
• Model Checking Knowledge and Linear Time: PSPACE Cases
• EVE
• CTLSAT
• EAGLE
• Hintikka's world
• Mr. Waffles
• To know or not to know: Epistemic approaches to security protocol verification
• Model-checking iterated games
• Cooperative concurrent games
• Reasoning about equilibria in game-like concurrent systems
• Strategic reasoning with a bounded number of resources: the quest for tractability
• Specification and Verification of Multi-Agent Systems
• Verification of multi-agent systems with public actions against strategy logic
• Reasoning about strategies: on the model-checking problem
• Verifying systems of resource-bounded agents
• Verification and strategy synthesis for coalition announcement logic
• Automatic verification of competitive stochastic systems
• Symbolic Model Checking for Dynamic Epistemic Logic
• Symbolic model checking for temporal-epistemic logic
• mcmas: A Model Checker for Multi-agent Systems
• A data symmetry reduction technique for temporal-epistemic logic
• Symbolic model checking for alternating projection temporal logic
• Where logic and agents meet
• Title not available (Why is that?)
• Verification of the TESLA protocol in MCMAS-X
• Rethinking epistemic logic with belief bases
• PRISM-games: a model checker for stochastic multi-player games
• Graded modalities in strategy logic
• Imperfect information in reactive modules games
• Practical verification of multi-agent systems against \textsc{Slk} specifications
• A first-order coalition logic for BDI-agents
• Automatic verification of competitive stochastic systems
• Reasoning about strategies: on the satisfiability problem
• State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems
• 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: MCMAS