Specifying reactive systems by abstract events

Authors:
E. Astesiano;G. Reggio
Affiliations:
Università di Genova, Genova Italy;Università di Genova, Genova Italy
Venue:
IWSSD '93 Proceedings of the 7th international workshop on Software specification and design
Year:
1993

Citing 7
Cited 1

Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends

Current trends in concurrency. Overviews and tutorials
Communication and concurrency

Communication and concurrency
Algebraic specification

Handbook of theoretical computer science (vol. B)
On the Nature of Events

MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Event Logic for Specifying Abstract Dynamic Data Types

Selected papers from the 8th Workshop on Specification of Abstract Data Types Joint with the 3rd COMPASS Workshop on Recent Trends in Data Type Specification
A Metalanguage for the Formal Requirement Specification of Reactive Systems

FME '93 Proceedings of the First International Symposium of Formal Methods Europe on Industrial-Strength Formal Methods
An introduction to event structures

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop

Very abstract specifications: a formalism independent approach

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the problem of specifying reactive systems at different level of abstraction and propose a method for connecting the requirement to the design phase. As in a variety of other approaches, we assume that a process is modelled by a labelled transition system. The requirement phase is supposed to define a class of models, while at the design level, usually via a stepwise refinement, essentially one model is singled out. The connection between the two phases is provided by the notion of abstract event, with its associated specification language. An abstract event is defined as a set of its concrete instances, which are labelled transition sequences and can occur as partial paths over labelled transition trees. Abstract events, which may be non-instantaneous and overlapping, are a flexible tool for expressing abstract requirements and, because of their semantics in term of labelled transition sequences, provide a rather transparent support to the refinement procedure.