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

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

Namespace Prefixes

PrefixIRI
n16http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n18http://localhost/temp/predkladatel/
n11http://purl.org/net/nknouf/ns/bibtex#
n17http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n9http://linked.opendata.cz/resource/domain/vavai/projekt/
n22http://linked.opendata.cz/ontology/domain/vavai/
n19https://schema.org/
n7http://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#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://reference.data.gov.uk/id/gregorian-year/
n6http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F04%3A00010233%21RIV08-MSM-14330___/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F04%3A00010233%21RIV08-MSM-14330___
rdf:type
skos:Concept n22:Vysledek
dcterms:description
We propose a generic method for deciding semantic equivalences between pushdown automata and finite-state automata. The abstract part of the method is applicable to every process equivalence which is a right PDA congruence. Practical usability of the method is demonstrated on selected equivalences which are conceptual representatives of the whole spectrum. In particular, special attention is devoted to bisimulation-like equivalences (including weak, early, delay, branching, and probabilistic bisimilarity), and it is also shown how the method applies to simulation-like and trace-like equivalences. The generality does not lead to the loss of efficiency; the algorithms obtained by applying our method are essentially time-optimal and sometimes even polynomial. The list of particular results obtained by our method includes items which are first of their kind. Je podána obecná metoda pro automatické rozhodování sémantických ekvivalencí mezi procesy zásobníkových auomatů a konečně-stavových automatů. Abstraktní část metody je aplikovatelná na libovolnou ekvivalenci, která je pravou PDA kongruencí. Praktická použitelnost metody je demonstrována na vybraných ekvivalencích, které lze označit za konceptuální reprezentanty celého spektra. Zvláštní pozornost je věnována bisimulačním ekvivalencím. Je také ukázáno, jak lze metodu aplikovat na simulační ekvivalence a na ekvivalence podle stop. Obecnost metody nevede ke ztrátě efektivity. Některé ze získaných algoritmů jsou optimální nebo mají dokonce polynomiální složitost. We propose a generic method for deciding semantic equivalences between pushdown automata and finite-state automata. The abstract part of the method is applicable to every process equivalence which is a right PDA congruence. Practical usability of the method is demonstrated on selected equivalences which are conceptual representatives of the whole spectrum. In particular, special attention is devoted to bisimulation-like equivalences (including weak, early, delay, branching, and probabilistic bisimilarity), and it is also shown how the method applies to simulation-like and trace-like equivalences. The generality does not lead to the loss of efficiency; the algorithms obtained by applying our method are essentially time-optimal and sometimes even polynomial. The list of particular results obtained by our method includes items which are first of their kind.
dcterms:title
Obecná metoda pro automatické rozhodování sémantických ekvivalencí mezi procesy zásobníkových automatů a konečně-stavovými procesy A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata
skos:prefLabel
Obecná metoda pro automatické rozhodování sémantických ekvivalencí mezi procesy zásobníkových automatů a konečně-stavovými procesy A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata
skos:notation
RIV/00216224:14330/04:00010233!RIV08-MSM-14330___
n3:strany
395-408
n3:aktivita
n10:P n10:Z
n3:aktivity
P(GA201/03/1161), Z(MSM 143300001)
n3:dodaniDat
n12:2008
n3:domaciTvurceVysledku
n17:9872655
n3:druhVysledku
n15:D
n3:duvernostUdaju
n4:S
n3:entitaPredkladatele
n6:predkladatel
n3:idSjednocenehoVysledku
552928
n3:idVysledku
RIV/00216224:14330/04:00010233
n3:jazykVysledku
n13:eng
n3:klicovaSlova
Formal verification; Pushdown automata; Semantic equivalences
n3:klicoveSlovo
n5:Pushdown%20automata n5:Formal%20verification n5:Semantic%20equivalences
n3:kontrolniKodProRIV
[5CB1717FC488]
n3:mistoKonaniAkce
Toulouse, France
n3:mistoVydani
Boston, Dordrecht, London
n3:nazevZdroje
Exploring New Frontiers of Theoretical Informatics : IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004)
n3:obor
n20:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:projekt
n9:GA201%2F03%2F1161
n3:rokUplatneniVysledku
n12:2004
n3:tvurceVysledku
Kučera, Antonín Mayr, Richard
n3:typAkce
n16:WRD
n3:zahajeniAkce
2004-08-22+02:00
n3:zamer
n7:MSM%20143300001
s:numberOfPages
14
n11:hasPublisher
Kluwer
n19:isbn
1-4020-8140-5
n18:organizacniJednotka
14330