MCMAS
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic
- State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems
- Automatic data-abstraction in model checking multi-agent systems
- Parameterised verification for multi-agent systems
- Dependences in strategy logic
- scientific article; zbMATH DE number 7445170 (Why is no real title available?)
- Undecidable cases of model checking probabilistic temporal-epistemic logic (extended abstract)
- Populational announcement logic (PPAL)
- Augmenting ATL with strategy contexts
- Two-stage agent program verification
- 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
- Verifying team formation protocols with probabilistic model checking
- Reasoning about memoryless strategies under partial observability and unconditional fairness constraints
- Verifying Time and Communication Costs of Rule-Based Reasoners
- 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
- 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
- Minimal Proof Search for Modal Logic K Model Checking
- A counter abstraction technique for verifying properties of probabilistic swarm systems
- Interval temporal logic model checking: the border between good and bad HS fragments
- Alternating-time temporal logics with linear past
- Approximating Perfect Recall when Model Checking Strategic Abilities: Theory and Applications
- Verifying real-time properties of multi-agent systems via SMT-based bounded model checking
- An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
- Model checking interval temporal logics with regular expressions
- Verification of heterogeneous multi-agent system using MCMAS
- scientific article; zbMATH DE number 7533366 (Why is no real title available?)
- 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
- A three-value abstraction technique for the verification of epistemic properties in multi-agent systems
- 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
- Alpaga
- GAVS
- PRISM
- LDYIS
- ConGolog
- GOLOG
- VerICS
- TAPS
- IMPACT
- MCMAS-X
- KARO
- NuSMV
- CUDD
- Petruchio
- AgentSpeak
- Jason
- simpleAPL
- Gambit
- LTSmin
- BDDNOW
- MCK
- GIST
- Verics
- PyNuSMV
- DPF
- MOCHA
- PRALINE
- PRISM-games
- ORME
- IndiGolog
- CacBDD
- EVE
- DDVerify
- 3APL
- mccogwed
- jMocha
- MCMAS-SLK
- CANA
- AJPF
- Gwendolen
- KBPs
- DEMO
- HasCacBDD
- SMCDEL
- CTLSAT
- EAGLE
- Hintikka's world
- Mr. Waffles
- PyBoolNet
- EPFL
- Symbolic model checking the knowledge in Herbivore protocol
- Natural strategic ability
- Automatic verification of temporal-epistemic properties of cryptographic protocols
- Using agent JPF to build models for other model checkers
- Model checking the logic of Allen's relations \textit{Meets} and \textit{Started-by} is \(\mathbf{P}^{\mathbf{NP}}\)-complete
- Model Checking Knowledge and Linear Time: PSPACE Cases
- To know or not to know: Epistemic approaches to security protocol verification
- Synthesis and verification of uniform strategies for multi-agent systems
This page was built for software: MCMAS
