Verifying a Real-Time Language with Constraints

Bart, Anicet; Truchet, Charlotte; Monfroy, Éric

doi:10.1109/ictai.2015.124

Cited by 2 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The goal of real-time scheduling under energy constraints is to ensure the execution of all the tasks at run-time without missing the deadlines while ensuring a rational use of remaining energy until the next recharge. Several studies have been performed in this context such as the research works reported in [5], [4], [6], [7], [8], [9], [10] and [11] to solve the scheduling problem in real-time systems under energy constraints. The real-time reconfigurable embedded systems are required to produce more flexible and adaptable solutions.…”

Section: State Of the Artmentioning

confidence: 99%

Real-Time Scheduling of Reconfigurable Battery-Powered Multi-Core Platforms

Gammoudi

Benzina

Khalgui

et al. 2016

2016 IEEE 28th International Conference on Tools With Artificial Intelligence (ICTAI)

View full text Add to dashboard Cite

This paper deals with the real-time scheduling in a reconfigurable multi-core platform powered by a rechargeable battery. A reconfiguration scenario is defined as an operation that allows the addition-removal-modification of tasks which may result in timing unfeasibility. Such a system may face several scenarios: i) increased power consumption that, in the worst case, may surpass the available energy budget, ii) increased computing demand, which may lead to the violation of real-time constraints, and iii) increased memory demand, potentially exceeding the provided memory capacity. To prevent these problems during the execution, a new scheduling strategy is necessary. The proposal is based on the assignment of tasks to different processor cores to satisfy these constraints simultaneously after any reconfiguration scenario. The effectiveness and performance of the designed approach are evaluated through simulation studies. An intelligent tool named Reconf-Pack is developed in our research laboratory to support this new proposed approach and to simulate it over randomly generated tasks.

show abstract

Section: State Of the Artmentioning

confidence: 99%

Real-Time Scheduling of Reconfigurable Battery-Powered Multi-Core Platforms

Gammoudi

Benzina

Khalgui

et al. 2016

2016 IEEE 28th International Conference on Tools With Artificial Intelligence (ICTAI)

View full text Add to dashboard Cite

show abstract

“…For example, the effect statement x := x+3 is not a constraint since the assignment := is a function, not a relation, and thus the constraint x = x + 3 is unsatisfiable. In existing approaches, this problem is solved by giving a stream interpretation to the variables [BTM11,LLLS11,LL14]. The variables are coupled with a timestamp and form a sequence of values (v 1 , v 2 , .…”

Section: Existential Constraint Systemmentioning

confidence: 99%

Spacetime programming: a synchronous language for constraint search

Talbot

2023

Constraints

View full text Add to dashboard Cite

Constraint programming is a paradigm for computing with mathematical relations named constraints. It is a declarative approach to describe many real-world problems including scheduling, vehicles routing, biology and musical composition. Constraint programming must be contrasted with procedural approaches that describe how a problem is solved, whereas constraint models describe what the problem is. The part of how a constraint problem is solved is left to a general constraint solver. Unfortunately, there is no solving algorithm efficient enough to every problem, because the search strategy must often be customized per problem to attain reasonable efficiency. This is a daunting task that requires expertise and good understanding on the solver's intrinsics. Moreover, higher-level constraint-based languages provide limited support to specify search strategies.In this dissertation, we tackle this challenge by designing a programming language for specifying search strategies. The dissertation is constructed around two axes: (i) a novel theory of constraint programming based on lattice theory, and (ii) a programming language, called spacetime programming, building on lattice theory for its data structures and on synchronous programming for its computational model.The first part formalizes the components of inference and search in a constraint solver. This allows us to scrutinize various constraint-based languages through the same underlying foundations. In this respect, we give the semantics of several paradigms including constraint logic programming and concurrent constraint programming using lattices. The second part is dedicated to building a practical language where search strategies can be easily composed. Compositionality consists of taking several distinct strategies and, via some operators, to compose these in order to obtain a new strategy. Existing proposals include extensions to logic programming, monadic constraint programming and search combinators, but all suffer from different drawbacks as explained in the dissertation. The original aspect of spacetime programming is to make use of a temporal dimension, offered by the synchronous paradigm, to compose and synchronize search strategies on a shared logical clock.This paradigm opens the door to new and more complex search strategies in constraint programming but also in applications requiring backtracking search. We demonstrated its usefulness in an interactive computer-aided composition system where we designed a search strategy to help the composer navigating in the state space generated by a musical constraint problem. We also explored a model checking algorithm where a model dynamically generates a constraint satisfaction problem (CSP) representing the reachability of some states. Although these applications are experimental, they hint at the suitability of spacetime programming in a larger context. v AcknowledgementsJe remercie très chaleureusement Emmanuel Chailloux qui, après un Skype mémorable, m'a accepté pour ma dernière année en Master, et qui m'a ...

show abstract

Verifying a Real-Time Language with Constraints

Abstract: International audienc

Cited by 2 publications

References 12 publications

Real-Time Scheduling of Reconfigurable Battery-Powered Multi-Core Platforms

Real-Time Scheduling of Reconfigurable Battery-Powered Multi-Core Platforms

Spacetime programming: a synchronous language for constraint search

Contact Info

Product

Resources

About