MCMAS

swMATH9463MaRDI QIDQ21446FDOQ21446

Author name not available (Why is that?)

Cited In (84)

• Two-stage agent program verification
• Verified Synthesis of Knowledge-Based Programs in Finite Synchronous Environments
• Minimal Proof Search for Modal Logic K Model Checking
• Qualitative Approximate Behavior Composition
• Verification of heterogeneous multi-agent system using MCMAS
• Multi-valued Verification of Strategic Ability
• Title not available (Why is that?)
• A Three-Value Abstraction Technique for the Verification of Epistemic Properties in 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
• Symbolic Model Checking the Knowledge in Herbivore Protocol
• Verifying Real-Time Properties of Multi-agent Systems via SMT-Based Bounded Model Checking
• Using Agent JPF to Build Models for Other Model Checkers
• Synthesis and Verification of Uniform Strategies for Multi-agent Systems
• 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
• Reasoning About Strategies
• Populational announcement logic (PPAL)
• Augmenting ATL with strategy contexts
• Automatic Verification of Competitive Stochastic Systems
• Verifying Systems of Resource-Bounded Agents
• Symbolic Model Checking for Temporal-Epistemic Logic
• Which fragments of the interval temporal logic HS are tractable in model checking?
• Model-checking graded computation-tree logic with finite path semantics
• Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol
• Reasoning about memoryless strategies under partial observability and unconditional fairness constraints
• Verifying Time and Communication Costs of Rule-Based Reasoners
• Title not available (Why is that?)
• A Tool for the Automated Verification of Nash Equilibria in Concurrent Games
• Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives
• Symbolic Model Checking for Alternating Projection Temporal Logic
• 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
• A Data Symmetry Reduction Technique for Temporal-epistemic Logic
• Approximating Perfect Recall when Model Checking Strategic Abilities: Theory and Applications
• Alternating-time temporal logics with linear past
• Automatic Data-Abstraction in Model Checking Multi-Agent Systems
• 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
• Verifying Team Formation Protocols with Probabilistic Model Checking
• Automatic verification of concurrent stochastic systems
• Modelling accuracy and trustworthiness of explaining agents
• Automated temporal equilibrium analysis: verification and synthesis of multi-player games
• Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments
• DEL-based epistemic planning: decidability and complexity
• Automatic verification of temporal-epistemic properties of cryptographic protocols
• Natural strategic ability
• Title not available (Why is that?)
• Model Checking Knowledge and Linear Time: PSPACE Cases
• PRISM-games: A Model Checker for Stochastic Multi-Player Games
• Title not available (Why is that?)
• 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
• Verification and strategy synthesis for coalition announcement logic
• Automatic verification of competitive stochastic systems
• Symbolic Model Checking for Dynamic Epistemic Logic
• mcmas: A Model Checker for Multi-agent Systems
• Where logic and agents meet
• Title not available (Why is that?)
• Rethinking epistemic logic with belief bases
• 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
• State of the Art in Logics for Verification of Resource-Bounded 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