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 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.

Keywords

Hybrid Petri Nets, unfoldings, complete finite prefix.

Authors

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

RIV year

2013

Released

16. 5. 2013

Publisher

Springer Verlag

Location

Berín

ISBN

978-3-642-53855-1

Book

Computer Aided System Theory -EUROCAST 2013 - revised selected papers

Edition

Lecture Notes in Computer Science

Pages from

428

Pages to

435

Pages count

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"
}