![]() In this thesis we study embedded controllers implemented as sets of unsynchronized periodic processes. Finally, we have illustrated how GRL, muGRL, and CADP can be applied to model and verify concrete GALS applications, including industrial case-studies. Thesemantics of muGRL are defined by a translation into the MCL temporal logic supported by CADP. The muGRL language is based on a set of patterns capturing properties of concurrent and GALS systems, which reduces the complexity of using full-fledged temporal logics. The translation has been implemented by a tool named GRL2LNT, thus enabling state spaces to be automatically derived from GRL specifications.To enable the formal verification of GRL specifications, we have designed a property specification language, named muGRL, which is interpreted on GRL state spaces. For this purpose, we have defined a translation from GRL to the LNT specification language supported by CADP. To analyse GRL specifications, we took advantage of the CADP software toolbox for the verification of asynchronous concurrent processes, using state space exploration techniques. GRL enables the behavioural specification of synchronous components, asynchronous communication, and constraints involving both component paces and the data carried by component inputs. This thesis proposes a formal modelling and verification framework dedicated to GALS systems, with a focus on the asynchronous behaviour.As a cornerstone of our framework, we have designed a formal language, named GRL (GALS Representation Language). By using a logical model of time that can be associated with physical time, reactors also admit control over timing.Ī GALS (Globally Asynchronous, Locally Synchronous) system consists of several synchronous components that evolve concurrently, each with its own pace, and communicate altogether asynchronously. ![]() ![]() Reactors promote modularity and allow for distributed execution. We describe “reactors,” a new coordination model that combines ideas from several of the aforementioned approaches to enable determinism while preserving much of the style of actors. These existing approaches, however, tend to require centralized control, pose challenges to modular system design, or introduce a single point of failure. We show that nondeterminism can be handled in a number of ways, surveying dataflow dialects, process networks, synchronous-reactive models, and discrete-event models. As a consequence, actor programs may exhibit unintended behaviors and are less amenable to rigorous testing. While actors provide a more disciplined model for concurrency than threads, their interactions, if not constrained, admit nondeterminism. The compilation was defined formally and produces completely deterministic code, which respects the real-time semantics of the original program (period, deadlines, release dates and precedences) as well as its functional semantics (respect of data-dependencies).Īctors have become widespread in programming languages and programming frameworks focused on parallel and distributed computing. Communication is achieved by a tailor-made buffering communication protocol. It can be considered as a real-time software architecture language that enables to assemble locally mono-periodic synchronous systems into a globally multi-periodic synchronous system.The language compiler generates synchronized multi-task C code, that is independent of the target OS. The objective of the language is not to replace other synchronous languages but instead to provide a higher layer of abstraction, on top of classic synchronous languages. It adds real-time primitives to enable the programming of multi-periodic systems. ![]() It is built upon Synchronous Languages (such as Lustre) and inherits their formal properties. Thesis defines a high-level language for programming real-time embedded control systems. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |