A time petri net based approach for embedded hard real-time software synthesis with multiple operational modes

Authors:
Eduardo Tavares;Paulo Maciel;Arthur Bessa;Raimundo Barreto;Leonardo Barros;Meuse Oliveira, Jr;Ricardo Lima
Affiliations:
Un1iversidade Federal de Pernambuco, Recife-Brazil;Un1iversidade Federal de Pernambuco, Recife-Brazil;Un1iversidade Federal de Pernambuco, Recife-Brazil;Institute for Clarity in Documentation, Wallamaloo, New Zealand;Institute for Clarity in Documentation, Wallamaloo, New Zealand;Institute for Clarity in Documentation, Wallamaloo, New Zealand;Institute for Clarity in Documentation, Wallamaloo, New Zealand
Venue:
SBCCI '05 Proceedings of the 18th annual symposium on Integrated circuits and system design
Year:
2005

Citing 5
Cited 1

Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations

IEEE Transactions on Software Engineering
Software synthesis for real-time information processing systems

LCTES '95 Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, & tools for real-time systems
Comment on "A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems"

IEEE Transactions on Software Engineering
Synthesis of embedded software using free-choice Petri nets

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
A Framework for Scheduler Synthesis

RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium

The interval page table: virtual memory support in real-time and memory-constrained embedded systems

Proceedings of the 20th annual conference on Integrated circuits and systems design

Quantified Score

Hi-index	0.00

Visualization

Abstract

In general, complex embedded systems rely on specialized operating system kernels. However, the operating system usage may introduce significant time overhead, which may affect the tasks' deadline in embedded hard real-time systems. In addition, hardware requirements (e.g. memory) are usually increased.As an alternative, this paper presents a software synthesis approach for eliminating such overheads, meeting timing constraints, and providing multiple operational modes. In order to satisfy timing requirements, a pre-runtime scheduling is used to find a feasible schedule by adopting a formalism based on time Petri net. Pre-runtime scheduling is considered inflexible, but using multiple operational modes, significant flexibility may be achieved.