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 (only showing first 100 items - show all)

• Parameterised verification for multi-agent systems
• Augmenting ATL with strategy contexts
• 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
• Interval temporal logic model checking: the border between good and bad HS fragments
• Model checking interval temporal logics with regular expressions
• 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
• Automatic verification of temporal-epistemic properties of cryptographic protocols
• 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
• Model Checking Knowledge and Linear Time: PSPACE Cases
• CacBDD
• EVE
• DDVerify
• 3APL
• mccogwed
• jMocha
• MCMAS-SLK
• CANA
• AJPF
• Gwendolen
• KBPs
• DEMO
• HasCacBDD
• SMCDEL
• CTLSAT
• EAGLE
• Hintikka's world
• Mr. Waffles
• PyBoolNet
• To know or not to know: Epistemic approaches to security protocol verification
• EPFL
• 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
• Automatic verification of competitive stochastic systems
• Symbolic model checking for temporal-epistemic logic
• 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
• 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
• Undecidable cases of model checking probabilistic temporal-epistemic logic (extended abstract)
• Title not available (Why is that?)
• Dependences in strategy logic
• Populational announcement logic (PPAL)
• 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

This page was built for software: MCMAS