This HTML5 document contains 44 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n10http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n19http://localhost/temp/predkladatel/
n16http://purl.org/net/nknouf/ns/bibtex#
n9http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/resource/domain/vavai/projekt/
n22http://linked.opendata.cz/ontology/domain/vavai/
n17http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F08%3APU78085%21RIV10-MSM-26230___/
n12https://schema.org/
n11http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n18http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F08%3APU78085%21RIV10-MSM-26230___
rdf:type
skos:Concept n22:Vysledek
dcterms:description
A useful method for Petri nets analysis is based on a coverability tree or a coverability graph that represents a state space of a system. The paper formalizes the concept of the coverability graphs for autonomous continuous Petri nets and introduces algorithms for their computing. The algorithms for the bounded and unbounded continuous Petri nets are presented. Every algorithm is accompanied with an example. The new concept of a signed continuous macro-marking for the bounded continuous Petri nets is described. A useful method for Petri nets analysis is based on a coverability tree or a coverability graph that represents a state space of a system. The paper formalizes the concept of the coverability graphs for autonomous continuous Petri nets and introduces algorithms for their computing. The algorithms for the bounded and unbounded continuous Petri nets are presented. Every algorithm is accompanied with an example. The new concept of a signed continuous macro-marking for the bounded continuous Petri nets is described.
dcterms:title
Algorithms for Computing Coverability Graphs for Continuous Petri Nets Algorithms for Computing Coverability Graphs for Continuous Petri Nets
skos:prefLabel
Algorithms for Computing Coverability Graphs for Continuous Petri Nets Algorithms for Computing Coverability Graphs for Continuous Petri Nets
skos:notation
RIV/00216305:26230/08:PU78085!RIV10-MSM-26230___
n4:aktivita
n8:Z n8:P
n4:aktivity
P(GA102/07/0322), P(GD102/05/H050), Z(MSM0021630528)
n4:dodaniDat
n18:2010
n4:domaciTvurceVysledku
n9:5137799 n9:2579316
n4:druhVysledku
n14:D
n4:duvernostUdaju
n6:S
n4:entitaPredkladatele
n17:predkladatel
n4:idSjednocenehoVysledku
355395
n4:idVysledku
RIV/00216305:26230/08:PU78085
n4:jazykVysledku
n13:eng
n4:klicovaSlova
<p align=left>Continuous Petri Net, Coverability Graph, Algorithm.
n4:klicoveSlovo
n5:Algorithm. n5:%3Cp%20align%3Dleft%3EContinuous%20Petri%20Net n5:Coverability%20Graph
n4:kontrolniKodProRIV
[3AC14AE9B061]
n4:mistoKonaniAkce
Universite du Havre, Le Havre, France
n4:mistoVydani
Le Havre
n4:nazevZdroje
Proceedings of 22th European Simulation and Modelling Conference ESM'2008
n4:obor
n20:JC
n4:pocetDomacichTvurcuVysledku
2
n4:pocetTvurcuVysledku
2
n4:projekt
n7:GA102%2F07%2F0322 n7:GD102%2F05%2FH050
n4:rokUplatneniVysledku
n18:2008
n4:tvurceVysledku
Novosad, Petr Češka, Milan
n4:typAkce
n10:EUR
n4:zahajeniAkce
2008-08-27+02:00
n4:zamer
n11:MSM0021630528
s:numberOfPages
3
n16:hasPublisher
EUROSIM-FRANCOSIM-ARGESIM
n12:isbn
978-90-77381-44-1
n19:organizacniJednotka
26230