Polynomial Synthesis of Asynchronous Automata

Details Polynomial Synthesis of Asynchronous Automata Polynomial Synthesis of Asynchronous Automata

2005-06-27

arxiv.org/abs/cs/0506096v1

Computer Science

Computational Complexity

The MOdelling and VErification (MOVE) team

Scientific paper

Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes with a distributed control structure called asynchronous automaton. This paper gives a polynomial algorithm for the synthesis of a non-deterministic asynchronous automaton from a regular Mazurkiewicz trace language. This new construction is based on an unfolding approach that improves the complexity of Zielonka's and Pighizzini's techniques in terms of the number of states.

Affiliated with

Also associated with

No associations

Rating

Polynomial Synthesis of Asynchronous 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 Polynomial Synthesis of Asynchronous Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial Synthesis of Asynchronous Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-646191