The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
Composition and behaviors of probabilistic I/O automata
Theoretical Computer Science
Synchronous Programming of Reactive Systems
Synchronous Programming of Reactive Systems
Temporal concurrent constraint programming: denotation, logic and applications
Nordic Journal of Computing
Stochastic Process Algebra: From an Algebraic Formalism to an Architectural Description Language
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Automatic Testing of Reactive Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Describing and Executing Random Reactive Systems
SEFM '06 Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods
International Journal on Software Tools for Technology Transfer (STTT)
Hi-index | 0.00 |
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infinite sequence of input/output reactions. More precisely, it is dedicated to the description and the execution of constrained random scenarios. Its first use is for test sequence specification and generation. It can also be useful for early simulation of huge systems, where Lutin programs can be used to describe and simulate modules that are not yet fully developed. The programming style mixes relational and imperative features. Basic statements are input/output relations, expressing constraints on a single reaction. Those constraints are then combined to describe non deterministic sequences of reactions. The language constructs are inspired by regular expressions, and process algebra (sequence, choice, loop, concurrency). Moreover, the set of statements can be enriched with user defined operators. A notion of stochastic directive is also provided, in order to finely influence the selection of a particular class of scenarios.