Detail publikace

Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets

NOVOSAD, P. ČEŠKA, M.

Originální název

Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

Originální abstrakt

The paper describes a technique for computing algorithm for constructing unfoldings of unbounded hybrid Petri nets. 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.

Klíčová slova

Hybrid Petri Nets, unfoldings, complete finite prefix.

Autoři

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

Rok RIV

2013

Vydáno

16. 5. 2013

Nakladatel

Springer Verlag

Místo

Berín

ISBN

978-3-642-53855-1

Kniha

Computer Aided System Theory -EUROCAST 2013 - revised selected papers

Edice

Lecture Notes in Computer Science

Strany od

428

Strany do

435

Strany počet

8

BibTex

@inproceedings{BUT103511,
  author="Petr {Novosad} and Milan {Češka}",
  title="Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets",
  booktitle="Computer Aided System Theory -EUROCAST 2013 - revised selected papers",
  year="2013",
  series="Lecture Notes in Computer Science",
  pages="428--435",
  publisher="Springer Verlag",
  address="Berín",
  isbn="978-3-642-53855-1"
}