Decision procedures and graph reductions for bisimulation equivalences part 2

References

• Aho , A. V. , Hopcroft , J. E. and Ullman , J. D. 1974 . The Design and Analysis of Computer Algorithms , Reading, Mass : Addison Wesley .
   Google Scholar
• Aho , A. V. and Ullman , J. D. 1977 . Principles of Compiler Design , Reading, Mass : Addison Wesley .
   Google Scholar
• Baeten J. C. M. Procesalgebra, Kluwer Programmatuurkunde Deventer 1986 in Dutch.
   Google Scholar
• Baeten J. C. M. Bergstra J. A. Klop J. W. An Operational Semantics for Process Algebra, report CS-8522 Centre for Mathematics and Computer Science Amsterdam 1985
   Google Scholar
• Baeten J. C. M. Bergstra J. A. Klop J. W. Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages, report CS-R8632 Centre for Mathematics and Computer Science Amsterdam 1986
   Google Scholar
• Baeten , J. C. M. , Bergstra , J. A. and Klop , J. W. 1987 . On the consistency of Koomen's fair abstraction rule . Theoretical Computer Science , 51 ( 1-2 ) : 129 – 176 .
   Web of Science ®Google Scholar
• Baeten J. C. M. Bergstra J. A. Vrancken J. L. M. Vakgroep Programmatuur Processen en Procesexpressies, report P8706 University of Amsterdam 1987 in Dutch
   Google Scholar
• Baeten J. C. M. van Glabbeek R. J. Another Look at Abstraction in Process Algebra, report CS-8701 Centre for Mathematics and Computer Science Amsterdam 1987 in Dutch
   Google Scholar
• Benson D. B. Tiuryn J. Fixed Points in Free Process Algebras with Silent Events, report CS- 86-152 Washington State University Washington 1986
   Google Scholar
• Bergstra J. A. Klop J. W. Verification of an Alternating Bit Protocol by means of Process Algebra, report CS-R8404 Centre for Mathematics and Computer Science Amsterdam 1984
   Google Scholar
• Bergstra , J. A. and Klop , J. W. 1986 . “ Process algebra: Specification and verification in bisimulation semantics ” . In In: Mathematics and Computer Science II , Vol. 4 , 61 – 94 . Amsterdam : North-Holland . CWI Monographs
   Google Scholar
• Bergstra , J. A. and Klop , J. W. 1987 . “ A complete inference system for regular processes with silent moves ” . In In: Logic Colloquium '86 , Edited by: Drake , F. R. and Truss , J. K. 21 – 81 . Elsevier .
   Google Scholar
• Bochmann , G. v. and Verjus , J. P. 1987 . Some comments on transition oriented versus structured specification of distributed algorithms and protocols . IEEE Transactions on Software Engineering , SE-13 ( 4 ) : 501 – 505 .
   Web of Science ®Google Scholar
• Bolognesi , T. 1987 . Proceedings Seventh IFIP International Meeting on Protocol Specification, Verification and Testing . Fundamental results for the verification of observational equivalence . 1987 , Zuerich.
   Google Scholar
• Castellani , I. 1987 . Bisimulations and abstraction homomorphisms . Journal of Computer and System Sciences , 34 : 210 – 235 .
   Google Scholar
• Dicky , A. 1986 . An algebraic and algorithmic method for analysing transition systems . Theoretical Computer Science , 46 : 285 – 303 .
   Google Scholar
• van Glabbeek R. J. Bounded Nondeterminism and the Approximation Induction Principle, report R 8634 Centre for Mathematics and Computer Science Amsterdam 1986
   Google Scholar
• Kannelakis , P. C. and Smolka , S. A. 1983 . Proceedings Second Annual ACM Symposium on Principles of Distributed Computing . CCS expressions, finite state processes, and three problems of equivalence . 1983 . pp. 228 – 240 . Montreal
   Google Scholar
• Koymans C. P. J. Mulder J. C. A Modular Approach to Protocol Verification using Process Algebra Report LGPS 6 Department of Philosophy, University of Utrecht Utrecht 1985
   Google Scholar
• Mauw S. A Constructive Version of the Approximation Induction Principle, Report FVI 87-09 Department of Computer Science, University of Amsterdam Amsterdam 1987
   Google Scholar
• de Nicola , R. 1987 . Extensional equivalences for transition systems . Acta Informatica , 24 : 211 – 237 .
   Google Scholar
• de Nicola , R. 1987 . Extensional equivalences for transition systems . Acta Informatica , 24 : 211 – 237 .
   Google Scholar
• Vaandrager F. W. College-diktaat Protocolverifïcatie, PAO Cursus Protocolverificatie University of Amsterdam 1987 in Dutch
   Google Scholar
• Vaandrager F. W. Verification by Means of Observational Equivalence on Automata, Report 501, I.N.R.I.A. Centre Sophia Antipolis, Valbonne Cedex France 1986
   Google Scholar