Issue
Leibniz Transactions on Embedded Systems, Volume 10, Issue 2
LITES, Volume 10, Issue 2
-
Part of:
Volume:
LITES, Volume 10
Journal: Leibniz Transactions on Embedded Systems (LITES)
Special Issue
Special Issue on Industrial Real-Time SystemsPublication Details
- published at: 2025-12-18
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Access Numbers
- Detailed Access Statistics available here
-
Total Accesses (updated on a weekly basis)
0Documents
Documents
No documents found matching your filter selection.
Document
Complete Issue
LITES, Volume 10, Issue 2, Complete Issue
Abstract
LITES, Volume 10, Issue 2, Complete Issue
Cite as
LITES, Volume 10, Issue 2: Special Issue on Industrial Real-Time Systems, pp. 1-68, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{LITES.10.2,
title = {{LITES, Volume 10, Issue 2, Complete Issue}},
journal = {Leibniz Transactions on Embedded Systems},
pages = {1--68},
ISSN = {2199-2002},
year = {2025},
volume = {10},
number = {2},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES.10.2},
URN = {urn:nbn:de:0030-drops-252695},
doi = {10.4230/LITES.10.2},
annote = {Keywords: LITES, Volume 10, Issue 2, Complete Issue}
}
Document
Front Matter
Front Matter, Table of Contents, List of Authors
Abstract
Front Matter, Table of Contents, List of Authors
Cite as
LITES, Volume 10, Issue 2: Special Issue on Industrial Real-Time Systems, pp. 0:i-0:viii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{LITES.10.2.0,
title = {{Front Matter, Table of Contents, List of Authors}},
journal = {Leibniz Transactions on Embedded Systems},
pages = {0:1--0:8},
ISSN = {2199-2002},
year = {2025},
volume = {10},
number = {2},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES.10.2.0},
URN = {urn:nbn:de:0030-drops-252686},
doi = {10.4230/LITES.10.2.0},
annote = {Keywords: Front Matter, Table of Contents, List of Authors}
}
Document
Integrating Multi-Level Mixed-Criticality into MCTS for Robust Resource Management
Abstract
Managing actions with uncertain resource costs is a complex challenge, particularly in autonomous robot mission planning. Robots are often assigned multiple objectives with varying criticality levels, ranging from catastrophic to minor impacts, where failures can significantly affect system safety. Uncertainties in worst-case costs of resources, such as energy and operating time - the time it takes to carry out an action - further complicate mission planning and execution.
Monte Carlo Tree Search (MCTS) is a powerful tool for online planning, yet it struggles to account for uncertainty in worst-case cost estimations. Optimistic estimates risk resource shortages, while pessimistic ones lead to inefficient allocation.
The Mixed-Criticality (MC) approach, originally developed for real-time systems to schedule critical tasks by allocating processing resources under Worst-Case Execution Time (WCET) uncertainty, provides a framework of rules, models and design principles. We claim this framework can be adapted to autonomous robot mission planning, where critical objectives are met through analogous allocation of different kinds of resources such as energy and operating time despite uncertainties.
We propose enhancing MCTS with MC principles to handle uncertainty in worst-case costs across multiple resources and criticality of objectives. High-critical objectives must always be completed, regardless of resource constraints, while low-critical objectives operate flexibly, consuming resources within optimistic estimates when possible or being discarded when resources become scarce. This ensures efficient resource reallocation and prioritization of high-critical objectives.
To implement this, we present (MC)²TS, a novel variant of MCTS that integrates MC principles for dynamic resource management. It supports more than two criticality levels to ensure that the most critical components meet the most stringent safety and reliability requirements, while also enabling robust resource management. By enabling replanning and mode changes, (MC)²TS improves MCTS’s efficiency and enhances MC systems’ adaptability to both degrading and improving resource conditions.
We evaluate (MC)²TS in an active perception scenario, where a drone retrieves data from distributed sensors under unpredictable environmental conditions. (MC)²TS outperforms MCTS by achieving more objectives, adapting plans when costs drop. It explores more objective sequences, minimizes oversizing, and enhances efficiency. Balancing safety and performance, it monitors robot battery, mission and objective resource constraints such as deadlines. Its robustness ensures low-critical objectives do not compromise high-critical objectives, making it a reliable solution for complex systems characterized by uncertain resource costs and critical objectives.
Cite as
Franco Cordeiro, Samuel Tardieu, and Laurent Pautet. Integrating Multi-Level Mixed-Criticality into MCTS for Robust Resource Management. In LITES, Volume 10, Issue 2 (2025): Special Issue on Industrial Real-Time Systems. Leibniz Transactions on Embedded Systems, Volume 10, Issue 2, pp. 1:1-1:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{cordeiro_et_al:LITES.10.2.1,
author = {Cordeiro, Franco and Tardieu, Samuel and Pautet, Laurent},
title = {{Integrating Multi-Level Mixed-Criticality into MCTS for Robust Resource Management}},
journal = {Leibniz Transactions on Embedded Systems},
pages = {1:1--1:23},
ISSN = {2199-2002},
year = {2025},
volume = {10},
number = {2},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES.10.2.1},
URN = {urn:nbn:de:0030-drops-252339},
doi = {10.4230/LITES.10.2.1},
annote = {Keywords: Embedded Systems, Safety / Mixed-Critical Systems, Real-Time Systems, Energy Aware Systems}
}
Document
Improved Elastic Scheduling Algorithms for Implicit-Deadline Tasks
Abstract
Elastic scheduling provides a framework under which the utilizations of recurrent tasks are reduced by increasing their periods in response to system overload. The original elastic scheduling model was proposed by Buttazzo et al. in 1998 for implicit-deadline tasks on a uniprocessor and decreases task utilizations to satisfy a schedulable utilization bound. In 2019, Orr and Baruah extended the framework to multiprocessor scheduling of implicit-deadline tasks. In this paper, we propose, analyze, and evaluate new elastic scheduling algorithms for several of the scheduling policies considered in these prior works. In particular, (i) we evaluate an algorithm that we proposed as a short note in the Real-Time Systems journal and demonstrate that it allows for faster admission control than the algorithm of Buttazzo et al. when applied to uniprocessor and fluid scheduling. (ii) We also present faster elastic scheduling algorithms for partitioned EDF scheduling. Finally, (iii) we provide polynomial-time exact elastic scheduling algorithms for global EDF and global RM.
Cite as
Marion Sudvarg, Christopher Gill, and Sanjoy Baruah. Improved Elastic Scheduling Algorithms for Implicit-Deadline Tasks. In LITES, Volume 10, Issue 2 (2025): Special Issue on Industrial Real-Time Systems. Leibniz Transactions on Embedded Systems, Volume 10, Issue 2, pp. 2:1-2:36, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{sudvarg_et_al:LITES.10.2.2,
author = {Sudvarg, Marion and Gill, Christopher and Baruah, Sanjoy},
title = {{Improved Elastic Scheduling Algorithms for Implicit-Deadline Tasks}},
journal = {Leibniz Transactions on Embedded Systems},
pages = {2:1--2:36},
ISSN = {2199-2002},
year = {2025},
volume = {10},
number = {2},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES.10.2.2},
URN = {urn:nbn:de:0030-drops-252346},
doi = {10.4230/LITES.10.2.2},
annote = {Keywords: real-time systems, elastic scheduling, scheduling algorithms}
}