scholarly journals Computation of the Reachability Graph of untimed Hybrid Petri nets

1970 ◽  
Vol 1 ◽  
pp. 27-28
Author(s):  
Estibaliz Fraca ◽  
Jorge Júlvez ◽  
Manuel Silva

Untimed hybrid Petri nets are a formalism for the analysis of dynamical systems, which combines discrete and continuous behaviour. The study of its reachability is interesting for analysis purposes, such as the study of behavioural properties. A method to compute its reachability graph and reachability space is proposed here.

2016 ◽  
Vol 105 ◽  
pp. 22-50 ◽  
Author(s):  
Marco Gribaudo ◽  
Anne Remke

SIMULATION ◽  
2017 ◽  
Vol 94 (10) ◽  
pp. 887-909
Author(s):  
Berenice Gudiño-Mendoza ◽  
Ernesto López-Mellado ◽  
Enrique Aguayo-Lara

A novel scheme for simulating networked agent systems is presented. In this approach, the system is composed of identical communicating agents, which have multi-role capabilities in such a manner that they can perform diverse tasks, according to a given execution context. The agent’s behavior is modeled using a timed hybrid Petri net ( THPN) whose evolution, valid for all the agents, is computed off-line using Matlab. The agents are interconnected and simulated in a Java platform using the JADE middle-ware.


Sign in / Sign up

Export Citation Format

Share Document