Detail publikace

Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets

Originální název

Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets

Anglický název

Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets

Jazyk

en

Originální abstrakt

The paper describes a technique for computing algorithm for constructing unfoldings of unbounded hybrid Petri nets. The unfolding is a useful partial-order method for analysis and verification of the Petri net properties. The motivation for introducing unfoldings for hybrid Petri nets is that this technique can cope well with the so-called state space explosion problem especially for the Petri nets with a lot of concurrency. This contribution extends our previous work and formalizes the concept of the unfoldings for autonomous hybrid Petri nets, introduces an algorithm for their computing and shows new results. The developed algorithm constructs the finite and complete prefix of the unfolding of the unbounded hybrid Petri net. In the future we plan to develop algorithms for analysing properties of the hybrid Petri nets from the unfolding.

Anglický abstrakt

The paper describes a technique for computing algorithm for constructing unfoldings of unbounded hybrid Petri nets. The unfolding is a useful partial-order method for analysis and verification of the Petri net properties. The motivation for introducing unfoldings for hybrid Petri nets is that this technique can cope well with the so-called state space explosion problem especially for the Petri nets with a lot of concurrency. This contribution extends our previous work and formalizes the concept of the unfoldings for autonomous hybrid Petri nets, introduces an algorithm for their computing and shows new results. The developed algorithm constructs the finite and complete prefix of the unfolding of the unbounded hybrid Petri net. In the future we plan to develop algorithms for analysing properties of the hybrid Petri nets from the unfolding.

BibTex


@inproceedings{BUT103432,
  author="Petr {Novosad} and Milan {Češka}",
  title="Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets",
  annote="The paper describes a technique for computing algorithm for constructing
unfoldings of unbounded hybrid Petri nets. The unfolding is a useful
partial-order method for analysis and verification of the Petri net properties.
The motivation for introducing unfoldings for hybrid Petri nets is that this
technique can cope well with the so-called state space explosion problem
especially for the Petri nets with a lot of concurrency. This contribution
extends our previous work and formalizes the concept of the unfoldings for
autonomous hybrid Petri nets, introduces an algorithm for their computing and
shows new results. The developed algorithm constructs the finite and complete
prefix of the unfolding of the unbounded hybrid Petri net. In the future we plan
to develop algorithms for analysing properties of the hybrid Petri nets from the
unfolding.",
  address="The Universidad de Las Palmas de Gran Canaria",
  booktitle="Proc. of Computer Aided System Theory 2013",
  chapter="103432",
  edition="NEUVEDEN",
  howpublished="print",
  institution="The Universidad de Las Palmas de Gran Canaria",
  year="2013",
  month="february",
  pages="244--245",
  publisher="The Universidad de Las Palmas de Gran Canaria",
  type="conference paper"
}