Browse by author
Lookup NU author(s): Dr Stephen Paynter
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Modes are a natural abstract way of structuring the behaviour of complex systems. The different ways in which a system can operate are associated with different modes, and transitions link modes to form mode-machines. However, mode-machines need a precise semantics if they are to be used for specifying the behaviour of critical systems. This paper analyses the possible relationships between modes and states. A number of concurrent systems described using MASCOT are considered, and their mode-based behaviour is used to motivate the semantics of a new real-time mode-machine notation, RTMMs. It is argued that RTMMs should not behave like abstract state-machines. A list of concurrent transactions is associated with each RTMM mode, and a notation is given for specifying their timing properties. RTMM transactions need not terminate when the central mode-controller switches mode, thus capturing the asynchronous way in which large systems respond to mode changes. RTMMs are given a proof-theoretic semantics using many-sorted logic, extended with the RTL occurrence relation, THgr.
Author(s): Paynter SE
Editor(s): Jonsson, B., Parrow, J.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT)
Year of Conference: 1996
Pages: 90-109
ISSN: 0302-9743 (Print) 1611-3349 (Online)
Publisher: Springer
URL: http://dx.doi.org/10.1007/3-540-61648-9_36
DOI: 10.1007/3-540-61648-9_36
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science
ISBN: 9783540616481
