Computation of the Reachability Graph of untimed Hybrid Petri nets

Authors

  • Estibaliz Fraca GISED (Grupo de Ingeniería de Sistemas Discretos) Instituto de Investigación en Ingeniería de Aragón (I3A) Universidad de Zaragoza
  • Jorge Júlvez GISED (Grupo de Ingeniería de Sistemas Discretos) Instituto de Investigación en Ingeniería de Aragón (I3A) Universidad de Zaragoza
  • Manuel Silva GISED (Grupo de Ingeniería de Sistemas Discretos) Instituto de Investigación en Ingeniería de Aragón (I3A) Universidad de Zaragoza,

DOI:

https://doi.org/10.26754/jji-i3a.201401739

Abstract

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.

Display downloads

Author Biography

  • Jorge Júlvez, GISED (Grupo de Ingeniería de Sistemas Discretos) Instituto de Investigación en Ingeniería de Aragón (I3A) Universidad de Zaragoza
    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.

Downloads

Issue

Vol. 1: Actas de la II Jornada de Jóvenes Investigadores del I3A - 16 de mayo de 2013

Section

Artículos (Tecnologías de la Información y las Comunicaciones)

How to Cite

Fraca, E., Júlvez, J., & Silva, M. (2014). Computation of the Reachability Graph of untimed Hybrid Petri nets. Jornada De Jóvenes Investigadores Del I3A, 1, 27-28. https://doi.org/10.26754/jji-i3a.201401739
Received 2017-04-04
Accepted 2017-04-04