Algorithms for Synthesizing Priorities in Component-based Systems
Logic in Computer Science
2011-10-10 v2 Systems and Control
Abstract
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.
Cite
@article{arxiv.1107.1383,
title = {Algorithms for Synthesizing Priorities in Component-based Systems},
author = {Chih-Hong Cheng and Saddek Bensalem and Yu-Fang Chen and Rongjie Yan and Barbara Jobstmann and Harald Ruess and Christian Buckl and Alois Knoll},
journal= {arXiv preprint arXiv:1107.1383},
year = {2011}
}
Comments
Full version of the ATVA'11 paper (compared to the 1st arXiv version, we add one additional sentence to avoid confusion)