Statecharts: A visual formalism for complex systems
Science of Computer Programming
IEEE Transactions on Software Engineering
On the power of cooperative concurrency
International Conference on Concurrency on Concurrency 88
Specification and proof in real-time CSP
Specification and proof in real-time CSP
On the power of bounded concurrency I: finite automata
Journal of the ACM (JACM)
Formalization and application of a unifying model for name management
SIGSOFT '95 Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering
ACM Computing Surveys (CSUR)
Communicating sequential processes
Communications of the ACM
An Algorithmic Semantics for Viewcharts
ICECCS '96 Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems
Requirements Documentation: Why a Formal Basis is Essential
ICRE '00 Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00)
The STATEMATE Semantics of Statecharts
The STATEMATE Semantics of Statecharts
Behavioral views for software requirements engineering
Behavioral views for software requirements engineering
| Hi-index | 0.00 |
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).