Algorithms for synthesizing priorities in component-based systems

Chih Hong Cheng; Saddek Bensalem; Yu Fang Chen; Rongjie Yan; Barbara Jobstmann; Harald Ruess; Christian Buckl; Alois Knoll

doi:10.1007/978-3-642-24372-1_12

Algorithms for synthesizing priorities in component-based systems

Chih Hong Cheng
, Saddek Bensalem
, Yu Fang Chen
, Rongjie Yan
, Barbara Jobstmann
, Harald Ruess
, Christian Buckl
, Alois Knoll

Informatics 6 - Chair of Robotics, Artificial Intelligence and Real-time Systems

Technical University of Munich
UJF-Grenoble 1, CNRS VERIMAG UMR 5104
Academia Sinica, Institute of Information Science
ISCAS
Fortiss GmbH

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Scopus citations

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.

Original language	English
Title of host publication	Automated Technology for Verification and Analysis - 9th International Symposium, ATVA 2011, Proceedings
Pages	150-167
Number of pages	18
DOIs	https://doi.org/10.1007/978-3-642-24372-1_12
State	Published - 2011
Event	9th International Symposium on Automated Technology for Verification and Analysis, ATVA 2011 - Taipei, Taiwan, Province of China Duration: 11 Oct 2011 → 14 Oct 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6996 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	9th International Symposium on Automated Technology for Verification and Analysis, ATVA 2011
Country/Territory	Taiwan, Province of China
City	Taipei
Period	11/10/11 → 14/10/11

Access to Document

10.1007/978-3-642-24372-1_12

Cite this

Cheng, C. H., Bensalem, S., Chen, Y. F., Yan, R., Jobstmann, B., Ruess, H., Buckl, C., & Knoll, A. (2011). Algorithms for synthesizing priorities in component-based systems. In Automated Technology for Verification and Analysis - 9th International Symposium, ATVA 2011, Proceedings (pp. 150-167). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6996 LNCS). https://doi.org/10.1007/978-3-642-24372-1_12

Cheng, Chih Hong ; Bensalem, Saddek ; Chen, Yu Fang et al. / Algorithms for synthesizing priorities in component-based systems. Automated Technology for Verification and Analysis - 9th International Symposium, ATVA 2011, Proceedings. 2011. pp. 150-167 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{92b75673e9cd41cf9bc521e95aea241d,

title = "Algorithms for synthesizing priorities in component-based systems",

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.",

author = "Cheng, \{Chih Hong\} and Saddek Bensalem and Chen, \{Yu Fang\} and Rongjie Yan and Barbara Jobstmann and Harald Ruess and Christian Buckl and Alois Knoll",

year = "2011",

doi = "10.1007/978-3-642-24372-1\_12",

language = "English",

isbn = "9783642243714",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "150--167",

booktitle = "Automated Technology for Verification and Analysis - 9th International Symposium, ATVA 2011, Proceedings",

note = "9th International Symposium on Automated Technology for Verification and Analysis, ATVA 2011 ; Conference date: 11-10-2011 Through 14-10-2011",

}

Cheng, CH, Bensalem, S, Chen, YF, Yan, R, Jobstmann, B, Ruess, H, Buckl, C & Knoll, A 2011, Algorithms for synthesizing priorities in component-based systems. in Automated Technology for Verification and Analysis - 9th International Symposium, ATVA 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6996 LNCS, pp. 150-167, 9th International Symposium on Automated Technology for Verification and Analysis, ATVA 2011, Taipei, Taiwan, Province of China, 11/10/11. https://doi.org/10.1007/978-3-642-24372-1_12

Algorithms for synthesizing priorities in component-based systems. / Cheng, Chih Hong; Bensalem, Saddek; Chen, Yu Fang et al.
Automated Technology for Verification and Analysis - 9th International Symposium, ATVA 2011, Proceedings. 2011. p. 150-167 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6996 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Algorithms for synthesizing priorities in component-based systems

AU - Cheng, Chih Hong

AU - Bensalem, Saddek

AU - Chen, Yu Fang

AU - Yan, Rongjie

AU - Jobstmann, Barbara

AU - Ruess, Harald

AU - Buckl, Christian

AU - Knoll, Alois

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/80054064762

U2 - 10.1007/978-3-642-24372-1_12

DO - 10.1007/978-3-642-24372-1_12

M3 - Conference contribution

AN - SCOPUS:80054064762

SN - 9783642243714

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 150

EP - 167

BT - Automated Technology for Verification and Analysis - 9th International Symposium, ATVA 2011, Proceedings

T2 - 9th International Symposium on Automated Technology for Verification and Analysis, ATVA 2011

Y2 - 11 October 2011 through 14 October 2011

ER -

Cheng CH, Bensalem S, Chen YF, Yan R, Jobstmann B, Ruess H et al. Algorithms for synthesizing priorities in component-based systems. In Automated Technology for Verification and Analysis - 9th International Symposium, ATVA 2011, Proceedings. 2011. p. 150-167. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-24372-1_12

Algorithms for synthesizing priorities in component-based systems

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this