Cost-optimal timed trace synthesis for scheduling of intermittent embedded systems

DOI10.1007/S10626-022-00372-6zbMATH Open1519.93141OpenAlexW4313436192MaRDI QIDQ6160973FDOQ6160973

Authors: Antoine Bernabeu, Jean-Luc Béchennec, Mikaël Briday, Sebastien Faucou, Olivier H. Roux 

Publication date: 26 June 2023

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-022-00372-6

Recommendations

• Automatic verification of intermittent systems
• Hybrid Systems: Computation and Control
• Tools and Algorithms for the Construction and Analysis of Systems
• On using priced timed automata to achieve optimal scheduling
• scientific article; zbMATH DE number 2088657

zbMATH Keywords

optimizationschedulingPetri netintermittent computing

Mathematics Subject Classification ID

Synthesis problems (93B50) Discrete event control/observation systems (93C65)

Cites Work

• Optimal paths in weighted timed automata
• Title not available (Why is that?)
• On using priced timed automata to achieve optimal scheduling
• Title not available (Why is that?)
• A truthful mechanism for value-based scheduling in cloud computing
• Optimal reachability in cost time Petri nets
• Priced timed Petri nets
• Cost problems for parametric time Petri nets
• Sytare: A Lightweight Kernel for NVRAM-Based Transiently-Powered Systems

Cited In (2)

• Automatic verification of intermittent systems
• Modal crash types for intermittent computing

This page was built for publication: Cost-optimal timed trace synthesis for scheduling of intermittent embedded systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160973)