. . "[5CB1717FC488]" . . "1"^^ . . "2004-08-22+02:00"^^ . . "552928" . "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 . . "Formal verification; Pushdown automata; Semantic equivalences"@en . . "Obecn\u00E1 metoda pro automatick\u00E9 rozhodov\u00E1n\u00ED s\u00E9mantick\u00FDch ekvivalenc\u00ED mezi procesy z\u00E1sobn\u00EDkov\u00FDch automat\u016F a kone\u010Dn\u011B-stavov\u00FDmi procesy"@cs . "Ku\u010Dera, Anton\u00EDn" . "Kluwer" . "395-408" . . "Je pod\u00E1na obecn\u00E1 metoda pro automatick\u00E9 rozhodov\u00E1n\u00ED s\u00E9mantick\u00FDch ekvivalenc\u00ED mezi procesy z\u00E1sobn\u00EDkov\u00FDch auomat\u016F a kone\u010Dn\u011B-stavov\u00FDch automat\u016F. Abstraktn\u00ED \u010D\u00E1st metody je aplikovateln\u00E1 na libovolnou ekvivalenci, kter\u00E1 je pravou PDA kongruenc\u00ED. Praktick\u00E1 pou\u017Eitelnost metody je demonstrov\u00E1na na vybran\u00FDch ekvivalenc\u00EDch, kter\u00E9 lze ozna\u010Dit za konceptu\u00E1ln\u00ED reprezentanty cel\u00E9ho spektra. Zvl\u00E1\u0161tn\u00ED pozornost je v\u011Bnov\u00E1na bisimula\u010Dn\u00EDm ekvivalenc\u00EDm. Je tak\u00E9 uk\u00E1z\u00E1no, jak lze metodu aplikovat na simula\u010Dn\u00ED ekvivalence a na ekvivalence podle stop. Obecnost metody nevede ke ztr\u00E1t\u011B efektivity. N\u011Bkter\u00E9 ze z\u00EDskan\u00FDch algoritm\u016F jsou optim\u00E1ln\u00ED nebo maj\u00ED dokonce polynomi\u00E1ln\u00ED slo\u017Eitost."@cs . "A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata"@en . "Mayr, Richard" . . "Obecn\u00E1 metoda pro automatick\u00E9 rozhodov\u00E1n\u00ED s\u00E9mantick\u00FDch ekvivalenc\u00ED mezi procesy z\u00E1sobn\u00EDkov\u00FDch automat\u016F a kone\u010Dn\u011B-stavov\u00FDmi procesy"@cs . "RIV/00216224:14330/04:00010233" . . "Toulouse, France" . "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." . "P(GA201/03/1161), Z(MSM 143300001)" . . "Exploring New Frontiers of Theoretical Informatics : IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004)" . . . "A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata"@en . "A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata" . "14330" . "1-4020-8140-5" . . "2"^^ . "A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata" . . "Boston, Dordrecht, London" . "14"^^ . "RIV/00216224:14330/04:00010233!RIV08-MSM-14330___" . . . .