Development of a Schedulability Analysis Framework Based on pTPN and UPPAAL with Stopwatches

Cicirelli, Franco; Furfaro, Angelo; Nigro, Libero; Pupo, Francesco

doi:10.1109/ds-rt.2012.16

Cited by 14 publications

(12 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…That is, due to the underlying undecidability result [19], instead of concluding that a task set is "schedulable" or "not schedulable," the evaluated stopwatch-based tests yield "may not be schedulable" as the analysis result for almost all task sets, unless the task set has only two tasks and the total sum of WCETs is less than the shortest period. To the best of our knowledge, this is a new observation; prior work on stopwatchbased tests [14,17,18] did not report on empirical evaluations of the tests in the context of non-preemptive workloads.…”

Section: Motivation and Pitfallsmentioning

confidence: 92%

“…Stopwatch limitations. Since UPPAAL introduced stopwatches in version 4.1, several TA-based schedulability tests have used stopwatches for the analysis of preemptive and non-preemptive tasks [14,17,18]. However, in our experiments (Sec.…”

Section: Motivation and Pitfallsmentioning

confidence: 99%

“…The TA formalism has been previously leveraged in a number of schedulability tests for preemptive tasks scheduled by a global scheduling policy upon a multiprocessor platform [12]- [18]. These tests, however, are not designed for self-suspending tasks, cannot handle blocking times caused by non-preemptive execution, and some use stopwatches (e.g., [14,17,18]) that render the TA reachability problem undecidable [19]. As we discuss in Sec.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An Exact Schedulability Test for Non-Preemptive Self-Suspending Real-Time Tasks

Yalcinkaya

Nasri

Brandenburg

2019

2019 Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE)

View full text Add to dashboard Cite

Exact schedulability analysis of limited-preemptive (or non-preemptive) real-time workloads with variable execution costs and release jitter is a notoriously difficult challenge due to the scheduling anomalies inherent in non-preemptive execution. Furthermore, the presence of self-suspending tasks is well-understood to add tremendous complications to an already difficult problem. By mapping the schedulability problem to the reachability problem in timed automata (TA), this paper provides the first exact schedulability test for this challenging model. Specifically, using TA extensions available in UPPAAL, this paper presents an exact schedulability test for sets of periodic and sporadic self-suspending tasks with fixed preemption points that are scheduled upon a multiprocessor under a global fixedpriority scheduling policy. To the best of our knowledge, this is the first exact schedulability test for non-and limited-preemptive self-suspending tasks (for both uniprocessor and multiprocessor systems), and thus also the first exact schedulability test for the special case of global non-preemptive fixed-priority scheduling (for either periodic or sporadic tasks). Additionally, the paper highlights some subtle pitfalls and limitations in existing TAbased schedulability tests for non-preemptive workloads.

show abstract

Section: Motivation and Pitfallsmentioning

confidence: 92%

Section: Motivation and Pitfallsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Exact Schedulability Test for Non-Preemptive Self-Suspending Real-Time Tasks

Yalcinkaya

Nasri

Brandenburg

2019

2019 Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE)

View full text Add to dashboard Cite

show abstract

“…Note that the first executed node is specified by the function rootNode. The case-statement of timer is responsible for node execution (Lines [26][27][28][29][30]. A node is executed if the required number of tokens is reached and the processor is idle (Line 28).…”

Section: Modular Translationmentioning

confidence: 99%

“…The TPNs are defined as the parallel composition of the TA of the transitions plus a supervisory TA that is responsible to synchronize all transitions of the TPN. This work has served as a basis for Cicirelli to verify Time Stream Petri Nets in [29] and Preemptive Time Petri Nets in [30]. Similar to Cassez and Cicirelli, our centralized-control translation has a supervisor TA.…”

mentioning

confidence: 96%

Comparing model checkers for timed UML activity diagrams

Daw

Cleaveland

2015

Science of Computer Programming

View full text Add to dashboard Cite

This paper describes the results of an experimental study on the use of model checkers to verify properties of UML activity diagrams. The motivation for the study derives from the desirability of checking properties of systems early in the development process, and the fact that UML is a commonly used notation for system models. The study assesses the performance of different model checking tools, and strategies for converting activity diagrams into the tools input notation, for a class of real time activity diagrams used in medical device design. This paper compares different translations for four model checkers in particular: UPPAAL, PES, SPIN and NuSMV. The performance of these model checkers is then compared using a suite of UML activity diagrams of varying complexity developed by us for this purpose. The results of a case study involving the design of an infusion pump are also presented.

show abstract

Modelling and Analysis of Parallel/Distributed Time-dependent Systems: An Approach Based on JADE

Cicirelli

Nigro

2014

Internet and Distributed Computing Systems

View full text Add to dashboard Cite

Development of a Schedulability Analysis Framework Based on pTPN and UPPAAL with Stopwatches

Cited by 14 publications

References 15 publications

An Exact Schedulability Test for Non-Preemptive Self-Suspending Real-Time Tasks

An Exact Schedulability Test for Non-Preemptive Self-Suspending Real-Time Tasks

Comparing model checkers for timed UML activity diagrams

Modelling and Analysis of Parallel/Distributed Time-dependent Systems: An Approach Based on JADE

Contact Info

Product

Resources

About