• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

1989 Fiscal Year Final Research Report Summary

Abstraction of Nonterminating Processes and Its Algebraic Specification

Research Project

Project/Area Number 63580025
Research Category

Grant-in-Aid for General Scientific Research (C)

Allocation TypeSingle-year Grants
Research Field Informatics
Research InstitutionNagoya University

Principal Investigator

SAKABE Toshiki  Nagoya Univ., Faculty of Eng., Associate Professor, 工学部, 助教授 (60111829)

Co-Investigator(Kenkyū-buntansha) HIRATA Tomio  Nagoya Univ., Faculty of Eng., Associate Professor, 工学部, 助教授 (10144205)
INAGAKI Yasuyoshi  Nagoya Univ., Faculty of Eng., Professor, 工学部, 教授 (10023079)
Project Period (FY) 1988 – 1989
Keywordsnonterminating process / equational logic / algebraic specification / concurrent process / CCS / tree pattern matching
Research Abstract

The purpose of this research project is to establish technical foundation of algebraic specification of nonterminating processes. Specific research topics and the results are as follows:
1. Semantical aspect of the rational equational logic, in which nonterminating processes are expressed, has been investigated. Adopting Scott's order theoretic approach, the semantics of term rewriting system has been formalized. Characteristic points of the semantics are (1) that computational complexity of term rewriting systems is incorporated in the semantics and (2) that complexity of nonterminating computation is naturally given.
2. For implementing interpreters or compilers of algebraic languages, tree pattern matching is the most fundamental operation. In the research of algebraic languages, three algorithms for tree pattern matching, have been proposed. Particularly, the parallel tree matching algorithm using systolic array is interesting in that it runs in linear time order and is easily implemented in VLSI.
3. CCS is a formal model of concurrent processes including nonterminating processes. In the research of CCS, the original CCS has been extended so that communication links among processed can be changed dynamically, and the semantics of the extended CCS has been investigated. To investigate the expressive power of the extended CCS, monitors has been described in the extended CCS. As results mutual exclusion synchronization mechanism of monitors are plainly expressed in terms of new features of the extended CCS, and abstraction mechanism of monitors is naturally explained through the semantics of the observational equivalence on the extended CCS.
4. A model of concurrent processes based on term rewriting system has been proposed. The model is called the communicating term rewriting systems. Main results of this research is that independence of internal computation of processed from computation for communication and uniqueness of computed values are proved.

  • Research Products

    (12 results)

All Other

All Publications (12 results)

  • [Publications] 直井徹: "項書換え系とその保存的拡大における代数的意味論と動作的意味論の関連について" 電子情報通信学会論文誌. J71-D-I. 1893-1900 (1988)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Tohru Naoi: "Algebraic Semantics and Complexity of Term Rewriting Systems" Proc-of ACM 3rd International Conference on Rewriting Techniques and Applications. 311-325 (1989)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 結縁祥治: "CCSにおける通的通信名前づけについて" 情報処理学会研究報告. SF-86-26. 1-10 (1988)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 平田富夫: "木パタ-ンマッチングアルゴリズム" 情報処理学会研究報告. 88-AL-4. 1-7 (1988)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 酒井正彦: "代数的仕様における帰納的性質の証明法" 電子情報通信学会技術研究報告. COMP88-86. 83-92 (1989)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 山本晋一郎: "TRSインタプリタの並列最外戦略実現法" 電子情報通信学会技術研究報告. COMP88-94. 41-50 (1989)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Tohru NAOI and Yasuyoshi INAGAKI: "Algebraic Semantics and Complexity of Term Rewriting Systems" Transactions on IEICE, vol.J71 D-I, pp.1893-1900, 1988.

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Tohru NAOI and Yasuyoshi INAGAKI: "Algebraic Semantics and Complexity of Term Rewriting Systems" Proceedings of ACM Third International Conference on Rewriting Techniques and Applications pp.311-325, 1989.

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Shoji YUEN, Toshiki SAKABE and Yasuyoshi INAGAKI: "Dynamic Communication Naming in CCS" Research Report of IPSJ, SF-88 26, pp.1-10, 1988.

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Tomio HIRATA and Yasuyoshi INAGAKI: "Tree Pattern Matching Algorithms" Research Report of IPSJ, 88-AL 4, pp.1-7, 1988.

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Masahiko SAKAI, Toshiki SAKABE and Yasuyoshi INAGAKI: "Proving Method of Inductive Properties of Algebraic Specifications" Technical Research Report of IEICE, COMP88-86, pp.83-92 1989.

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Shin-ichirou YAMAMOTO, Masahiko SAKAI, Toshiki SAKABE and Yasuyoshi INAGAKI: "An Implementation of the Outer-most Parallel Strategy of the TRS Interpreter," Technical Research Report of IEICE, COMP88-86, pp.41-50 1989.

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 1993-03-26  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi