Detail publikačního výsledku

Algorithms for Computing Coverability Graphs for Continuous Petri Nets

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

Originální název

Algorithms for Computing Coverability Graphs for Continuous Petri Nets

Anglický název

Algorithms for Computing Coverability Graphs for Continuous Petri Nets

Druh

Stať ve sborníku mimo WoS a Scopus

Originální abstrakt

The paper formalizes the concept of the coverability graphs for autonomous continuous Petri nets and introduces algorithms for their computing. Every algorithm is accompanied with an example. Algorithms for the bounded and unbounded continuous Petri nets are presented.

Anglický abstrakt

The paper formalizes the concept of the coverability graphs for autonomous continuous Petri nets and introduces algorithms for their computing. Every algorithm is accompanied with an example. Algorithms for the bounded and unbounded continuous Petri nets are presented.

Klíčová slova

Continuous Petri Net, Coverability Graph, Algorithm.

Klíčová slova v angličtině

Continuous Petri Net, Coverability Graph, Algorithm.

Autoři

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

Rok RIV

2010

Vydáno

25.08.2008

Nakladatel

EUROSIM-FRANCOSIM-ARGESIM

Místo

Le Havre

ISBN

978-90-77381-44-1

Kniha

Proceedings of 22th European Simulation and Modelling Conference ESM'2008

Edice

EUROSIS-ETI Publications

Strany od

489

Strany do

491

Strany počet

3

BibTex

@inproceedings{BUT33443,
  author="Petr {Novosad} and Milan {Češka}",
  title="Algorithms for Computing Coverability Graphs for Continuous Petri Nets",
  booktitle="Proceedings of 22th European Simulation and Modelling Conference ESM'2008",
  year="2008",
  series="EUROSIS-ETI Publications",
  pages="489--491",
  publisher="EUROSIM-FRANCOSIM-ARGESIM",
  address="Le Havre",
  isbn="978-90-77381-44-1"
}