메뉴 건너뛰기
BIT
Volumn 31, Issue 4, 1991, Pages 576-590
Minimizing the number of transitions with respect to observation equivalence
Author keywords

F.1.1; F.3.1; Labeled transition system; Minimization; Observation equivalence; Uniqueness
Indexed keywords

EID: 0009822476     PISSN: 00063835     EISSN: 15729125     Source Type: Journal    
DOI: 10.1007/BF01933173     Document Type: Article
Times cited : (17)
References (26)
  • 1
    • 84936551164 scopus 로고    scopus 로고
    • 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.
  • 2
    • 84936551181 scopus 로고    scopus 로고
    • 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.
  • 3
    • 84936551180 scopus 로고    scopus 로고
    • 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.
  • 7
    • 84936551183 scopus 로고    scopus 로고
    • 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).
  • 8
    • 84936551182 scopus 로고    scopus 로고
    • 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.
  • 12
    • 84936551177 scopus 로고    scopus 로고
    • Hopcroft, J., An nlog n 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.
  • 17
    • 84936551176 scopus 로고    scopus 로고
    • 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.
  • 18
    • 84936551179 scopus 로고    scopus 로고
    • 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.
  • 19
    • 84936551178 scopus 로고    scopus 로고
    • Milner, R., Communication and Concurrency. Prentice-Hall. 1989.
  • 21
    • 84936551175 scopus 로고    scopus 로고
    • 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.
  • 25
    • 84936551174 scopus 로고    scopus 로고
    • 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.

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.