View in EDS PDF Full Text

An Equivalence in LOTOS and Its Decision Method.

Saved in:
Bibliographic Details
Title: An Equivalence in LOTOS and Its Decision Method.
Authors: Kaminaga, Hiroaki1, Takahashi, Kaoru1, Shiratori, Norio1, Noguchi, Shoichi1
Source: Systems & Computers in Japan. 1/1/91, Vol. 22 Issue 1, p10-20. 11p.
Subjects: LOTOS (Computer program language), Programming languages, Algorithms, Algebra, Robots, Industrial robots
Abstract: This paper considers the specification described in LOTOS, which is the formal description language for the communication system. A decision method is proposed for the equivalence between two arbitrary systems (between definition of service and the protocol specifications, for example). In this paper, based on the definition of the weak bisimulation equivalence, which is the definition of equivalence in LOTOS, the concepts of the λ-weak bisimulation equivalence and the canonical 1-weak bisimulation are introduced. It is shown that those concepts are mutually necessary and sufficient. Then, based on the canonical 1-weak bisimulation equivalence, the decision algorithm is presented for the weak bisimulation equivalence between two LOTOS specifications with finite states by the same method as in the equivalence class partitioning of the equivalent states in a finite automation. The traditional decision of the equivalence using the transformation by algebraic rules is heuristic and often does not succeed in the decision. By contrast, the proposed method has a merit in that it is always applicable to the system with finite states. [ABSTRACT FROM AUTHOR]
Copyright of Systems & Computers in Japan is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 14126788
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: An Equivalence in LOTOS and Its Decision Method.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Kaminaga%2C+Hiroaki%22">Kaminaga, Hiroaki</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Takahashi%2C+Kaoru%22">Takahashi, Kaoru</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Shiratori%2C+Norio%22">Shiratori, Norio</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Noguchi%2C+Shoichi%22">Noguchi, Shoichi</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Systems+%26+Computers+in+Japan%22">Systems & Computers in Japan</searchLink>. 1/1/91, Vol. 22 Issue 1, p10-20. 11p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22LOTOS+%28Computer+program+language%29%22">LOTOS (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Algebra%22">Algebra</searchLink><br /><searchLink fieldCode="DE" term="%22Robots%22">Robots</searchLink><br /><searchLink fieldCode="DE" term="%22Industrial+robots%22">Industrial robots</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This paper considers the specification described in LOTOS, which is the formal description language for the communication system. A decision method is proposed for the equivalence between two arbitrary systems (between definition of service and the protocol specifications, for example). In this paper, based on the definition of the weak bisimulation equivalence, which is the definition of equivalence in LOTOS, the concepts of the λ-weak bisimulation equivalence and the canonical 1-weak bisimulation are introduced. It is shown that those concepts are mutually necessary and sufficient. Then, based on the canonical 1-weak bisimulation equivalence, the decision algorithm is presented for the weak bisimulation equivalence between two LOTOS specifications with finite states by the same method as in the equivalence class partitioning of the equivalent states in a finite automation. The traditional decision of the equivalence using the transformation by algebraic rules is heuristic and often does not succeed in the decision. By contrast, the proposed method has a merit in that it is always applicable to the system with finite states. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Systems & Computers in Japan is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=14126788
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1002/scj.4690220102
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 11
        StartPage: 10
    Subjects:
      – SubjectFull: LOTOS (Computer program language)
        Type: general
      – SubjectFull: Programming languages
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Algebra
        Type: general
      – SubjectFull: Robots
        Type: general
      – SubjectFull: Industrial robots
        Type: general
    Titles:
      – TitleFull: An Equivalence in LOTOS and Its Decision Method.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Kaminaga, Hiroaki
      – PersonEntity:
          Name:
            NameFull: Takahashi, Kaoru
      – PersonEntity:
          Name:
            NameFull: Shiratori, Norio
      – PersonEntity:
          Name:
            NameFull: Noguchi, Shoichi
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Text: 1/1/91
              Type: published
              Y: 1991
          Identifiers:
            – Type: issn-print
              Value: 08821666
          Numbering:
            – Type: volume
              Value: 22
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Systems & Computers in Japan
              Type: main
ResultId 1