Efficient Verification Algorithms for One-Counter Processes

KUČERA, Antonín. Efficient Verification Algorithms for One-Counter Processes. U. Montanari, J.D.P. Rolim, E. Welzl (Eds.). In Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP 2000). Berlin, Heidelberg, New York: Springer, 2000, p. 317-328. Lecture Notes in Computer Science, vol. 1853. ISBN 3-540-67715-1.

Basic information

Original name

Efficient Verification Algorithms for One-Counter Processes

Authors

KUČERA, Antonín
U. Montanari, J.D.P. Rolim, E. Welzl (Eds.).

Edition

Berlin, Heidelberg, New York, Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP 2000), p. 317-328, Lecture Notes in Computer Science, vol. 1853, 2000

Publisher

Springer

---

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

20206 Computer hardware and architecture

Country of publisher

Germany

Confidentiality degree

není předmětem státního či obchodního tajemství

RIV identification code

RIV/00216224:14330/00:00002264

Organization unit

Faculty of Informatics

ISBN

3-540-67715-1

UT WoS

000089738700028

Keywords in English

concurrency; bisimulation; one-counter automata

Tags

bisimulation, concurrency, one-counter automata

---

Links

GA201/00/0400, research and development project	Name: Nekonečně stavové souběžné systémy - modely a verifikace Investor: Czech Science Foundation, Infinite state concurrent systems - models and verification
GA201/98/P046, research and development project	Name: Rozhodnutelné problémy v algebrách procesů Investor: Czech Science Foundation, (Un)decidable Problems in Process Algebras
MSM 143300001, plan (intention)	Name: Nesekvenční modely výpočtů - kvantové a souběžné distribuované modely výpočetních procesů Investor: Ministry of Education, Youth and Sports of the CR, Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing