Algorithms for synthesizing priorities in component-based systems
From MaRDI portal
Publication:3172911
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.
Recommendations
Cited in
(5)- Building distributed controllers for systems with priorities
- Formal Methods for Components and Objects
- A method for the automatic deduction of priority lists of entities and tasks from the design knowledge
- scientific article; zbMATH DE number 1759390 (Why is no real title available?)
- On the hardness of priority synthesis
This page was built for publication: Algorithms for synthesizing priorities in component-based systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172911)