Algorithms for Synthesizing Priorities in Component-based Systems

Details Algorithms for Synthesizing Priorities in Component-based Systems Algorithms for Synthesizing Priorities in Component-based Systems

2011-07-06

arxiv.org/abs/1107.1383v2

Computer Science

Logic in Computer Science

Full version of the ATVA'11 paper (compared to the 1st arXiv version, we add one additional sentence to avoid confusion)

Scientific paper

We present algorithms to synthesize component-based systems that are safe and deadlock-free using priorities, which define stateless-precedence between enabled actions. Our core method combines the concept of fault-localization (using safety-game) and fault-repair (using SAT for conflict resolution). For complex systems, we propose three complementary methods as preprocessing steps for priority synthesis, namely (a) data abstraction to reduce component complexities, (b) alphabet abstraction and #-deadlock to ignore components, and (c) automated assumption learning for compositional priority synthesis.

Affiliated with

Also associated with

No associations

Rating

Algorithms for Synthesizing Priorities in Component-based Systems 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 Algorithms for Synthesizing Priorities in Component-based Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for Synthesizing Priorities in Component-based Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-678996