A Taxonomy-Driven Approach to Visually Prototyping Pervasive Computing Applications

Drey, Zoé; Mercadal, Julien; Consel, Charles

doi:10.1007/978-3-642-03034-5_5

Cited by 17 publications

(17 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Yet, our approach requires domain experts, experienced architects and developers. An ongoing project is to provide end users and caregivers with a visual environment and a methodology to develop orchestration rules on top of DiaSuite, given a taxonomy of assistive building blocks [17].…”

Section: Ongoing and Future Case Studiesmentioning

confidence: 99%

DiaSuite: A tool suite to develop Sense/Compute/Control applications

Bertran

Bruneau

Cassou

et al. 2014

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

a b s t r a c tWe present DiaSuite, a tool suite that uses a software design approach to drive the development process. DiaSuite focuses on a specific domain, namely Sense/Compute/Control (SCC) applications. It comprises a domain-specific design language, a compiler producing a Java programming framework, a 2D-renderer to simulate an application, and a deployment framework. We have validated our tool suite on a variety of concrete applications in areas including telecommunications, building automation, robotics and avionics.

show abstract

Section: Ongoing and Future Case Studiesmentioning

confidence: 99%

DiaSuite: A tool suite to develop Sense/Compute/Control applications

Bertran

Bruneau

Cassou

et al. 2014

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…The formal semantics of DisCo are expressed in terms of TLA [25]. A visual language is translated to TLA + in [26] and TLC used for validation. The above works are concerned with encoding control flow of visual languages into TLA + , while the focus in our work is much more on a faithful translation of B with its datatypes and operators to TLA + .…”

Section: Other Uses Of Tlc and Embeddings Of Tla +mentioning

confidence: 99%

Translating B to TLA+ for validation with TLC

Hansen

Leuschel

2016

Science of Computer Programming

View full text Add to dashboard Cite

The state-based formal methods B and TLA + share the common base of predicate logic, arithmetic and set theory. However, there are still considerable differences, such as the way to specify state transitions, the different approaches to typing, and the available tool support. In this paper, we present a translation from B to TLA + so as to validate B specifications using the model checker TLC. The translation includes many adaptations and optimizations to allow for efficient checking by TLC. Moreover, we present a way to validate liveness properties for B specifications under fairness conditions. Our implemented translator, Tlc4B, automatically translates a B specification to TLA + , invokes the model checker TLC, and translates the results back to B. We use ProB to double check the counter examples produced by TLC and replay them in the ProB animator. Tlc4B can also transmit constant values, precalculated by ProB, to TLC. This allows the user to combine the strength of both tools, i.e. ProB's constraint solving abilities and TLC's highly tuned model checking core. Furthermore, we demonstrate an approach to optimize the model checking process by encoding proof information in the translated TLA + specification. We also present a series of case studies and benchmark tests comparing Tlc4B and ProB.

show abstract

“…Pentagruel (Drey et al, 2009)). Design patterns, best practices and example scenarios need to be conceived to create specific behaviours and services, for instance, the Sense/Compute/Control model proposed by Cassou et al (2011).…”

Section: Enabling Thingsmentioning

confidence: 99%