Viewcharts: Syntax and Semantics.
Saved in:
| Title: | Viewcharts: Syntax and Semantics. |
|---|---|
| Authors: | Isazadeh, Ayaz1, Karimpour, Jaber1 karimpour@tabrizu.ac.ir |
| Source: | Informatica. 2008, Vol. 19 Issue 3, p345-362. 18p. 13 Diagrams. |
| Subjects: | Statecharts (Computer science), Structured techniques of electronic data processing, Machine theory, Information theory, Information science |
| Abstract: | In this paper, we present a method for describing the syntax and semantics of viewcharts. Viewcharts is a visual formalism for describing the dynamic behavior of system components. We define the syntax of viewcharts as attributed graphs and, based on this graph, describe dynamic semantics of viewcharts by object mapping automata. This approach covers many important constructs of viewcharts, including hierarchy of views, ownership of elements, scope, and composition of views in SEPARATE, OR and AND ways. It also covers completion and interlevel transitions as well as history transitions without violating the independence of views. Viewcharts was originally based on statecharts; in this paper we also change the basis of viewcharts to an extended version of Finite State Machine (EFSM). [ABSTRACT FROM AUTHOR] |
| Copyright of Informatica is the property of Vilnius University, Institute of Data Science & Digital Technologies 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: 34294384 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Viewcharts: Syntax and Semantics. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Isazadeh%2C+Ayaz%22">Isazadeh, Ayaz</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Karimpour%2C+Jaber%22">Karimpour, Jaber</searchLink><relatesTo>1</relatesTo><i> karimpour@tabrizu.ac.ir</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Informatica%22">Informatica</searchLink>. 2008, Vol. 19 Issue 3, p345-362. 18p. 13 Diagrams. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Statecharts+%28Computer+science%29%22">Statecharts (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Structured+techniques+of+electronic+data+processing%22">Structured techniques of electronic data processing</searchLink><br /><searchLink fieldCode="DE" term="%22Machine+theory%22">Machine theory</searchLink><br /><searchLink fieldCode="DE" term="%22Information+theory%22">Information theory</searchLink><br /><searchLink fieldCode="DE" term="%22Information+science%22">Information science</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: In this paper, we present a method for describing the syntax and semantics of viewcharts. Viewcharts is a visual formalism for describing the dynamic behavior of system components. We define the syntax of viewcharts as attributed graphs and, based on this graph, describe dynamic semantics of viewcharts by object mapping automata. This approach covers many important constructs of viewcharts, including hierarchy of views, ownership of elements, scope, and composition of views in SEPARATE, OR and AND ways. It also covers completion and interlevel transitions as well as history transitions without violating the independence of views. Viewcharts was originally based on statecharts; in this paper we also change the basis of viewcharts to an extended version of Finite State Machine (EFSM). [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Informatica is the property of Vilnius University, Institute of Data Science & Digital Technologies 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=34294384 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.15388/informatica.2008.217 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 18 StartPage: 345 Subjects: – SubjectFull: Statecharts (Computer science) Type: general – SubjectFull: Structured techniques of electronic data processing Type: general – SubjectFull: Machine theory Type: general – SubjectFull: Information theory Type: general – SubjectFull: Information science Type: general Titles: – TitleFull: Viewcharts: Syntax and Semantics. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Isazadeh, Ayaz – PersonEntity: Name: NameFull: Karimpour, Jaber IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 09 Text: 2008 Type: published Y: 2008 Identifiers: – Type: issn-print Value: 08684952 Numbering: – Type: volume Value: 19 – Type: issue Value: 3 Titles: – TitleFull: Informatica Type: main |
| ResultId | 1 |
