Detail publikace

Algorithms for Computing Coverability Graphs for Continuous Petri Nets

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

Jazyk

en

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.

BibTex


@inproceedings{BUT33443,
  author="Petr {Novosad} and Milan {Češka}",
  title="Algorithms for Computing Coverability Graphs for Continuous Petri Nets",
  annote="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.",
  address="EUROSIM-FRANCOSIM-ARGESIM",
  booktitle="Proceedings of 22th European Simulation and Modelling Conference ESM'2008",
  chapter="33443",
  edition="EUROSIS-ETI Publications",
  howpublished="print",
  institution="EUROSIM-FRANCOSIM-ARGESIM",
  year="2008",
  month="august",
  pages="489--491",
  publisher="EUROSIM-FRANCOSIM-ARGESIM",
  type="conference paper"
}