Electronic Notes in Theoretical Computer Science · 2008 · 10 citations · 10 references
ComputingComputer ScienceComputer SystemsProgramming LanguagesSyntaxSystems ProgrammingConcurrent ProgrammingDomain-specific LanguagesProcess AlgebraSpecification LanguagesOperational SemanticsReactive ProgrammingReactive System ModelingReactive SystemsRegular ExpressionsScenario-based ExecutionStochastic Process AlgebraStructural Operational Semantics
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.
10
The synchronous data flow programming language LUSTRE
Nicolas Halbwachs, P. Caspi, Pascal Raymond et al. · Proceedings of the IEEE · 1991 · 1.5K citations · Full text
An Introduction to Input/Output Automata
Nancy Lynch, Mark R. Tuttle · Formal Aspects of Computing · 2026 · 1K citations · Full text