| Attributes | Values |
|---|
| rdf:type
| |
| Description
| - 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. (cs)
- 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.
- 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. (en)
|
| Title
| - Obecná metoda pro automatické rozhodování sémantických ekvivalencí mezi procesy zásobníkových automatů a konečně-stavovými procesy (cs)
- 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 (en)
|
| 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 (cs)
- 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 (en)
|
| skos:notation
| - RIV/00216224:14330/04:00010233!RIV08-MSM-14330___
|
| http://linked.open.../vavai/riv/strany
| |
| http://linked.open...avai/riv/aktivita
| |
| http://linked.open...avai/riv/aktivity
| - P(GA201/03/1161), Z(MSM 143300001)
|
| http://linked.open...vai/riv/dodaniDat
| |
| http://linked.open...aciTvurceVysledku
| |
| http://linked.open.../riv/druhVysledku
| |
| http://linked.open...iv/duvernostUdaju
| |
| http://linked.open...titaPredkladatele
| |
| http://linked.open...dnocenehoVysledku
| |
| http://linked.open...ai/riv/idVysledku
| - RIV/00216224:14330/04:00010233
|
| http://linked.open...riv/jazykVysledku
| |
| http://linked.open.../riv/klicovaSlova
| - Formal verification; Pushdown automata; Semantic equivalences (en)
|
| http://linked.open.../riv/klicoveSlovo
| |
| http://linked.open...ontrolniKodProRIV
| |
| http://linked.open...v/mistoKonaniAkce
| |
| http://linked.open...i/riv/mistoVydani
| - Boston, Dordrecht, London
|
| http://linked.open...i/riv/nazevZdroje
| - Exploring New Frontiers of Theoretical Informatics : IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004)
|
| http://linked.open...in/vavai/riv/obor
| |
| http://linked.open...ichTvurcuVysledku
| |
| http://linked.open...cetTvurcuVysledku
| |
| http://linked.open...vavai/riv/projekt
| |
| http://linked.open...UplatneniVysledku
| |
| http://linked.open...iv/tvurceVysledku
| - Kučera, Antonín
- Mayr, Richard
|
| http://linked.open...vavai/riv/typAkce
| |
| http://linked.open.../riv/zahajeniAkce
| |
| http://linked.open...n/vavai/riv/zamer
| |
| number of pages
| |
| http://purl.org/ne...btex#hasPublisher
| |
| https://schema.org/isbn
| |
| http://localhost/t...ganizacniJednotka
| |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
![[cxml]](/fct/images/cxml_doc.png)
![[csv]](/fct/images/csv_doc.png)
![[text]](/fct/images/ntriples_doc.png)
![[turtle]](/fct/images/n3turtle_doc.png)
![[ld+json]](/fct/images/jsonld_doc.png)
![[rdf+json]](/fct/images/json_doc.png)
![[rdf+xml]](/fct/images/xml_doc.png)
![[atom+xml]](/fct/images/atom_doc.png)
![[html]](/fct/images/html_doc.png)