Detail publikačního výsledku

Algorithms for Computing Coverability Graphs for Continuous Petri Nets

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

Original Title

Algorithms for Computing Coverability Graphs for Continuous Petri Nets

English Title

Algorithms for Computing Coverability Graphs for Continuous Petri Nets

Type

Paper in proceedings outside WoS and Scopus

Original Abstract

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.

English abstract

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.

Keywords

Continuous Petri Net, Coverability Graph, Algorithm.

Key words in English

Continuous Petri Net, Coverability Graph, Algorithm.

Authors

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

RIV year

2010

Released

25.08.2008

Publisher

EUROSIM-FRANCOSIM-ARGESIM

Location

Le Havre

ISBN

978-90-77381-44-1

Book

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

Edition

EUROSIS-ETI Publications

Pages from

489

Pages to

491

Pages count

3

Full text in the Digital Library

http://hdl.handle.net/

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