A Hybrid Representation of Urban Traffic Networks using Multi-agent Systems and Petri Nets

2019 ◽  
Author(s):  
M. Flores-Geronimo ◽  
E.G. Hernandez-Martinez ◽  
E.D. Ferreira-Vazquez ◽  
J.J. Flores-Godoy ◽  
G. Fernandez-Anaya
Keyword(s):  
Petri Nets ◽  
Urban Traffic ◽  
Traffic Networks ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent ◽  
Urban Traffic Networks

Modular Modelling for Urban Traffic Networks based on Multi-Agent Systems and Petri Nets

2018 ◽  
Author(s):  
M. Flores-Geronimo ◽  
E.G. Hernandez-Martinez ◽  
E.D. Ferreira-Vazquez ◽  
J.J. Flores-Godoy ◽  
G. Fernandez-Anaya
Keyword(s):  
Petri Nets ◽  
Urban Traffic ◽  
Traffic Networks ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent ◽  
Modular Modelling ◽  
Urban Traffic Networks

Modeling and Analysis of Multi-agent Systems using Petri Nets

2009 ◽  
Vol 4 (10) ◽  
Author(s):  
Alan A. Desrochers ◽  
Jose R. Celaya ◽  
Robert J. Graves
Keyword(s):  
Petri Nets ◽  
Multi Agent Systems ◽  
Modeling And Analysis ◽  
Agent Systems ◽  
Multi Agent

scholarly journals A New Formalism for Modeling a Multi Agent Systems: Agent Petri Nets

2010 ◽  
Vol 03 (12) ◽  
pp. 1118-1124 ◽  
Author(s):  
Borhen Marzougui ◽  
Khaled Hassine ◽  
Kamel Barkaoui
Keyword(s):  
Petri Nets ◽  
Multi Agent Systems ◽  
New Formalism ◽  
Agent Systems ◽  
Multi Agent

scholarly journals Branching Processes of Conservative Nested Petri Nets

10.29007/6ntb ◽  
2018 ◽  
Author(s):  
Daniil Frumin ◽  
Irina Lomazova
Keyword(s):  
Petri Nets ◽  
Branching Processes ◽  
Fundamental Property ◽  
Dynamic Structure ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Autonomous Behavior ◽  
Multi Agent ◽  
Multi Level ◽  
Natural Way

Nested Petri nets (NP-nets) is an extension of the Petri nets formalism within the “nets-within-nets” approach, when tokens in a marking are themselves Petri nets which have autonomous behavior and synchronize with the system net. The formalism of NP- nets allows modeling multi-level multi-agent systems with dynamic structure in a natural way. In this paper we define branching processes and unfoldings for conservative NP- nets, i.e. for NP-nets with a persistent set of agents. We prove that NP-nets unfoldings satisfy the fundamental property of unfoldings, and thus can be used for verification of conservative NP-nets in line with classical unfolding methods.

Sign in / Sign up

Export Citation Format

Share Document