View in EDS

On the usability of process algebra: An architectural view

Saved in:
Bibliographic Details
Title: On the usability of process algebra: An architectural view
Authors: Aldini, Alessandro1, Bernardo, Marco bernardo@sti.uniurb.it
Source: Theoretical Computer Science. May2005, Vol. 335 Issue 2/3, p281-329. 49p.
Subjects: Mathematics, Algebra, Mathematical analysis, Systems design
Abstract: Abstract: Despite its strengths like compositionality and equivalence checking, process algebra is rarely adopted outside the academia. In this paper we address the usability issue for process algebra along two different directions. On the modeling side, we provide a set of guidelines inspired by the software architecture field, which should enforce a clear component-oriented approach to the process algebraic design of system families. On the verification side, we propose a component-oriented technique based on equivalence checking for the detection of architecture-level mismatches and the provision of related diagnostic information. Such a technique extends previous results in terms of generality of the considered mismatches, generality of the considered system topologies, and scalability to system families. [Copyright &y& Elsevier]
Copyright of Theoretical Computer Science is the property of Elsevier B.V. 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 Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 17061260
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: On the usability of process algebra: An architectural view
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Aldini%2C+Alessandro%22">Aldini, Alessandro</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Bernardo%2C+Marco%22">Bernardo, Marco</searchLink><i> bernardo@sti.uniurb.it</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Theoretical+Computer+Science%22">Theoretical Computer Science</searchLink>. May2005, Vol. 335 Issue 2/3, p281-329. 49p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Mathematics%22">Mathematics</searchLink><br /><searchLink fieldCode="DE" term="%22Algebra%22">Algebra</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+analysis%22">Mathematical analysis</searchLink><br /><searchLink fieldCode="DE" term="%22Systems+design%22">Systems design</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Abstract: Despite its strengths like compositionality and equivalence checking, process algebra is rarely adopted outside the academia. In this paper we address the usability issue for process algebra along two different directions. On the modeling side, we provide a set of guidelines inspired by the software architecture field, which should enforce a clear component-oriented approach to the process algebraic design of system families. On the verification side, we propose a component-oriented technique based on equivalence checking for the detection of architecture-level mismatches and the provision of related diagnostic information. Such a technique extends previous results in terms of generality of the considered mismatches, generality of the considered system topologies, and scalability to system families. [Copyright &y& Elsevier]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Theoretical Computer Science is the property of Elsevier B.V. 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=17061260
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.tcs.2004.10.043
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 49
        StartPage: 281
    Subjects:
      – SubjectFull: Mathematics
        Type: general
      – SubjectFull: Algebra
        Type: general
      – SubjectFull: Mathematical analysis
        Type: general
      – SubjectFull: Systems design
        Type: general
    Titles:
      – TitleFull: On the usability of process algebra: An architectural view
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Aldini, Alessandro
      – PersonEntity:
          Name:
            NameFull: Bernardo, Marco
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 23
              M: 05
              Text: May2005
              Type: published
              Y: 2005
          Identifiers:
            – Type: issn-print
              Value: 03043975
          Numbering:
            – Type: volume
              Value: 335
            – Type: issue
              Value: 2/3
          Titles:
            – TitleFull: Theoretical Computer Science
              Type: main
ResultId 1