Result Details

Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets

NOVOSAD, P.; ČEŠKA, M. Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets. Computer Aided System Theory -EUROCAST 2013 - revised selected papers. Lecture Notes in Computer Science. Berín: Springer Verlag, 2013. p. 428-435. ISBN: 978-3-642-53855-1.
Type
conference paper
Language
English
Authors
Novosad Petr, Ing.
Češka Milan, prof. RNDr., CSc., DITS (FIT)
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.

Annotation

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.

Published
2013
Pages
428–435
Proceedings
Computer Aided System Theory -EUROCAST 2013 - revised selected papers
Series
Lecture Notes in Computer Science
Conference
Fourteenth International Conference On Computer Aided Systems Theory
ISBN
978-3-642-53855-1
Publisher
Springer Verlag
Place
Berín
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"
}
Projects
Advanced Methods of Automatic Verification of Parametric and Infinite-State Systems, GACR, Postdoktorandské granty, GP102/03/D211, start: 2003-09-01, end: 2006-09-01, completed
Centrum excelence IT4Innovations, MŠMT, Operační program Výzkum a vývoj pro inovace, ED1.1.00/02.0070, start: 2011-01-01, end: 2015-12-31, completed
Security-Oriented Research in Information Technology, MŠMT, Institucionální prostředky SR ČR (např. VZ, VC), MSM0021630528, start: 2007-01-01, end: 2013-12-31, running
Departments
Back to top