Behaviour, Interaction and Dynamics

详细信息    查看全文

• 作者：Roberto Bruni (19)
  Hernán Melgratti (20)
  Ugo Montanari (19)
  
• 刊名：Lecture Notes in Computer Science
• 出版年：2014
• 出版时间：2014
• 年：2014
• 卷：8373
• 期：1
• 页码：382-401
• 全文大小：401 KB
• 参考文献：1. Arbab, F., Bruni, R., Clarke, D., Lanese, I., Montanari, U.: Tiles for Reo. In: Corradini, A., Montanari, U. (eds.) WADT 2008. LNCS, vol.?5486, pp. 37-5. Springer, Heidelberg (2009) CrossRef
  2. Basu, A., Bozga, M., Sifakis, J.: Modeling heterogeneous real-time components in BIP. In: Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2006), pp. 3-2. IEEE Computer Society (2006)
  3. Bliudze, S., Sifakis, J.: A notion of glue expressiveness for component-based systems. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.?5201, pp. 508-22. Springer, Heidelberg (2008) CrossRef
  4. Bliudze, S., Sifakis, J.: Causal semantics for the algebra of connectors. Formal Methods in System Design?36(2), 167-94 (2010) CrossRef
  5. Bliudze, S., Sifakis, J.: Synthesizing glue operators from glue constraints for the construction of component-based systems. In: Apel, S., Jackson, E. (eds.) SC 2011. LNCS, vol.?6708, pp. 51-7. Springer, Heidelberg (2011) CrossRef
  6. Bozga, M., Jaber, M., Maris, N., Sifakis, J.: Modeling dynamic architectures using Dy-BIP. In: Gschwind, T., De Paoli, F., Gruhn, V., Book, M. (eds.) SC 2012. LNCS, vol.?7306, pp. 1-6. Springer, Heidelberg (2012) CrossRef
  7. Bruni, R., Lanese, I., Montanari, U.: A basic algebra of stateless connectors. Theor. Comput. Sci.?366(1-2), 98-20 (2006) CrossRef
  8. Bruni, R., Melgratti, H., Montanari, U.: Connector algebras, Petri nets, and BIP. In: Clarke, E., Virbitskaite, I., Voronkov, A. (eds.) PSI 2011. LNCS, vol.?7162, pp. 19-8. Springer, Heidelberg (2012) CrossRef
  9. Bruni, R., Melgratti, H., Montanari, U., Sobocinski, P.: Connector algebras for C/E and P/T nets-interactions. Logical Methods in Comp. Sci. (2013) (to appear)
  10. Bruni, R., Melgratti, H., Montanari, U.: A connector algebra for P/T nets interactions. In: Katoen, J.-P., K?nig, B. (eds.) CONCUR 2011. LNCS, vol.?6901, pp. 312-26. Springer, Heidelberg (2011) CrossRef
  11. Esparza, J., Nielsen, M.: Decidability issues for Petri nets. Petri Nets Newsletter?94, 5-3 (1994)
  12. Gadducci, F., Montanari, U.: The tile model. In: Proof, Language, and Interaction, pp. 133-66. The MIT Press (2000)
  13. Lapadula, A., Pugliese, R., Tiezzi, F.: A formal account of ws-bpel. In: Lea, D., Zavattaro, G. (eds.) COORDINATION 2008. LNCS, vol.?5052, pp. 199-15. Springer, Heidelberg (2008) CrossRef
  14. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, I–ii. Inf. Comput.?100(1), 1-7 (1992) CrossRef
  15. Perry, D.E., Wolf, E.L.: Foundations for the study of software architecture. ACM SIGSOFT Software Engineering Notes?17, 40-2 (1992) CrossRef
  16. Sobociński, P.: Representations of Petri net interactions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.?6269, pp. 554-68. Springer, Heidelberg (2010) CrossRef
  17. Viroli, M.: A core calculus for correlation in orchestration languages. J. Log. Algebr. Program.?70(1), 74-5 (2007) CrossRef
  
• 作者单位：Roberto Bruni (19)
  Hernán Melgratti (20)
  Ugo Montanari (19)
  
  19. Dipartimento di Informatica, Università di Pisa, Italy
  20. Departamento de Computación, FCEyN, Universidad de Buenos Aires - Conicet, Argentina
  
• ISSN：1611-3349

文摘

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