Dynamic Exploration of Multi-agent Systems with Periodic Timed Tasks

2020 ◽  
Author(s):  
Johan Arcile ◽  
Raymond Devillers ◽  
Hanna Klaudel
Keyword(s):  
State Space ◽  
Petri Net ◽  
Timed Automata ◽  
Autonomous Vehicle ◽  
Computation Time ◽  
The State ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Vehicle Systems ◽  
Multi Agent

We formalise and study multi-agent timed models MAPTs (Multi-Agent with Periodic timed Tasks), where each agent is associated with a regular timed schema upon which all possible actions of the agent rely. MAPTs allow for an accelerated semantics and a layered structure of the state space, so that it is possible to explore the latter dynamically and use heuristics to greatly reduce the computation time needed to address reachability problems. We use an available tool for the Petri net implementation of MAPTs, to explore the state space of autonomous vehicle systems. Then, we compare this exploration with timed automata-based approaches in terms of expressiveness of available queries and computation time.

scholarly journals Representing Conversations for Scalable Overhearing

2006 ◽  
Vol 25 ◽  
pp. 349-387 ◽  
Author(s):  
G. Gutnik ◽  
G. A. Kaminka
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Academic Community ◽  
Important Task ◽  
Colored Petri Nets ◽  
Colored Petri Net ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Interesting Approach ◽  
Multi Agent

Open distributed multi-agent systems are gaining interest in the academic community and in industry. In such open settings, agents are often coordinated using standardized agent conversation protocols. The representation of such protocols (for analysis, validation, monitoring, etc) is an important aspect of multi-agent applications. Recently, Petri nets have been shown to be an interesting approach to such representation, and radically different approaches using Petri nets have been proposed. However, their relative strengths and weaknesses have not been examined. Moreover, their scalability and suitability for different tasks have not been addressed. This paper addresses both these challenges. First, we analyze existing Petri net representations in terms of their scalability and appropriateness for overhearing, an important task in monitoring open multi-agent systems. Then, building on the insights gained, we introduce a novel representation using Colored Petri nets that explicitly represent legal joint conversation states and messages. This representation approach offers significant improvements in scalability and is particularly suitable for overhearing. Furthermore, we show that this new representation offers a comprehensive coverage of all conversation features of FIPA conversation standards. We also present a procedure for transforming AUML conversation protocol diagrams (a standard human-readable representation), to our Colored Petri net representation.

Synchronized Petri Net: A Formal Specification Model for Multi Agent Systems

2013 ◽  
Vol 8 (3) ◽  
Author(s):  
Sofia Kouah ◽  
Djamel Eddine Saïdouni ◽  
Jean Michel Ilié
Keyword(s):  
Petri Net ◽  
Formal Specification ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent

Hierarchical Multi-Agent Plans Using Model-Based Petri Net

2013 ◽  
Vol 5 (2) ◽  
pp. 1-30 ◽  
Author(s):  
Said Brahimi ◽  
Ramdane Maamri ◽  
Zaidi Sahnoun
Keyword(s):  
Petri Net ◽  
Dynamic Environments ◽  
Multi Agent Systems ◽  
Trade Off ◽  
Synchronization Mechanism ◽  
Agent Systems ◽  
Model Based ◽  
Proposed Model ◽  
Multi Agent ◽  
Abstraction Levels

Agents evolving in complex and dynamic multi-agent systems need to plan their tasks and to adapt their behavior in order to react to unpredictable events. Therefore they must have plans that remain subject to continual updating, even during its execution. Although this property is important in dynamic environments, it is difficult to have a trade-off between the convergence towards the goal to be reached and the reaction to unanticipated events. To cope with this issue, it is needed to have a model allowing to represent plans less sensitive to execution contexts, and to support flexible execution. This paper aims to provide an adequate plan representation, by taking advantage of hierarchical plans and extensions to Petri net. The authors extend the Petri net to take into account the different abstraction levels of plans and the resources required by tasks. To cope with the interdependence of tasks, the authors include in the model, a synchronization mechanism between concurrent transitions. The proposed model can be used to reason on abstract levels of plans and to analyze, in a dynamic way, situations in which the execution of the plan can be performed in any ways, in some ways, or cannot be performed.

Sign in / Sign up

Export Citation Format

Share Document