An implementation of an efficient algorithm for bisimulation equivalence
- 31 May 1990
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 13 (2-3), 219-236
- https://doi.org/10.1016/0167-6423(90)90071-k
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Concurrency and automata on infinite sequencesPublished by Springer Nature ,2005
- A complete inference system for an algebra of regular acceptance modelsPublished by Springer Nature ,2005
- CCS expressions, finite state processes, and three problems of equivalenceInformation and Computation, 1990
- Three Partition Refinement AlgorithmsSIAM Journal on Computing, 1987
- Acceptance treesJournal of the ACM, 1985
- Specification-Oriented Programming in TCSPPublished by Springer Nature ,1985
- CCS expressions, finite state processes, and three problems of equivalencePublished by Association for Computing Machinery (ACM) ,1983
- A unified approach for studying the properties of transition systemsTheoretical Computer Science, 1982
- Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,–ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1979