MCMAS
From MaRDI portal
Software:21446
No author found.
Related Items (84)
Formalising privacy policies in social networks ⋮ Model-checking for resource-bounded ATL with production and consumption of resources ⋮ A counter abstraction technique for verifying properties of probabilistic swarm systems ⋮ Bounded situation calculus action theories ⋮ Unnamed Item ⋮ Automatic Verification of Competitive Stochastic Systems ⋮ Specification and Verification of Multi-Agent Systems ⋮ State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems ⋮ Symbolic Model Checking for Temporal-Epistemic Logic ⋮ An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking ⋮ Resilience, reliability, and coordination in autonomous multi-agent systems ⋮ Checking EMTLK properties of timed interpreted systems via bounded model checking ⋮ A computationally grounded, weighted doxastic logic ⋮ Progression and verification of situation calculus agents with bounded beliefs ⋮ Practical verification of multi-agent systems against \textsc{Slk} specifications ⋮ Graded modalities in strategy logic ⋮ Imperfect information in reactive modules games ⋮ Symbolic Model Checking for Dynamic Epistemic Logic ⋮ Automatic verification of concurrent stochastic systems ⋮ Modelling accuracy and trustworthiness of explaining agents ⋮ Minimal Proof Search for Modal Logic K Model Checking ⋮ Qualitative Approximate Behavior Composition ⋮ Verifying Systems of Resource-Bounded Agents ⋮ Symbolic Model Checking for Alternating Projection Temporal Logic ⋮ Synthesis and Verification of Uniform Strategies for Multi-agent Systems ⋮ Reasoning about equilibria in game-like concurrent systems ⋮ Approximating Perfect Recall when Model Checking Strategic Abilities: Theory and Applications ⋮ Unnamed Item ⋮ Verifying Real-Time Properties of Multi-agent Systems via SMT-Based Bounded Model Checking ⋮ PRISM-games: A Model Checker for Stochastic Multi-Player Games ⋮ Model-checking iterated games ⋮ Model checking interval temporal logics with regular expressions ⋮ Reasoning About Strategies ⋮ Cooperative concurrent games ⋮ Augmenting ATL with strategy contexts ⋮ To know or not to know: Epistemic approaches to security protocol verification ⋮ Reasoning about graded strategy quantifiers ⋮ Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Two-stage agent program verification ⋮ Unnamed Item ⋮ DEL-based epistemic planning: decidability and complexity ⋮ Automated temporal equilibrium analysis: verification and synthesis of multi-player games ⋮ A first-order coalition logic for BDI-agents ⋮ Populational announcement logic (PPAL) ⋮ Where logic and agents meet ⋮ Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol ⋮ Which fragments of the interval temporal logic HS are tractable in model checking? ⋮ Symbolic Model Checking Commitment Protocols Using Reduction ⋮ Automatic Data-Abstraction in Model Checking Multi-Agent Systems ⋮ Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic ⋮ Symbolic Model Checking the Knowledge in Herbivore Protocol ⋮ Strategic reasoning with a bounded number of resources: the quest for tractability ⋮ Strategies, model checking and branching-time properties in Maude ⋮ Dependences in strategy logic ⋮ Alternating-time temporal logics with linear past ⋮ Automatic verification of competitive stochastic systems ⋮ Combining fault injection and model checking to verify fault tolerance, recoverability, and diagnosability in multi-agent systems ⋮ Unnamed Item ⋮ Model Checking Knowledge and Linear Time: PSPACE Cases ⋮ Automatic verification of temporal-epistemic properties of cryptographic protocols ⋮ A Tool for the Automated Verification of Nash Equilibria in Concurrent Games ⋮ Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy ⋮ Model-checking graded computation-tree logic with finite path semantics ⋮ Verifying Time and Communication Costs of Rule-Based Reasoners ⋮ Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic ⋮ Natural strategic ability ⋮ Approximate verification of strategic abilities under imperfect information ⋮ Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments ⋮ Verified Synthesis of Knowledge-Based Programs in Finite Synchronous Environments ⋮ Rethinking epistemic logic with belief bases ⋮ Verifying Team Formation Protocols with Probabilistic Model Checking ⋮ A Data Symmetry Reduction Technique for Temporal-epistemic Logic ⋮ Verification and strategy synthesis for coalition announcement logic ⋮ A Three-Value Abstraction Technique for the Verification of Epistemic Properties in Multi-agent Systems ⋮ Multi-valued Verification of Strategic Ability ⋮ Verification of multi-agent systems with public actions against strategy logic ⋮ Using Agent JPF to Build Models for Other Model Checkers ⋮ mcmas: A Model Checker for Multi-agent Systems ⋮ Unnamed Item ⋮ Reasoning about memoryless strategies under partial observability and unconditional fairness constraints ⋮ Verification of heterogeneous multi-agent system using MCMAS ⋮ Parameterised verification for multi-agent systems
This page was built for software: MCMAS
