Pattern matching and membership for hierarchical message sequence charts

Theory of Computing Systems

Volumn 42, Issue 4, 2008, Pages 536-567

  Genest, Blaise ^a   Muscholl, Anca ^b  

^a CAMPUS DE BEAULIEU   (France)

^b UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Complexity; Hierarchical specifications; MSC

Indexed keywords

COMMUNICATING PROCESS; COMPLEXITY; MEMBERSHIP PROBLEM; MESSAGE SEQUENCE CHARTS; MSC; PATTERN MATCHING PROBLEMS; POLYNOMIAL-TIME ALGORITHMS; PSPACE-COMPLETE;

ALGORITHMS; PATTERN MATCHING; POLYNOMIAL APPROXIMATION; SOFTWARE DESIGN;

FLOWCHARTING;

EID: 40849102623     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-007-9054-1     Document Type: Article

References (30)

1. Alur, R., Etessami, K., Yannakakis, M.: Realizability and verification of MSC graphs. In: Proceedings of ICALP'01. Lecture Notes in Computer Science, vol. 2076, pp. 797-808. Springer, Berlin (2001)
2. (Journal version in Theor. Comput. Sci. 331(1), 97-114 (2005))
3. Alur, R., Holzmann, G.H., Peled, D.A.: An analyzer for message sequence charts. Soft. Concepts Tools 17(2), 70-77 (1996)
4. Alur, R., Kannan, S., Yannakakis, M.: Communicating hierarchical state machines. In: Proceedings of ICALP'99. Lecture Notes in Computer Science, vol. 1644, pp. 169-178. Springer, Berlin (1999)
5. Alur, R., Yannakakis, M.: Model checking of hierarchical state machines. In: Proceedings of SIGSOFT'98, pp. 175-188 (1998)
6. (Extended version in ACM Trans. Program. Lang. Syst. 23(3), 273-303 (2001))
7. Alur, R., Yannakakis, M.: Model checking of message sequence charts. In: Proceedings of CONCUR'99. Lecture Notes in Computer Science, vol. 1664, pp. 114-129. Springer, Berlin (1999)
8. Dalmau, V.: Computational complexity of problems over generalized formulas. Ph.D. thesis, Universitat politécnica de Catalunya (UPC) (2000)
9. Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Am. Math. Soc. 16 (1965)
10. Genest, B., Muscholl, A.: Pattern matching and membership for hierarchical message sequence charts. In: Proceedings of LATIN'02. Lecture Notes in Computer Science, vol. 2286, pp. 326-340. Springer, Berlin (2002)
11. Genest, B., Minea, M., Muscholl, A., Peled, D.: Specifying and verifying partial order properties using template MSCs. In: Proceedings of FoSSaCS'04. Lecture Notes in Computer Science, vol. 2987, pp. 195-209. Springer, Berlin (2004)
12. Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-state High-level MSCs: Model-checking and realizability. In: Proceedings of ICALP'02. Lecture Notes in Computer Science, vol. 2380, pp. 657-668. Springer, Berlin (2002)
13. (Journal version in J. Comput. Syst. Sci. 72(4), 617-647 (2006))
14. Harel, D.: Statecharts: a visual formulation for complex systems. Sci. Comput. Program. 8(3), 231-274 (1987)
15. Harel, D., Kupferman, O., Vardi, M.Y.: On the complexity of verifying concurrent transition systems. In: Proceedings of CONCUR'97. Lecture Notes in Computer Science, vol. 1243, pp. 258-272. Springer, Berlin (1997)
16. (Journal version in Inform. Comput. 173(2), 143-161 (2002))
17. ITU-TS recommendation Z. 120 (1996)
18. Lifshits, Y.: Solving classical string problems on compressed texts. Available at http://xxx.lanl.gov/abs/cs.DS/0604058
19. Lohrey, M.: Safe realizability of high-level message sequence charts. In: Proceedings of CONCUR'02. Lecture Notes in Computer Science, vol. 2421, pp. 177-192. Springer, Berlin (2002)
20. (Journal version in Theor. Comput. Sci. 309(1-3), 529-554 (2003))
21. Liu, H., Wrathall, C., Zeger, K.: Efficient solution of some problems in free partially commutative monoids. Inform. Comput. 89, 180-198 (1990)
22. Madhusudan, P.: Reasoning about sequential and branching behaviours of message sequence graphs. In: Proceedings of ICALP'01. Lecture Notes in Computer Science, vol. 2076, pp. 809-820. Springer, Berlin (2001)
23. Miyazaki, M., Shinohara, A., Takeda, M.: An improved pattern matching algorithm for strings in terms of straight-line programs. In: Proceedings of CPM'97. Lecture Notes in Computer Science, vol. 1264, pp. 1-11. Springer, Berlin (1997)
24. Mukund, M., Narayan Kumar, K., Sohoni, M.: Synthesizing distributed finite-state systems from MSCs. In: Proceedings of CONCUR'00. Lecture Notes in Computer Science, vol. 1877, pp. 521-535. Springer, Berlin (2000)
25. Muscholl, A., Peled, D.: Message sequence graphs and decision problems on Mazurkiewicz traces. In: Proceedings of MFCS'99. Lecture Notes in Computer Science, vol. 1672, pp. 81-91. Springer, Berlin (1999)
26. Muscholl, A., Peled, D., Su, Z.: Deciding properties of message sequence charts. In: Proceedings of FoSSaCS'98. Lecture Notes in Computer Science, vol. 1378, pp. 226-242. Springer, Berlin (1998)
27. Peled, D.: Specification and verification of Message Sequence Charts. In: Proceedings of FORTE/PSTV'00, pp. 139-154. Kluwer, Dordrecht (2000)
28. Plandowski, W.: Testing equivalence of morphisms on context-free languages. In: Proceedings of ESA'94. Lecture Notes in Computer Science, vol. 855, pp. 460-470. Springer, Berlin (1994)
29. Rytter, W.: Algorithms on compressed strings and arrays. In: Proceedings of SOFSEM'99. Lecture Notes in Computer Science, vol. 1725, pp. 48-65. Springer, Berlin (1999)
30. Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of STOC'78, pp. 216-226. Springer, Berlin (1978)