Modeling component connectors: Synchronisation and context-dependency

Proceedings - 6th IEEE International Conference on Software Engineering and Formal Methods, SEFM 2008

Volumn , Issue , 2008, Pages 303-312

  Izadi, Mohammad ^a,b   Bonsangue, Marcello M ^a   Clarke, Dave ^c  

^a LEIDEN UNIVERSITY   (Netherlands)

^b SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

^c CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DATA FLOW ANALYSIS; INFORMATION THEORY; ROBOTS; SOFTWARE ENGINEERING; SYNCHRONIZATION; TRANSLATION (LANGUAGES);

COMPOSITION OPERATORS; COORDINATION LANGUAGES; DATA FLOW NETWORKS; FORMAL MODELS; MODELING COMPONENTS; MUTUAL EXCLUSIONS; OPERATIONAL MODELS; SYNCHRONISATION;

FORMAL METHODS;

EID: 58049163433     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SEFM.2008.24     Document Type: Conference Paper

References (20)

1. Arbab F., Reo: a channel-based coordination model for component composition, Math. Struc. in Computer Science, 14(3), (2004), 329-366.
2. Arbab F. and Rutten J.J.M.M., A Coinductive calculus of component connectors, Lecture Notes in Computer Science, 2755, Springer-Verlag (2003), 35-56.
3. Arbab, F., Baier, C., de Boer, F., and Rutten, J.J.M.M. Models and temporal logics for timed component connectors. In Proc. of the IEEE International Conference on Software Engineering and Formal Methods (SEFM), IEEE Computer Society, pp. 198-207, 2004.
4. Baier C., Sirjani M., Arbab F., and Rutten J.J.M.M., Modelling component connectors in Reo by constraint automata, Science of Computer Programming, 61, (2006), 75-113.
5. Arbab F., Baier C., de Boer F., Rutten J., Sirjani M., Synthesis of Reo circuites for implementation of component-connector automata specifications, Proceedings of CORDINATION 2005, LNCS, 3454, Springer-Verlag, (2005), 236-251.
6. Cimatti A., Clarke E.M., Giunchiglia E., Giunchiglia F., Pistore M., Roveri M., Sebastiani R., and Tacchella A., NuSMV 2: an open source tool for symbolic model checking, in Proceedings of the 14th CAV, Springer's LNCS 2404, (2002), 359-364.
7. Clarke E., Grumberg O., and Peled D., Model checking, The MIT Press, 1999.
8. Clarke D., Coordination: Reo, nets, and logic, unpublished notes, (2008).
9. Clarke D., Costa D., and Arbab F., Connector colouring I: synchronisation and context dependency, Science of Computer Programming, 66(3), (2007), 205-225.
10. Costa D. and Clarke D., Intensional constraint automata, unpublished note, 2008.
11. Holzmann G.J., The model checker SPIN, IEEE Transactions on software engineering, 23(5), (1997), 279-295.
12. Hopcroft J.E., Motwani R., and Ullman J.D., Introduction to automata theory, languages, and computation, 3rd edition, Addison-Wesley (2006).
13. Izadi M. and Bonsangue M.M., Recasting constraint automata into Büchi automata in Proc. ICTAC 2008, to appear in Springer's LNCS, (2008).
14. Kaplan D.M., Regular expressions and the equivalence of programs, Journal of Compiting System Science, 3, (1969) 361-386.
15. Kozen D., Automata on guarded strings and applications, Matématica Contemporânea, 24 (2003), 117-139.
16. Mousavi M.R., Sirjani M., and Arbab F., Formal sematics and analysis of component connectors in Reo, in Proc. of FOCLASA 2005, Elsevier's ENTCS 154, (2005), 83-99.
17. Remy D., Efficient representation of extensible records, Proc. ACM SIGPLAN Workshop on ML and its applications, (1994), 12-16.
18. Szyperski C., Gruntz D., and Murer S. Component software: beyond object-oriented programming (second edition), Addison-Wesley, 2002.
19. Vardi M., An automata-theoretic approach to linear temporal logic, Lecture Notes in Computer Science, 1043, Springer-Verlag (1996), 238-266.
20. Thomas W., Automata on infinite objects, J. van Leeuwen (editor), "Handbook of Theoretical Computer Science", vol. B, Elsevier, (1990), 133-191.