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

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

Namespace Prefixes

PrefixIRI
n18http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n22http://purl.org/net/nknouf/ns/bibtex#
n21http://localhost/temp/predkladatel/
n17http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/resource/domain/vavai/projekt/
n16http://linked.opendata.cz/resource/domain/vavai/subjekt/
n15http://linked.opendata.cz/ontology/domain/vavai/
n9https://schema.org/
n8http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://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#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n14http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n23http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n19http://reference.data.gov.uk/id/gregorian-year/
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F13%3APU106292%21RIV14-GA0-26230___/

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F13%3APU106292%21RIV14-GA0-26230___
rdf:type
skos:Concept n15:Vysledek
dcterms:description
The paper describes a technique for computing algorithm for constructing unfoldings of unbounded hybrid Petri nets. The unfolding is a useful partial-order method for analysis and verification of the Petri net properties. The motivation for introducing unfoldings for hybrid Petri nets is that this technique can cope well with the so-called state space explosion problem especially for the Petri nets with a lot of concurrency. This contribution extends our previous work and formalizes the concept of the unfoldings for autonomous hybrid Petri nets, introduces an algorithm for their computing and shows new results. The developed algorithm constructs the finite and complete prefix of the unfolding of the unbounded hybrid Petri net. In the future we plan to develop algorithms for analysing properties of the hybrid Petri nets from the unfolding. The paper describes a technique for computing algorithm for constructing unfoldings of unbounded hybrid Petri nets. The unfolding is a useful partial-order method for analysis and verification of the Petri net properties. The motivation for introducing unfoldings for hybrid Petri nets is that this technique can cope well with the so-called state space explosion problem especially for the Petri nets with a lot of concurrency. This contribution extends our previous work and formalizes the concept of the unfoldings for autonomous hybrid Petri nets, introduces an algorithm for their computing and shows new results. The developed algorithm constructs the finite and complete prefix of the unfolding of the unbounded hybrid Petri net. In the future we plan to develop algorithms for analysing properties of the hybrid Petri nets from the unfolding.
dcterms:title
Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets
skos:prefLabel
Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets
skos:notation
RIV/00216305:26230/13:PU106292!RIV14-GA0-26230___
n15:predkladatel
n16:orjk%3A26230
n3:aktivita
n14:Z n14:P
n3:aktivity
P(ED1.1.00/02.0070), P(GP102/03/D211), Z(MSM0021630528)
n3:dodaniDat
n19:2014
n3:domaciTvurceVysledku
n17:5137799 n17:2579316
n3:druhVysledku
n5:D
n3:duvernostUdaju
n20:S
n3:entitaPredkladatele
n11:predkladatel
n3:idSjednocenehoVysledku
60067
n3:idVysledku
RIV/00216305:26230/13:PU106292
n3:jazykVysledku
n7:eng
n3:klicovaSlova
Hybrid Petri Nets, unfoldings, complete finite prefix.
n3:klicoveSlovo
n4:Hybrid%20Petri%20Nets n4:unfoldings n4:complete%20finite%20prefix.
n3:kontrolniKodProRIV
[40FD88351677]
n3:mistoKonaniAkce
Las Palmas de Gran Canaria
n3:mistoVydani
Universidad de Las Palmas de Gran Canaria
n3:nazevZdroje
Proc. of Computer Aided System Theory 2013
n3:obor
n23:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n12:ED1.1.00%2F02.0070 n12:GP102%2F03%2FD211
n3:rokUplatneniVysledku
n19:2013
n3:tvurceVysledku
Češka, Milan Novosad, Petr
n3:typAkce
n18:WRD
n3:zahajeniAkce
2013-02-10+01:00
n3:zamer
n8:MSM0021630528
s:numberOfPages
2
n22:hasPublisher
The Universidad de Las Palmas de Gran Canaria
n9:isbn
84-695-6971-6
n21:organizacniJednotka
26230