Publication detail

Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets

NOVOSAD, P. ČEŠKA, M.

Original Title

Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets

Type

article in a collection out of WoS and Scopus

Language

English

Original Abstract

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.

Keywords

Hybrid Petri Nets, unfoldings, complete finite prefix.

Authors

NOVOSAD, P.; ČEŠKA, M.

RIV year

2013

Released

1. 2. 2013

Publisher

The Universidad de Las Palmas de Gran Canaria

Location

Universidad de Las Palmas de Gran Canaria

ISBN

84-695-6971-6

Book

Proc. of Computer Aided System Theory 2013

Pages from

244

Pages to

245

Pages count

2

BibTex

@inproceedings{BUT103432,
  author="Petr {Novosad} and Milan {Češka}",
  title="Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets",
  booktitle="Proc. of Computer Aided System Theory 2013",
  year="2013",
  pages="244--245",
  publisher="The Universidad de Las Palmas de Gran Canaria",
  address="Universidad de Las Palmas de Gran Canaria",
  isbn="84-695-6971-6"
}