Verifying Team Formation Protocols with Probabilistic Model Checking

DOI10.1007/978-3-642-22359-4_14zbMath1348.68255OpenAlexW2166857474MaRDI QIDQ3092303

No author found.

Publication date: 16 September 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22359-4_14

Mathematics Subject Classification ID

Applications of game theory (91A80) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Stochastic games, stochastic differential games (91A15) Markov and semi-Markov decision processes (90C40) Specification and verification (program logics, model checking, etc.) (68Q60) Agent technology and artificial intelligence (68T42) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (5)

A counter abstraction technique for verifying properties of probabilistic swarm systems ⋮ Simple Strategies in Multi-Objective MDPs ⋮ Value iteration for simple stochastic games: stopping criterion and learning algorithm ⋮ Unnamed Item ⋮ Automatic verification of competitive stochastic systems

Uses Software

• PRISM
• MCMAS

Cites Work

• Reasoning about coalitional games
• The complexity of stochastic games
• Methods for task allocation via agent coalition formation
• A logic for reasoning about time and reliability
• Quantitative Multi-objective Verification for Probabilistic Systems
• Stochastic Model Checking
• Alternating-time temporal logic
• Strategy Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Verifying Team Formation Protocols with Probabilistic Model Checking