Behaviour, Interaction and Dynamics

The growth and diffusion of reconfigurable and adaptive systems motivate the foundational study of models of software connectors that can evolve dynamically, as opposed to the better understood notion of static connectors. In this paper we investigate the interplay of behaviour, interaction and dynamics in the context of the BIP component framework, here denoted BI(P), as we disregard priorities. We introduce two extensions of BIP: 1) reconfigurable BI(P) allows to reconfigure the set of admissible interactions, while preserving the set of interacting components; 2) dynamic BI(P) allows to spawn new components and interactions during execution. Our main technical results show that reconfigurable BI(P) is as expressive as BI(P), while dynamic BI(P) allows to deal with infinite state systems. Still, we show that reachability remains decidable for dynamic BI(P).

[1]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[2]  Alexander L. Wolf,et al.  Acm Sigsoft Software Engineering Notes Vol 17 No 4 Foundations for the Study of Software Architecture , 2022 .

[3]  Parosh Aziz Abdulla,et al.  Advanced Ramsey-Based Büchi Automata Inclusion Testing , 2011, CONCUR.

[4]  M. Nielsen,et al.  Decidability Issues for Petri Nets , 1994 .

[5]  Paul Gastin,et al.  CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings , 2010, CONCUR.

[6]  Francesco Tiezzi,et al.  A Formal Account of WS-BPEL , 2008, COORDINATION.

[7]  Mirko Viroli.  A core calculus for correlation in orchestration languages , 2007, J. Log. Algebraic Methods Program..

[8]  Joseph Sifakis,et al.  Modeling Dynamic Architectures Using Dy-BIP , 2012, SC@TOOLS.

[9]  Joseph Sifakis,et al.  Modeling Heterogeneous Real-time Components in BIP , 2006, Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM'06).

[10]  Joseph Sifakis,et al.  Causal semantics for the algebra of connectors , 2008, Formal Methods Syst. Des..

[11]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[12]  Roberto Bruni,et al.  Connector algebras for C/E and P/T nets' interactions , 2013, Log. Methods Comput. Sci..

[13]  Fabio Gadducci,et al.  The tile model , 2000, Proof, Language, and Interaction.

[14]  Mark A. Hillebrand,et al.  Invariants, Modularity, and Rights , 2009, Ershov Memorial Conference.

[15]  Roberto Bruni,et al.  A basic algebra of stateless connectors , 2006, Theor. Comput. Sci..

[16]  Martin Wirsing,et al.  Extraction of Structured Programs from Specification Proofs , 1999, WADT.

[17]  Farhad Arbab,et al.  Tiles for Reo , 2009, WADT.

[18]  Pawel Sobocinski,et al.  Representations of Petri Net Interactions , 2010, CONCUR.

[19]  Marsha Chechik,et al.  CONCUR 2008 - Concurrency Theory, 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings , 2008, CONCUR.

[20]  Farhad Arbab,et al.  Coordination Models and Languages , 1998, Adv. Comput..

[21]  Roberto Bruni,et al.  A Connector Algebra for P/T Nets Interactions , 2011, CONCUR.

[22]  Roberto Bruni,et al.  Connector Algebras, Petri Nets, and BIP , 2011, Ershov Memorial Conference.

[23]  Joseph Sifakis,et al.  Synthesizing Glue Operators from Glue Constraints for the Construction of Component-Based Systems , 2011, SC@TOOLS.

[24]  Joseph Sifakis,et al.  A Notion of Glue Expressiveness for Component-Based Systems , 2008, CONCUR.