Efficient Solution of Language Equations Using Partitioned Representations

Details Efficient Solution of Language Equations Using Partitioned Representations Efficient Solution of Language Equations Using Partitioned Representations

2007-10-25

arxiv.org/abs/0710.4743v1

Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)

Computer Science

Logic in Computer Science

Submitted on behalf of EDAA (http://www.edaa.com/)

Scientific paper

A class of discrete event synthesis problems can be reduced to solving language equations f . X ⊆ S, where F is the fixed component and S the specification. Sequential synthesis deals with FSMs when the automata for F and S are prefix closed, and are naturally represented by multi-level networks with latches. For this special case, we present an efficient computation, using partitioned representations, of the most general prefix-closed solution of the above class of language equations. The transition and the output relations of the FSMs for F and S in their partitioned form are represented by the sets of output and next state functions of the corresponding networks. Experimentally, we show that using partitioned representations is much faster than using monolithic representations, as well as applicable to larger problem instances.

Affiliated with

Also associated with

No associations

Rating

Efficient Solution of Language Equations Using Partitioned Representations 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 Efficient Solution of Language Equations Using Partitioned Representations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Solution of Language Equations Using Partitioned Representations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-432319