TY - GEN
T1 - Parameterized systems in BIP
T2 - 27th International Conference on Concurrency Theory, CONCUR 2016
AU - Konnov, Igor
AU - Kotek, Tomer
AU - Wang, Qiang
AU - Veith, Helmut
AU - Bliudze, Simon
AU - Sifakis, Joseph
N1 - Publisher Copyright:
© Igor Konnov, Tomer Kotek, Qiang Wang, Helmut Veith, Simon Bliudze, and Joseph Sifakis; licensed under Creative Commons License CC-BY.
PY - 2016/8/1
Y1 - 2016/8/1
N2 - BIP is a component-based framework for system design built on three pillars: behavior, interaction, and priority. In this paper, we introduce first-order interaction logic (FOIL) that extends BIP without priorities to systems parameterized in the number of components. We show that FOIL captures classical parameterized architectures such as token-passing rings, cliques of identical components communicating with rendezvous or broadcast, and client-server systems. Although the BIP framework includes efficient verification tools for statically-defined systems, none are available for parameterized systems with an unbounded number of components. On the other hand, the parameterized model checking literature contains a wealth of techniques for systems of classical architectures. However, application of these results requires a deep understanding of parameterized model checking techniques and their underlying mathematical models. To overcome these difficulties, we introduce a framework that automatically identifies parameterized model checking techniques applicable to a BIP design. To our knowledge, this is the first framework that allows one to apply prominent parameterized model checking results in a systematic way.
AB - BIP is a component-based framework for system design built on three pillars: behavior, interaction, and priority. In this paper, we introduce first-order interaction logic (FOIL) that extends BIP without priorities to systems parameterized in the number of components. We show that FOIL captures classical parameterized architectures such as token-passing rings, cliques of identical components communicating with rendezvous or broadcast, and client-server systems. Although the BIP framework includes efficient verification tools for statically-defined systems, none are available for parameterized systems with an unbounded number of components. On the other hand, the parameterized model checking literature contains a wealth of techniques for systems of classical architectures. However, application of these results requires a deep understanding of parameterized model checking techniques and their underlying mathematical models. To overcome these difficulties, we introduce a framework that automatically identifies parameterized model checking techniques applicable to a BIP design. To our knowledge, this is the first framework that allows one to apply prominent parameterized model checking results in a systematic way.
KW - BIP
KW - Parameterized model checking
KW - Rigorous system design
KW - Verification
U2 - 10.4230/LIPIcs.CONCUR.2016.30
DO - 10.4230/LIPIcs.CONCUR.2016.30
M3 - Conference contribution
AN - SCOPUS:85012905095
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 27th International Conference on Concurrency Theory, CONCUR 2016
A2 - Desharnais, Josee
A2 - Jagadeesan, Radha
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Y2 - 23 August 2016 through 26 August 2016
ER -