STŘÍBRNÁ, Jitka. Decidability and complexity of equivalences for simple process algebras. Edinburgh: University of Edinburgh, 1999, 125 pp. LFCS Report Series, ECS-LFCS-99-408.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Decidability and complexity of equivalences for simple process algebras
Authors STŘÍBRNÁ, Jitka.
Edition Edinburgh, 125 pp. LFCS Report Series, ECS-LFCS-99-408, 1999.
Publisher University of Edinburgh
Other information
Original language English
Type of outcome Book on a specialized topic
Field of Study 10101 Pure mathematics
Country of publisher United Kingdom of Great Britain and Northern Ireland
Confidentiality degree is not subject to a state or trade secret
WWW URL
Organization unit Faculty of Informatics
Keywords in English decidability; computational complexity; strong bisimilarity; weak bisimilarity; Basic Process Algebras; Basic Parallel Process Algebras; polynomial ideals; Hilbert's Basis Theorem; Gr\
Tags Basic Parallel Process Algebras, Basic Process Algebras, computational complexity, decidability, Gr\, Hilbert's Basis Theorem, polynomial ideals, strong bisimilarity, weak bisimilarity
Changed by Changed by: Mgr. Jitka Stříbrná, Ph.D., učo 29038. Changed: 7/12/1999 19:30.
PrintDisplayed: 5/5/2024 03:24