A new method for describing the syntax and semantics of VIEWCHARTS

Authors:
Ayaz Isazadeh;Jaber Karimpour;Hosein Isazadeh
Affiliations:
Faculty of Mathematical Sciences, Tabriz University, Tabriz, Iran;Faculty of Mathematical Sciences, Tabriz University, Tabriz, Iran;Savalon Information Technology Inc. 79 Queensway, Ontario Canada
Venue:
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
Year:
2007

Citing 7
Cited 0

Statecharts: A visual formalism for complex systems

Science of Computer Programming
A Model of Visibility Control

IEEE Transactions on Software Engineering
On the power of cooperative concurrency

International Conference on Concurrency on Concurrency 88
On the power of bounded concurrency I: finite automata

Journal of the ACM (JACM)
An Algorithmic Semantics for Viewcharts

ICECCS '96 Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems
The STATEMATE Semantics of Statecharts

The STATEMATE Semantics of Statecharts
Behavioral views for software requirements engineering

Behavioral views for software requirements engineering

Quantified Score

Hi-index	0.00

Visualization

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 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).