DLC: Compiling a Concurrent System Formal Specification to a Distributed Implementation

Evrard, Hugues

doi:10.1007/978-3-662-49674-9_34

Cited by 7 publications

(5 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…DLCshifumi and DLCround model distributed implementations of two well-known games: shifumi (rock-paper-scissors) and musical chairs. These two models, contrary to the three other ones, have not been written by hand in LNT, but produced automatically using the DLC tool [14,16]. DLC (Distributed LNT Compiler) generates, from an LNT specification, a distributed implementation running on a set of machines communicating through TCP sockets and synchronizing using the aforementioned Multi-waySync protocol.…”

Section: Featured Model Contributionmentioning

confidence: 99%

MCC’2017 – The Seventh Model Checking Contest

Kordon

Garavel

Hillah

et al. 2018

Transactions on Petri Nets and Other Models of Concurrency XIII

Self Cite

View full text Add to dashboard Cite

Created in 2011, the Model Checking Contest (MCC) is an annual competition dedicated to provide a fair evaluation of software tools that verify concurrent systems using state-space exploration techniques and model checking. This article presents the principles and results of the 2017 edition of the MCC, which took place along with the Petri Net and ACSD joint conferences in Zaragoza, Spain. 1 Goals and Scope of the Model Checking Contest The Model Checking Contest (MCC) is part of the growing trend of scientific contests, among which one can also mention: the SAT 1 and the SMT 2 competitions, the Hardware Model Checking Competition 3 , the Rigorous Examination of Reactive Systems challenge 4 , the Timing Analysis Contest 5 , and the Competition on Software Verification 6. The overall goal of these contests is to identify the theoretical approaches that

show abstract

Section: Featured Model Contributionmentioning

confidence: 99%

MCC’2017 – The Seventh Model Checking Contest

Kordon

Garavel

Hillah

et al. 2018

Transactions on Petri Nets and Other Models of Concurrency XIII

Self Cite

View full text Add to dashboard Cite

show abstract

“…• Distributed algorithms: verification and performance evaluation of mutual exclusion protocols 11 [79], verification of multiway synchronization protocols 12 [31,29,33], specification and rapid prototyping of Stanford's RAFT distributed consensus algorithm 13 [30,33], and performance evaluation of concurrent data structures 14 • Human-computer interaction: specification and validation of graphical user interfaces for a prototype control room of a nuclear power plant 19 [85] and of plastic user interfaces exploiting domain ontologies 20 [20] (Toulouse, France);…”

Section: Applications Of Lntmentioning

confidence: 99%

From LOTOS to LNT

Garavel

Lang

Serwe

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

International audienceWe revisit the early publications of Ed Brinksma devoted, on the one hand, to the definition of the formal description technique LOTOS (ISO International Standard 8807:1989) for specifying communication protocols and distributed systems, and, on the other hand, to two proposals (Extended LOTOS and Modular LOTOS) for making LOTOS a simpler and more expressive language. We examine how this scientific agenda has been dealt with during the last decades. We review the successive enhancements of LOTOS that led to the definition of three languages: E-LOTOS (ISO International Standard 15437:2001), then LOTOS NT, and finally LNT. We present the software implementations (compilers and translators) developed for these new languages and report about their use in various application domains

show abstract

“…One reason for this is the influence of CCS, which promotes an incompatible paradigm of binaryonly communication. Another reason is the high difficulty to properly implement multiway rendezvous, either in a sequential setting or in a distributed setting; for the latter point, which is even more difficult, let us mention recent work that implements the LOTOS multiway rendezvous among a collection of distributed processes interconnected by POSIX sockets [25] [24] [23]. However, concepts similar or close to the multiway rendezvous are indeed present in certain computer languages or models:…”

Section: The Multiway Rendezvousmentioning

confidence: 99%

The Unheralded Value of the Multiway Rendezvous: Illustration with the Production Cell Benchmark

Garavel¹,

Serwe²

2017

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

The multiway rendezvous introduced in Theoretical CSP is a powerful paradigm to achieve synchronization and communication among a group of (possibly more than two) processes. We illustrate the advantages of this paradigm on the production cell benchmark, a model of a real metal processing plant, for which we propose a compositional software controller, which is written in LNT and LOTOS, and makes intensive use of the multiway rendezvous.

show abstract

DLC: Compiling a Concurrent System Formal Specification to a Distributed Implementation

Cited by 7 publications

References 8 publications

MCC’2017 – The Seventh Model Checking Contest

MCC’2017 – The Seventh Model Checking Contest

From LOTOS to LNT

The Unheralded Value of the Multiway Rendezvous: Illustration with the Production Cell Benchmark

Contact Info

Product

Resources

About