Zde se nacházíte:
Informace o publikaci
The Complexity of Bisimilarity-Checking for One-Counter Processes
Autoři | |
---|---|
Rok publikování | 2003 |
Druh | Článek v odborném periodiku |
Časopis / Zdroj | Theoretical Computer Science |
Fakulta / Pracoviště MU | |
Citace | |
Obor | Informatika |
Klíčová slova | concurrency; one-counter automata; bisimilarity |
Popis | We study the problem of bisimilarity-checking between processes of one-counter automata and finite-state processes. We show that deciding weak bisimilarity between processes of one-counter nets and finite-state processes is DP-hard. Then we design an algorithm which decides weak bisimilarity between processes of one-counter automata and finite-state processes in time which is polynomial for a large subclass of instances, giving a kind of characterization of all hard instances as a byproduct. |
Související projekty: |