Comparing the Classes BPA and BPA with Deadlocks

Srba,  Jiří

Comparing the Classes BPA and BPA with Deadlocks

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on muni.cz.

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
Citation
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