A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Algorithms for Synthesizing Priorities in Component-Based Systems
[chapter]
2011
Lecture Notes in Computer Science
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 faultlocalization (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
doi:10.1007/978-3-642-24372-1_12
fatcat:hseg2zm5ibgklpdejruazyoyqe