Some Remarks on Sets of Communicating Sequential Processes in Topological Rough Set Framework.
Saved in:
| Title: | Some Remarks on Sets of Communicating Sequential Processes in Topological Rough Set Framework. |
|---|---|
| Authors: | Polkowski, Lech1,2, Semeniuk-Polkowska, Maria3 polkow@pjwstk.edu.pl |
| Source: | Fundamenta Informaticae. Apr2004, Vol. 60 Issue 1-4, p301-305. 15p. |
| Subjects: | Sequential processing (Computer science), Electronic data processing, Topology, Rough sets, Set theory |
| Abstract: | Communicating Sequential Processes (CSP), is a theoretical framework for discussing concurrent phenomena [7]. In this note, we begin an investigation into the nature of sets of communicating sequential processes. Sets of sequential processes arise naturally when one considers processes contained within specified bounds which provides their approximate description. Adopting the trace formalism, we may express those bounds in a natural way by means of containment of traces. We endow families of process traces and a fortiori, families of processes, with a rough set topology. We show in this note that basic operators on processes preserve exact sets of processes and they are non-expansive (i.e., non-destructive in terminology of [7]) with respect to the metric D on rough sets [6], [5], restricted to exact sets of processes. [ABSTRACT FROM AUTHOR] |
| Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne 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: 13979633 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Some Remarks on Sets of Communicating Sequential Processes in Topological Rough Set Framework. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Polkowski%2C+Lech%22">Polkowski, Lech</searchLink><relatesTo>1,2</relatesTo><br /><searchLink fieldCode="AR" term="%22Semeniuk-Polkowska%2C+Maria%22">Semeniuk-Polkowska, Maria</searchLink><relatesTo>3</relatesTo><i> polkow@pjwstk.edu.pl</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Fundamenta+Informaticae%22">Fundamenta Informaticae</searchLink>. Apr2004, Vol. 60 Issue 1-4, p301-305. 15p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Sequential+processing+%28Computer+science%29%22">Sequential processing (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+data+processing%22">Electronic data processing</searchLink><br /><searchLink fieldCode="DE" term="%22Topology%22">Topology</searchLink><br /><searchLink fieldCode="DE" term="%22Rough+sets%22">Rough sets</searchLink><br /><searchLink fieldCode="DE" term="%22Set+theory%22">Set theory</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Communicating Sequential Processes (CSP), is a theoretical framework for discussing concurrent phenomena [7]. In this note, we begin an investigation into the nature of sets of communicating sequential processes. Sets of sequential processes arise naturally when one considers processes contained within specified bounds which provides their approximate description. Adopting the trace formalism, we may express those bounds in a natural way by means of containment of traces. We endow families of process traces and a fortiori, families of processes, with a rough set topology. We show in this note that basic operators on processes preserve exact sets of processes and they are non-expansive (i.e., non-destructive in terminology of [7]) with respect to the metric D on rough sets [6], [5], restricted to exact sets of processes. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne 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=13979633 |
| RecordInfo | BibRecord: BibEntity: Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 15 StartPage: 301 Subjects: – SubjectFull: Sequential processing (Computer science) Type: general – SubjectFull: Electronic data processing Type: general – SubjectFull: Topology Type: general – SubjectFull: Rough sets Type: general – SubjectFull: Set theory Type: general Titles: – TitleFull: Some Remarks on Sets of Communicating Sequential Processes in Topological Rough Set Framework. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Polkowski, Lech – PersonEntity: Name: NameFull: Semeniuk-Polkowska, Maria IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 04 Text: Apr2004 Type: published Y: 2004 Identifiers: – Type: issn-print Value: 01692968 Numbering: – Type: volume Value: 60 – Type: issue Value: 1-4 Titles: – TitleFull: Fundamenta Informaticae Type: main |
| ResultId | 1 |
