Publication detail
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
conference paper
Language
en
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.
RIV year
2008
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
Edition number
NEUVEDEN
Pages from
489
Pages to
491
Pages count
3
Documents
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"
}