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. © 2011 Springer-Verlag.
CITATION STYLE
Cheng, C. H., Bensalem, S., Chen, Y. F., Yan, R., Jobstmann, B., Ruess, H., … Knoll, A. (2011). Algorithms for synthesizing priorities in component-based systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6996 LNCS, pp. 150–167). https://doi.org/10.1007/978-3-642-24372-1_12
Mendeley helps you to discover research relevant for your work.