SRBA, Jiří. Deadlocking States in Context-Free Process Algebra. In Proceedings of the The 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS'98). Heidelberg: Springer-Verlag, 1998, p. 388-397. volume 1450 of LNCS.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Deadlocking States in Context-Free Process Algebra
Authors SRBA, Jiří.
Edition Heidelberg, Proceedings of the The 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS'98), p. 388-397, volume 1450 of LNCS, 1998.
Publisher Springer-Verlag
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10000 1. Natural Sciences
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
WWW URL
RIV identification code RIV/00216224:14330/98:00000699
Organization unit Faculty of Informatics
UT WoS 000083173400035
Keywords in English BPA; process; deadlock; bisimulation
Tags bisimulation, BPA, deadlock, process
Changed by Changed by: Prof. Jiří Srba, Ph.D., učo 2841. Changed: 7/3/2000 11:49.
Links
GA201/97/0456, research and development projectName: Meze algoritmické verifikovatelnosti nekonečně stavových systémů
Investor: Czech Science Foundation, Algorithmic Verification Boundaries for Infinite-State Systems
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
PrintDisplayed: 25/7/2024 18:41