Abstract
Labeled transition systems (lts) provide an operational semantics for many specification languages. In order to abstract unrelevant details of lts's, manybehavioural equivalences have been defined; here observation equivalence is considered. We are interested in the following problem:Given a finite lts, which is the minimal observation equivalent lts corresponding to it?
It is well known that the number of states of an lts can be minimized by applying arelational coarsest partition algorithm. However, the obtained lts is not unique (up to the renaming of the states): for an lts there may exist several observation equivalent lts's which have the minimal number of states but varying number of transitions. In this paper we show how the number of transitions can be minimized, obtaining a unique lts.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Information Processing Systems —Open Systems Interconnection — Protocol Specification for the Association Control Service Element. Draft International Standard ISO 8650. International Organization for Standardization. April 1988.
Information Processing Systems — Open Systems Interconnection — Service Definition for the Association Control Service Element. Draft International Standard ISO 8649. International Organization for Standardization. April 1988.
Bolognesi, T., Smolka, S., Fundamental results for the verification of observational equivalence: A survey. Rudin, H., West, C., Proceedings of the IFIP International Conference on Protocol Specification, Testing and Verification VII, Zurich 1987. North Holland. 1988.
Brookes, S., Hoare, C., Roscoe, A.,A theory of communicating sequential processes. Journal of the ACM 31(1984)3, 560–599. Also: Report CMU-CD-83-153. Department of Computer Science, Carnegie-Mellon University. 1983.
Brookes, S., Roscoe, A.,An improved failures model for communicating processes. Lecture Notes in Computer Science 197(1984), 281–305.
Cleaveland, R., Parrow, J., Steffen, B.,The concurrency workbench. Lecture Notes in Computer Science 407(1989), 24–37.
Cleaveland, R., Parrow, J., Steffen, B.,A semantics-based verification tool for finite state systems. 287–302. Proceedings of the IFIP WG 6.1 Ninth International Symposium on Protocol Specification, Testing, and Verification. Enschede, the Netherlands 6–9 June 1989. Elsevier Science Publishers B.V. Amsterdam (North-Holland).
Eloranta, J.,Equivalence concepts and algorithms for transition systems and CCS-like languages. Lic. Thesis C-1991-2. Department of Computer Science, University of Helsinki. 1991.
Fernandez, J-C.,An implementation of an efficient algorithm for bisimulation equivalence. Science of Computer Programming 13(1989/90), 219–236.
Gouda, M., The, K.,Modeling physical layer protocols using communicating finite state machines. ACM SIGCOMM Computer Communication Review 15(1985)4, 54–62.
Hoare, C.,Communicating Sequential Processes. Prentice-Hall International. London 1985.
Hopcroft, J.,An nlogn algorithm for minimizing states in a finite automaton. 189–196. Theory of Machines and Computation. Kohavi, Z., Paz, A., Academic Press New York and London. 1971.
Hopcroft, J., Ullman, J.,Introduction to Automata Theory, Languages and Computation. Addison-Wesley. Reading 1979.
Keller, R.,Formal verification of parallel programs. Communication of the ACM 19(1976)7, 371–384.
Larsen, K.,A context dependent equivalence between processes. Lecture Notes in Computer Science 194(1985), 373–382.
Lynch, W.,Reliable full-duplex file transmission over half-duplex telephone lines. Communications of ACM 11(1968)6(7),407–409.
Milner, R.,A calculus of communicating systems. Lecture Notes in Computer Science 92(1980). Also: LFCS Report Series ECS-LFCS-86-7. Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh. 1986.
Milner, R.,A complete axiomatisation for observational congruence of finite-state behaviours. LFCS Report Series ECS-LFCS-86-8. Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh. 1986.
Milner, R.,Communication and Concurrency. Prentice-Hall. 1989.
De Nicola, R.,Extensional equivalences for transition systems. Acta Informatica 24(1987), 211–237.
De Nicola, R., Hennessy, M.,Testing equivalences for processes. Internal Report CSR-123-82. Department of Computer Science, University of Edinburgh. August 1982. Also: Theoretical Computer Science 34(1984), 83–113. Also: Lecture Notes in Computer Science 154(1983), 548–560.
Paige, R., Tarjan, R.,Three partition refinement algorithms. SIAM Journal of Computing 16(1987)6, 973–989.
Park, D.,Concurrency and automata in infinite strings. Lecture Notes in Computer Science 104(1981), 167–183.
Plotkin, G.,A structural approach to operational semantics. Technical Report DAIMI FN-19. Department of Computer Science, University of Aarhus, Denmark. 1981.
Walker, D.,Bisimulation equivalence and divergence in CCS. LFCS Report Series ECS-LFCS-87-29 (also CSR-235-87). Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh. June 1987.
Walker, D.,Bisimulation and divergence. Information and Computation 85(1990), 202–241.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Eloranta, J. Minimizing the number of transitions with respect to observation equivalence. BIT 31, 576–590 (1991). https://doi.org/10.1007/BF01933173
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01933173