An Introduction to Time-Constrained Automata

Details An Introduction to Time-Constrained Automata An Introduction to Time-Constrained Automata

2010-10-27

arxiv.org/abs/1010.5571v1

EPTCS 38, 2010, pp. 83-98

Computer Science

Logic in Computer Science

In Proceedings ICE 2010, arXiv:1010.5308

Scientific paper

10.4204/EPTCS.38.9

We present time-constrained automata (TCA), a model for hard real-time computation in which agents behaviors are modeled by automata and constrained by time intervals. TCA actions can have multiple start time and deadlines, can be aperiodic, and are selected dynamically following a graph, the time-constrained automaton. This allows expressing much more precise time constraints than classical periodic or sporadic model, while preserving the ease of scheduling and analysis. We provide some properties of this model as well as their scheduling semantics. We show that TCA can be automatically derived from source-code, and optimally scheduled on single processors using a variant of EDF. We explain how time constraints can be used to guarantee communication determinism by construction, and to study when possible agent interactions happen.

Affiliated with

Also associated with

No associations

Rating

An Introduction to Time-Constrained Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Introduction to Time-Constrained Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Introduction to Time-Constrained Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-484650