Detail publikace

Hybrid Petri Nets State Space Representation Using Coverability Graphs and Unfoldings

NOVOSAD, P. ČEŠKA, M.

Originální název

Hybrid Petri Nets State Space Representation Using Coverability Graphs and Unfoldings

Anglický název

Hybrid Petri Nets State Space Representation Using Coverability Graphs and Unfoldings

Jazyk

en

Originální abstrakt

This technical report deals with continuous and hybrid Petri nets state space representation using coverability graphs and unfoldings. The coverability graph, resp. unfolding are methods for Petri nets analysis that can represent an infinite state space of an unbounded Petri net with finite graph, resp. net. These techniques can cope well with the so-called state space explosion problem. Formalizations of the representations are presented together with algorithms for their computing and typical examples.

Anglický abstrakt

This technical report deals with continuous and hybrid Petri nets state space representation using coverability graphs and unfoldings. The coverability graph, resp. unfolding are methods for Petri nets analysis that can represent an infinite state space of an unbounded Petri net with finite graph, resp. net. These techniques can cope well with the so-called state space explosion problem. Formalizations of the representations are presented together with algorithms for their computing and typical examples.

Dokumenty

BibTex


@techreport{BUT169206,
  author="Petr {Novosad} and Milan {Češka}",
  title="Hybrid Petri Nets State Space Representation Using Coverability Graphs and Unfoldings",
  annote="This technical report deals with continuous and hybrid Petri nets state space
representation using coverability graphs and unfoldings. The coverability graph,
resp. unfolding are methods for Petri nets analysis that can represent an
infinite state space of an unbounded Petri net with finite graph, resp. net.
These techniques can cope well with the so-called state space explosion problem.
Formalizations of the representations are presented together with algorithms for
their computing and typical examples.",
  address="Faculty of Information Technology BUT",
  chapter="169206",
  edition="NEUVEDEN",
  howpublished="print",
  institution="Faculty of Information Technology BUT",
  year="2015",
  month="june",
  pages="0--0",
  publisher="Faculty of Information Technology BUT",
  type="report"
}