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/
n11http://localhost/temp/predkladatel/
n10http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n4http://linked.opendata.cz/resource/domain/vavai/projekt/
n18http://linked.opendata.cz/ontology/domain/vavai/
n20http://linked.opendata.cz/resource/domain/vavai/zamer/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/kodPristupu/
skoshttp://www.w3.org/2004/02/skos/core#
rdfshttp://www.w3.org/2000/01/rdf-schema#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n15http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F08%3APU78079%21RIV10-MSM-26230___/
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/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F08%3APU78079%21RIV10-MSM-26230___
rdf:type
skos:Concept n18:Vysledek
rdfs:seeAlso
http://www.fit.vutbr.cz/~vojnar/Publications/bhhtv-nartmc-tr-08.pdf
dcterms:description
This report provides the full version of a CIAA'08 paper, in which we propose a new antichain-based algorithms for checking universality and inclusion of nondeterministic tree automata (NTA).  We have implemented these algorithms in a prototype tool and our experiments show that they provide a significant improvement over the traditional determinisation-based approaches. We use our antichain-based inclusion checking algorithm to build an abstract regular tree model checking framework based entirely on NTA. We show the significantly improved efficiency of this  framework through a series of experiments with verifying various programs over dynamic linked tree-shaped data structures. This report provides the full version of a CIAA'08 paper, in which we propose a new antichain-based algorithms for checking universality and inclusion of nondeterministic tree automata (NTA).  We have implemented these algorithms in a prototype tool and our experiments show that they provide a significant improvement over the traditional determinisation-based approaches. We use our antichain-based inclusion checking algorithm to build an abstract regular tree model checking framework based entirely on NTA. We show the significantly improved efficiency of this  framework through a series of experiments with verifying various programs over dynamic linked tree-shaped data structures.
dcterms:title
Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
skos:prefLabel
Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
skos:notation
RIV/00216305:26230/08:PU78079!RIV10-MSM-26230___
n3:aktivita
n14:Z n14:P
n3:aktivity
P(GA102/07/0322), Z(MSM0021630528)
n3:dodaniDat
n7:2010
n3:domaciTvurceVysledku
n10:9761985 n10:1258486
n3:druhVysledku
n17:A
n3:duvernostUdaju
n9:S
n3:entitaPredkladatele
n15:predkladatel
n3:idSjednocenehoVysledku
356407
n3:idVysledku
RIV/00216305:26230/08:PU78079
n3:jazykVysledku
n19:eng
n3:klicovaSlova
universality, tree automata, antichain, abstract regular tree model checking
n3:klicoveSlovo
n5:antichain n5:tree%20automata n5:universality n5:abstract%20regular%20tree%20model%20checking
n3:kodPristupu
n12:V
n3:kontrolniKodProRIV
[F6C566F2E6BC]
n3:obor
n8:JC
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
5
n3:projekt
n4:GA102%2F07%2F0322
n3:rokUplatneniVysledku
n7:2008
n3:tvurceVysledku
Bouajjani, Ahmed Touili, Tayssir Holík, Lukáš Vojnar, Tomáš Habermehl, Peter
n3:zamer
n20:MSM0021630528
n11:organizacniJednotka
26230