The Internet Archive has a preservation copy of this work in our general collections.
The file type is
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 andarXiv:1107.1383v2 fatcat:pz5knxfmavbz5dkppagtaywltu