Nondeterministic Modal Interfaces.
Saved in:
| Title: | Nondeterministic Modal Interfaces. |
|---|---|
| Authors: | Bujtor, Ferenc1 ferenc.bujtor@informatik.uni-augsburg.de, Fendrich, Sascha2 sascha.fendrich@swt-bamberg.de, Lüttgen, Gerald2 gerald.luettgen@swt-bamberg.de, Vogler, Walter1 walter.vogler@informatik.uni-augsburg.de |
| Source: | Theoretical Computer Science. Aug2016, Vol. 642, p24-53. 30p. |
| Subjects: | Computer interfaces, Alphabet -- Data processing, Machine theory, Operator functions, Computer input design, Electronic equipment design |
| Abstract: | Interface theories are employed in the component-based design of concurrent systems. They often emerge as combinations of Interface Automata (IA) and Modal Transition Systems (MTS), e.g., Nyman et al.'s IOMTS, Bauer et al.'s MIO, Raclet et al.'s MI or our MIA. In this paper, we generalise MI to nondeterministic interfaces, for which we properly resolve the longstanding conflict between unspecified inputs being allowed in IA but forbidden in MTS. With this solution we achieve, in contrast to related work, an associative parallel composition, a compositional preorder, a conjunction on interfaces with dissimilar alphabets supporting perspective-based specifications, and a quotienting operator for decomposing nondeterministic specifications in a single theory. In addition, we define a hiding and a restriction operator, complement conjunction with a disjunction operator and illustrate our interface theory by means of a simple example. [ABSTRACT FROM AUTHOR] |
| 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: 116810597 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Nondeterministic Modal Interfaces. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Bujtor%2C+Ferenc%22">Bujtor, Ferenc</searchLink><relatesTo>1</relatesTo><i> ferenc.bujtor@informatik.uni-augsburg.de</i><br /><searchLink fieldCode="AR" term="%22Fendrich%2C+Sascha%22">Fendrich, Sascha</searchLink><relatesTo>2</relatesTo><i> sascha.fendrich@swt-bamberg.de</i><br /><searchLink fieldCode="AR" term="%22Lüttgen%2C+Gerald%22">Lüttgen, Gerald</searchLink><relatesTo>2</relatesTo><i> gerald.luettgen@swt-bamberg.de</i><br /><searchLink fieldCode="AR" term="%22Vogler%2C+Walter%22">Vogler, Walter</searchLink><relatesTo>1</relatesTo><i> walter.vogler@informatik.uni-augsburg.de</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Theoretical+Computer+Science%22">Theoretical Computer Science</searchLink>. Aug2016, Vol. 642, p24-53. 30p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Computer+interfaces%22">Computer interfaces</searchLink><br /><searchLink fieldCode="DE" term="%22Alphabet+--+Data+processing%22">Alphabet -- Data processing</searchLink><br /><searchLink fieldCode="DE" term="%22Machine+theory%22">Machine theory</searchLink><br /><searchLink fieldCode="DE" term="%22Operator+functions%22">Operator functions</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+input+design%22">Computer input design</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+equipment+design%22">Electronic equipment design</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Interface theories are employed in the component-based design of concurrent systems. They often emerge as combinations of Interface Automata (IA) and Modal Transition Systems (MTS), e.g., Nyman et al.'s IOMTS, Bauer et al.'s MIO, Raclet et al.'s MI or our MIA. In this paper, we generalise MI to nondeterministic interfaces, for which we properly resolve the longstanding conflict between unspecified inputs being allowed in IA but forbidden in MTS. With this solution we achieve, in contrast to related work, an associative parallel composition, a compositional preorder, a conjunction on interfaces with dissimilar alphabets supporting perspective-based specifications, and a quotienting operator for decomposing nondeterministic specifications in a single theory. In addition, we define a hiding and a restriction operator, complement conjunction with a disjunction operator and illustrate our interface theory by means of a simple example. [ABSTRACT FROM AUTHOR] – 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=116810597 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/j.tcs.2016.06.011 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 30 StartPage: 24 Subjects: – SubjectFull: Computer interfaces Type: general – SubjectFull: Alphabet -- Data processing Type: general – SubjectFull: Machine theory Type: general – SubjectFull: Operator functions Type: general – SubjectFull: Computer input design Type: general – SubjectFull: Electronic equipment design Type: general Titles: – TitleFull: Nondeterministic Modal Interfaces. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Bujtor, Ferenc – PersonEntity: Name: NameFull: Fendrich, Sascha – PersonEntity: Name: NameFull: Lüttgen, Gerald – PersonEntity: Name: NameFull: Vogler, Walter IsPartOfRelationships: – BibEntity: Dates: – D: 23 M: 08 Text: Aug2016 Type: published Y: 2016 Identifiers: – Type: issn-print Value: 03043975 Numbering: – Type: volume Value: 642 Titles: – TitleFull: Theoretical Computer Science Type: main |
| ResultId | 1 |
