Approximating Weak Bisimulation on Basic Process Algebras

Warning

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

Authors	STŘÍBRNÁ Jitka
Year of publication	1999
Type	Article in Proceedings
Conference	Mathematical Foundations of Computer Science 1999, Proceedings
MU Faculty or unit	Faculty of Informatics
Citation
Web	http://www.fi.muni.cz/usr/stribrna/Documents/mfcsfin.ps
Field	General mathematics
Keywords	basic process algebra; weak bisimulation; approximants; lower and upper bound
Related projects:	Decidability and complexity of observational equivalences on infinite - state processes Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing