scholarly journals ProMoca: Probabilistic Modeling and Analysis of Agents in Commitment Protocols

2016 ◽  
Vol 57 ◽  
pp. 465-508 ◽  
Author(s):  
Akın Günay ◽  
Yang Liu ◽  
Jie Zhang

Social commitment protocols regulate interactions of agents in multiagent systems. Several methods have been developed to analyze properties of commitment protocols. However, analysis of an agent's behavior in a commitment protocol, which should take into account the agent's goals and beliefs, has received less attention. In this paper we present ProMoca framework to address this issue. Firstly, we develop an expressive formal language to model agents with respect to their commitments. Our language provides dedicated elements to define commitment protocols, and model agents in terms of their goals, behaviors, and beliefs. Furthermore, our language provides probabilistic and non-deterministic elements to model uncertainty in agents' beliefs. Secondly, we identify two essential properties of an agent with respect to a commitment protocol, namely compliance and goal satisfaction. We formalize these properties using a probabilistic variant of linear temporal logic. Thirdly, we adapt a probabilistic model checking algorithm to automatically analyze compliance and goal satisfaction properties. Finally, we present empirical results about efficiency and scalability of ProMoca.

BMC Genomics ◽  
2011 ◽  
Vol 12 (Suppl 4) ◽  
pp. S14 ◽  
Author(s):  
Mirlaine A Crepalde ◽  
Alessandra C Faria-Campos ◽  
Sérgio VA Campos

Author(s):  
Marta Kwiatkowska ◽  
Gethin Norman ◽  
David Parker

The design and control of autonomous systems that operate in uncertain or adversarial environments can be facilitated by formal modeling and analysis. Probabilistic model checking is a technique to automatically verify, for a given temporal logic specification, that a system model satisfies the specification, as well as to synthesize an optimal strategy for its control. This method has recently been extended to multiagent systems that exhibit competitive or cooperative behavior modeled via stochastic games and synthesis of equilibria strategies. In this article, we provide an overview of probabilistic model checking, focusing on models supported by the PRISM and PRISM-games model checkers. This overview includes fully observable and partially observable Markov decision processes, as well as turn-based and concurrent stochastic games, together with associated probabilistic temporal logics. We demonstrate the applicability of the framework through illustrative examples from autonomous systems. Finally, we highlight research challenges and suggest directions for future work in this area. Expected final online publication date for the Annual Review of Control, Robotics, and Autonomous Systems, Volume 5 is May 2022. Please see http://www.annualreviews.org/page/journal/pubdates for revised estimates.


Author(s):  
Christel Baier ◽  
Clemens Dubslaff ◽  
Sascha Klüppelholz ◽  
Marcus Daum ◽  
Joachim Klein ◽  
...  

Trains scheduling is an important problem in railway transportation. Many companies use fixed train timetabling to handle this problem. Train delays can affect the pre-defined timetables and postpone destination arrival times. Besides, delay propagation may affect other trains and degrade the performance of a railway network. An optimal timetable minimizes the total propagated delays in a network. In this paper, we propose a new approach to compute the expected propagated delays in a railway network. As the main contribution of the work, we use Discrete-time Markov chains to model a railway network with a fixed timetable and use probabilistic model checking to approximate the expected delays and the probability of reaching destinations with a desired delay. We use PRISM model checker to apply our approach for analyzing the impact of different train scheduling in double line tracks.


2016 ◽  
Vol 29 (2) ◽  
pp. 287-299 ◽  
Author(s):  
Shashank Pathak ◽  
Luca Pulina ◽  
Armando Tacchella

Sign in / Sign up

Export Citation Format

Share Document