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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n10http://localhost/temp/predkladatel/
n19http://linked.opendata.cz/resource/domain/vavai/projekt/
n18http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/ontology/domain/vavai/
n13http://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#
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F08%3APU76683%21RIV10-MSM-26230___/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F08%3APU76683%21RIV10-MSM-26230___
rdf:type
n7:Vysledek skos:Concept
dcterms:description
We consider the problem of parametric verification over a class of systems of processes competing for access to shared resources. We suppose the access to the resources to be controlled according to a FIFO-based policy with a possibility of distinguishing low-priority and high-priority resource requests. We propose a model of the concerned systems based on extended automata with queues. Over this model, we address verification of properties expressed in LTL\X enriched with global process quantification and interpreted on finite as well as fair behaviours of the given systems. In addition, we examine parametric verification of process deadlockability too. By reducing the parametric verification problems to finite-state model checking, we establish several decidability results for different classes of the considered properties and systems (including the special case of systems with the pure FIFO resource management). Moreover, we show that parametric verification against formulae with local process quan We consider the problem of parametric verification over a class of systems of processes competing for access to shared resources. We suppose the access to the resources to be controlled according to a FIFO-based policy with a possibility of distinguishing low-priority and high-priority resource requests. We propose a model of the concerned systems based on extended automata with queues. Over this model, we address verification of properties expressed in LTL\X enriched with global process quantification and interpreted on finite as well as fair behaviours of the given systems. In addition, we examine parametric verification of process deadlockability too. By reducing the parametric verification problems to finite-state model checking, we establish several decidability results for different classes of the considered properties and systems (including the special case of systems with the pure FIFO resource management). Moreover, we show that parametric verification against formulae with local process quan
dcterms:title
Verification of parametric concurrent systems with prioritised FIFO resource management Verification of parametric concurrent systems with prioritised FIFO resource management
skos:prefLabel
Verification of parametric concurrent systems with prioritised FIFO resource management Verification of parametric concurrent systems with prioritised FIFO resource management
skos:notation
RIV/00216305:26230/08:PU76683!RIV10-MSM-26230___
n3:aktivita
n17:Z n17:P
n3:aktivity
P(GA102/07/0322), Z(MSM0021630528)
n3:cisloPeriodika
2
n3:dodaniDat
n9:2010
n3:domaciTvurceVysledku
n18:9761985
n3:druhVysledku
n5:J
n3:duvernostUdaju
n14:S
n3:entitaPredkladatele
n11:predkladatel
n3:idSjednocenehoVysledku
402537
n3:idVysledku
RIV/00216305:26230/08:PU76683
n3:jazykVysledku
n8:eng
n3:klicovaSlova
formal verification, parameterized concurrent systems, cut-offs
n3:klicoveSlovo
n4:parameterized%20concurrent%20systems n4:formal%20verification n4:cut-offs
n3:kodStatuVydavatele
US - Spojené státy americké
n3:kontrolniKodProRIV
[1F7FC27C4099]
n3:nazevZdroje
FORMAL METHODS IN SYSTEM DESIGN
n3:obor
n16:JC
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
3
n3:projekt
n19:GA102%2F07%2F0322
n3:rokUplatneniVysledku
n9:2008
n3:svazekPeriodika
32
n3:tvurceVysledku
Bouajjani, Ahmed Habermehl, Peter Vojnar, Tomáš
n3:zamer
n13:MSM0021630528
s:issn
0925-9856
s:numberOfPages
44
n10:organizacniJednotka
26230