State space reduction techniques for component interfaces

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

Volumn 5282 LNCS, Issue , 2008, Pages 130-145

  Lumpe, Markus ^a   Grunske, Lars ^a   Schneider, Jean Guy ^a  

^a SWINBURNE UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; ROBOTS; SOFTWARE ENGINEERING; SPECIFICATIONS;

BISIMULATION TECHNIQUE; COMPONENT BASED SYSTEMS; COMPONENT INTERACTION; COMPONENT SPECIFICATION; COMPONENT-BASED SOFTWARE SYSTEMS; INTERFACE SPECIFICATION; PROTOCOL SPECIFICATIONS; STATE-SPACE REDUCTION;

INTERFACE STATES;

EID: 70350536730     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87891-9_9     Document Type: Conference Paper

References (33)

1. Arbab, F.: Reo: A Channel-based Coordination Model for Component Composition. Mathematical Structures in Computer Science 14(3), 329-366 (2004)
2. Baeten, J.C.M., Bergstra, J.A.: Real time process algebra. Formal Aspects of Computing 3(2), 142-188 (1991)
3. Baier, C., Hermanns, H.: Weak bisimulation for fully probabilistic processes. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 119-130. Springer, Heidelberg (1997)
4. Blom, S., Orzan, S.: Distributed state space minimization. International Journal on Software Tools for Technology Transfer (STTT) 7(3), 280-291 (2005)
5. Brim, L., Černá, I., Vařeková, P., Zimmerova, B.: Component-Interaction Automata as a Verification-Oriented Component-Based System Specification. SIGSOFT Software Engineering Notes 31(2), 1-8 (2006)
6. Broy, M.: A core theory of interfaces and architecture and its impact on object orientation. In: Reussner, R.H., Stafford, J.A., Szyperski, C.A. (eds.) Architecting Systems with Trustworthy Components. LNCS, vol. 3938, pp. 26-47. Springer, Heidelberg (2006)
7. Černá, I., Vařeková, P., Zimmerova, B.: Component Substitutability via Equivalencies of Component-Interaction Automata. Electronic Notes in Theoretical Computer Science 182, 39-55 (2007)
8. Chakrabarti, A., de Alfaro, L., Henzinger, T.A., Jurdzinski, M., Mang, F.Y.C.: Interface compatibility checking for software modules. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 428-441. Springer, Heidelberg (2002)
9. Cheung, S.C., Kramer, J.: Checking safety properties using compositional reachability analysis. ACM Transactions on Software Engineering and Methodology 8(1), 49-78 (1999)
10. de Alfaro, L., da Silva, L.D., Faella,M., Legay, A., Roy, P., Sorea, M.: Sociable interfaces. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol. 3717, pp. 81-105. Springer, Heidelberg (2005)
11. de Alfaro, L., Henzinger, T.A.: Interface Automata. In: Gruhn, V., Tjoa, A.M. (eds.) Proceedings ESEC/FSE 2001, Vienna, Austria, September 2001, pp. 109-120. ACM Press, New York (2001)
12. de Alfaro, L., Henzinger, T.A., Stoelinga, M.: Timed Interfaces. In: Sangiovanni-Vincentelli, A.L., Sifakis, J. (eds.) EMSOFT 2002. LNCS, vol. 2491, pp. 108-122. Springer, Heidelberg (2002)
13. de Alfaro, L., Stoelinga, M.: Interfaces: A game-theoretic framework for reasoning about component-based systems. Electronic Notes in Theoretical Computer Science 97, 3-23 (2004)
14. DeNicola, R., Vaandrager, F.: Three logics for branching bisimulation. Journal of the ACM 42(2), 458-487 (1995)
15. Fernandez, J.-C.: An implementation of an efficient algorithm for bisimulation equivalence. Science of Computer Programming 13(2-3), 219-236 (1990)
16. Fisler, K., Vardi, M.Y.: Bisimulation minimization and symbolic model checking. Formal Methods in System Design 21(1), 39-78 (2002)
17. Habib, M., Paul, C., Viennot, L.: Partition refinement techniques: An interesting algorithmic tool kit. International Journal of Foundations of Computer Science 10(2), 147-170 (1999)
18. Hermanns, H.: Interactive Markov Chains. LNCS, vol. 2428. Springer, Heidelberg (2002)
19. Inverardi, P.,Wolf, A.L., Yankelevich, D.: Static checking of system behaviors using derived component assumptions. ACM Transactions on Software Engineering Methodology 9(3), 239-272 (2000)
20. Kang, I., Lee, I., Kim, Y.-S.: An efficient state space generation for the analysis of real-time systems. IEEE Transactions on Software Engineering 26(5), 453-477 (2000)
21. Lee, E.A., Xiong, Y.: System-Level Types for Component-Based Design. In: Henzinger, T.A., Kirsch, C.M. (eds.) EMSOFT 2001. LNCS, vol. 2211, pp. 237-253. Springer, Heidelberg (2001)
22. Lynch, N.A., Tuttle, M.R.: Hierarchical correctness proofs for distributed algorithms. In: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, August 1987, pp. 137-151 (1987)
23. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
24. Nierstrasz, O.: Regular Types for Active Objects. In: Proceedings OOPSLA 1993, September 1993. ACM SIGPLAN Notices, vol. 28, pp. 1-15 (1993)
25. Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM Journal on Computing 16(6), 973-989 (1987)
26. Park, D.: Concurrency and Automata on Infinite Sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167-183. Springer, Heidelberg (1981)
27. Plasil, F., Visnovsky, S.: Behavior protocols for software components. IEEE Transactions on Software Engineering 28(11), 1056-1076 (2002)
28. PLT Scheme v372 (2008), http://www.plt-scheme.org
29. Stirling, C.: Modal and temporal logics for processes. In: Moller, F., Birtwistle, G.M. (eds.) Logics for Concurrency. LNCS, vol. 1043, pp. 149-237. Springer, Heidelberg (1996)
30. Szyperski, C.: Component Software: Beyond Object-Oriented Programming, 2nd edn. Addison-Wesley / ACM Press (2002)
31. ter Beek, M.H., Ellis, C.A., Kleijn, J., Rozenberg, G.: Synchronizations in team automata for groupware systems. Computer Supported Cooperative Work 12(1), 21-69 (2003)
32. van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. Journal of the ACM 43(3), 555-600 (1996)
33. Yellin, D.M., Strom, R.E.: Protocol specifications and component adaptors. ACM Transactions on Programming Languages and Systems 19(2), 292-333 (1997)