Automata based model checking for reo connectors

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

Volumn 5961 LNCS, Issue , 2010, Pages 260-275

  Bonsangue, Marcello M ^a,b   Izadi, Mohammad ^a,c,d  

^a LEIDEN UNIVERSITY   (Netherlands)

^b CWI   (Netherlands)

^c SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

^d INSTITUTE FOR HUMANITIES AND CULTURAL STUDIES   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA-BASED MODEL; CONTEXT DEPENDENCY; LINEAR TIME TEMPORAL LOGIC; ON-THE-FLY ALGORITHMS; OPERATIONAL SEMANTICS; SOFTWARE SYSTEMS;

COMPUTER SOFTWARE; MATHEMATICAL MODELS; PERMANENT MAGNETS; ROBOTS; TEMPORAL LOGIC; TRANSLATION (LANGUAGES);

MODEL CHECKING;

EID: 77949443491     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11623-0_15     Document Type: Conference Paper

References (23)

1. Arbab, F.: Reo: a Channel-based Coordination Model for Component Composition. Mathematical Structures in Computer Science 14(3), 329-366 (2004)
2. Arbab, F., Rutten, J.J.M.M.: A Coinductive Calculus of Component Connectors. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) WADT 2003. LNCS, vol. 2755, pp. 34-55. Springer, Heidelberg (2003)
3. Arbab, F., Baier, C., de Boer, F., Rutten, J.J.M.M.: Models and Temporal Logics for Timed Component Connectors. In: Proc. of SEFM 2004, pp. 198-207. IEEE Computer Society, Los Alamitos (2004)
4. Baier, C., Sirjani, M., Arbab, F., Rutten, J.J.M.M.: Modelling Component Connectors in Reo by Constraint Automata. Science of Computer Programming 61, 75-113 (2006)
5. Clarke, E., Grumberg, O., Peled, D.: Model Checking. The MIT Press, Cambridge (1999)
6. Clarke, D.: Reasoning about Connector Recon.guration II: Basic reconfiguration Logic. In: Proc. of FSEN 2005. ENTCS, vol. 159, pp. 61-77. Elsevier, Amsterdam (2006)
7. Clarke, D., Costa, D., Arbab, F.: Connector Colouring I: Synchronisation and Context Dependency. Science of Computer Programming 66(3), 205-225 (2007)
8. Costa, D.: Intensional Constraint Automata. Unpublished notes (2008)
9. Gerth, R., Peled, D., Vardi, M., Wolper, P.: Simple On-the-fly Automatic Verification of Linear Temporal Logic. In: Proc. of the Int. Sym. on Protocol Specification, Testing, and Verification (PSTV 1995), pp. 3-18. Chapman & Hall, Boca Raton (1995)
10. Holzmann, G.J.: The Model Checker SPIN. IEEE Transactions on Software Engineering 23(5), 279-295 (1997)
11. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley, Reading (2006)
12. Izadi, M., Bonsangue, M.M.: Recasting Constraint Automata into Büchi Automata. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds.) ICTAC 2008. LNCS, vol. 5160, pp. 156-170. Springer, Heidelberg (2008)
13. Izadi, M., Bonsangue, M.M., Clarke, D.: Modeling Component Connectors: Synchronisation and Context-Dependency. In: Proc. of SEFM 2008, pp. 303-312. IEEE Computer Society, Los Alamitos (2008)
14. Kaplan, D.M.: Regular Expressions and the Equivalence of Programs. Journal of Compiting System Science 3, 361-386 (1969)
15. Kl̈uppelholz, S., Baier, C.: Symbolic Model Checking for Channel-based Component Connectors. In: Proc. of FOCLASA 2006. ENTCS, vol. 175(2), pp. 19-37. Elsevier, Amsterdam (2007)
16. Kozen, D.: Automata on guarded strings and applications. Matématica Contemporânea 24, 117-139 (2003)
17. Kupferman, O., Vardi, M.: Verification of Fair Transition Systems. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 372-382. Springer, Heidelberg (1996)
18. Madhusudan, P.: On the Fly Model Checking for Linear Time Temporal Logic. M.Sc. Thesis, Anna University, Madras, India (1996)
19. Remy, D.: Efficient Representation of Extensible Records. In: Proc. ACM SIG-PLAN Workshop on ML and its applications, pp. 12-16 (1994)
20. Tsay, Y., Chen, Y., Tsai, M., Wu, K., Chan, W.: GOAL: A Graphical Tool for Manipulating Büchi Automata and Temporal Formulae. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 466-471. Springer, Heidelberg (2007)
21. Vardi, M.: An Automata-Theoretic Approach to Linear Temporal Logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol. 1043, pp. 238-266. Springer, Heidelberg (1996)
22. Vardi, M., Wolper, P.: An Automata-Theoretic Approach to Automatic Program Verification. In: Proc. of (LICS 1986), pp. 322-331 (1986)
23. Thomas,W.: Automata on Infinite Objects. In: Handbook of Theoretical Computer Science, vol. B, pp. 133-191. Elsevier, Amsterdam (1990)