On the concurrent behaviour of SCR specifications

Authors:
Hyoung Seok Hong;Sung Deok Cha;Yong Rae Kwon
Affiliations:
-;-;-
Venue:
COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
Year:
1997

Citing 6
Cited 0

Automatic verification of finite-state concurrent systems using temporal logic specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automated consistency checking of requirements specifications

ACM Transactions on Software Engineering and Methodology (TOSEM)
State-Based Model Checking of Event-Driven System Requirements

IEEE Transactions on Software Engineering
Timed and Hybrid Statecharts and Their Textual Representation

Proceedings of the Second International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Timed Transition Systems

Proceedings of the Real-Time: Theory in Practice, REX Workshop
Specifying Software Requirements for Complex Systems: New Techniques and Their Application

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The SCR method models a system using a set of variables and state machines whose behaviour is described by tabular notations. This paper proposes an interleaving semantics for SCR specifications in terms of timed transition systems. The semantics is given by identifying each of the components of a timed transition system from a given SCR specification. The concurrent behaviour of a SCR specification is defined as a set of computations of the resulting timed transition system.