Comparing the Classes BPA and BPA with Deadlocks

• Authors: SRBA Jiří
• Year of publication: 1998
• Type: Article in Periodical
• Magazine / Source: Technical report, Faculty of Informatics, Masaryk University, Brno
• MU Faculty or unit: Faculty of Informatics
• web: http://www.fi.muni.cz/informatics/reports/abstract/FIMU-RS-98-05.html
• Field: Information theory
• Keywords: process algebra; deadlock; bisimulation

Related projects

• Algorithmic Verification Boundaries for Infinite-State Systems
• Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing