Periodic scheduling of marked graphs using balanced binary words

Details Periodic scheduling of marked graphs using balanced binary words Periodic scheduling of marked graphs using balanced binary words

2012-02-22

arxiv.org/abs/1202.4912v1

Computer Science

Formal Languages and Automata Theory

No. RR-7891 (2012)

Scientific paper

This report presents an algorithm to statically schedule live and strongly connected Marked Graphs (MG). The proposed algorithm computes the best execution where the execution rate is maximal and place sizes are minimal. The proposed algorithm provides transition schedules represented as binary words. These words are chosen to be balanced. The contributions of this paper is the proposed algorithm itself along with the characterization of the best execution of any MG.

Affiliated with

Also associated with

No associations

Rating

Periodic scheduling of marked graphs using balanced binary words 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 Periodic scheduling of marked graphs using balanced binary words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Periodic scheduling of marked graphs using balanced binary words will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-415171