Message sequence graphs and decision problems on mazurkiewicz traces

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

Volumn 1672, Issue , 1999, Pages 81-91

  Muscholl, Anca ^a   Peled, Doron ^b,c  

^a UNIVERSITY OF STUTTGART   (Germany)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

Automata theory; Mazurkiewicz semi traces; Message sequence graphs; Universality problem

Indexed keywords

AUTOMATA THEORY; GRAPHIC METHODS; SPECIFICATION LANGUAGES;

COMPLEXITY RESULTS; DECISION PROBLEMS; MAZURKIEWICZ SEMI-TRACES; MAZURKIEWICZ TRACES; MESSAGE SEQUENCE CHARTS; MESSAGE SEQUENCE GRAPHS; SYNCHRONIZED GRAPHS; UNIVERSALITY PROBLEM;

GRAPH THEORY;

EID: 84949223390     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48340-3_8     Document Type: Conference Paper

References (15)

1. R. Alur, G. H. Holzmann, and D. A. Peled. An analyzer for message sequence charts. Software Concepts and Tools, 17(2):70-77, 1996.
2. H. Ben-Abdallah and S. Leue. Syntactic detection of process divergence and nonlocal choice in message sequence charts. In Proc. of Tools and Algorithms for the Construction and Analysis of Systems (TACAS'97), LNCS 1217, pp. 259-274.
3. M. Clerbout. Commutations Partielles et Families de Langages. These, Université des Sciences et Technologies de Lille (France), 1984.
4. M. Clerbout and M. Latteux. Semi-Commutations. Information and Computation, 73:59-74, 1987.
5. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
6. S. Ginsburg and E. H. Spanier. Semigroups, Presburger formulas and languages. Pacific Journal of Mathematics, 16(2):285-296, 1966.
7. G. Holzmann, D. Peled, and M. Redberg. Design tools for requirements engineering. Bell Labs Technical Journal - Software, 2(l):86-95, 1997.
8. A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
9. Y. Métivier. Une condition süffisante de reconnaissabilité dans un monoïde partiellement commutatif. R.A.I.R.O.-Informatique Théorique et Applications, 20:121-127, 1986.
10. Y. Métivier. On recognizable subsets of free partially comutative monoids. Theoretical Computer Science, 58:201-208, 1988.
11. A. Muscholl. Decision and complexity issues on concurrent systems. Habilitationsschrift (postdoctoral thesis), Universität Stuttgart, Jan. 1999. Submitted.
12. A. Muscholl, D. Peled, and Z. Su. Deciding properties of message sequence charts. In Proc. of the 1st Int. Conference on Foundations of Software Science and Computation Structures (FoSSaCS'98), LNCS 1378, pp. 226-242, 1998.
13. E. Ochmański. Regular behaviour of concurrent systems. Bulletin of the European Association for Theoretical Computer Science (EATCS), 27:56-67, Oct. 1985.
14. J. Sakarovitch. The "last" decision problem for rational trace languages. Report LITP 91.77, Univ. Paris 6, 1991. Abstract presented at the 1st Int. Symp. of Latin American Theor. Informatics (LATIN'92), LNCS 583 (1992), pp. 460-473.
15. I. Walukiewicz. Difficult configurations - on the complexity of LTrL. In Proc. of the 25th International Colloquium on Automata, Languages and Programming (ICALP'98), LNCS 1443, pp. 140-151, 1998.