Deciding Bisimulation-Like Equivalences with Finite-State Processes

Warning

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

Authors	JANČAR Petr KUČERA Antonín RICHARD Mayr
Year of publication	1998
Type	Article in Periodical
Magazine / Source	Technical Report TUM
MU Faculty or unit	Faculty of Informatics
Citation
Field	Computer hardware and software
Keywords	process algebras; bisimilarity; finite-state systems
Related projects:	Algorithmic Verification Boundaries for Infinite-State Systems (Un)decidable Problems in Process Algebras Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing