A further step towards a theory of regular MSC languages

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

Volumn 2285, Issue , 2002, Pages 489-500

  Kuske, Dietrich ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FLOWCHARTING; FORMAL LOGIC; MESSAGE PASSING;

AXIOMATIZABILITY; COUNTING QUANTIFIERS; EXPRESSIVE POWER; FIRST ORDER LOGIC; MESSAGE SEQUENCE CHARTS; MESSAGE-PASSING AUTOMATA; MONADIC SECOND-ORDER LOGIC; MULLER ACCEPTANCE;

COMPUTER CIRCUITS;

EID: 84937410276     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_40     Document Type: Conference Paper

References (25)

1. R. Alur and M. Yannakakis. Model checking of message sequence charts. In CONCUR’99, Lecture Notes in Comp. Science vol. 1664, pages 114–129. Springer, 1999.
2. A. Arnold. An extension of the notions of traces and of asynchronous automata. Informatique Theorique et Applications, 25:355–393, 1991.
3. J.R. Büchi. Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math., 6:66–92, 1960.
4. R. Cori, Y. Métivier, and W. Zielonka. Asynchronous mappings and asynchronous cellular automata. Information and Computation, 106:159–202, 1993.
5. V. Diekert andY. Métivier. Partial commutation and traces. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages Volume 3, pages 457–533. Springer, 1997.
6. V. Diekert and A. Muscholl. Deterministic asynchronous automata for infinite traces. Acta Informatica, 31:379–397, 1994.
7. M. Droste and P. Gastin. Asynchronous cellular automata for pomsets without autoconcur-rency. In CONCUR’96, Lecture Notes in Comp. Science vol. 1119, pages 627–638. Springer, 1996.
8. M. Droste, P. Gastin, and D. Kuske. Asynchronous cellular automata for pomsets. Theoretical Comp. Science, 247:1–38, 2000. (Fundamental study).
9. W. Ebinger and A. Muscholl. Logical definability on infinite traces. Theoretical Comp. Science, 154:67–84, 1996.
10. J.G. Henriksen, M. Mukund, K. Narayan Kumar, and P.S. Thiagarajan. Towards a theory of regular MSC languages. Technical report, BRICS RS-99-52, 1999. The results of this technical report appeared in the extended abstracts [12,11].
11. J.G. Henriksen, M. Mukund, K. Narayan Kumar, and P.S. Thiagarajan. On message sequence graphs andfinitely generated regular MSC languages. In ICALP’00, pages 675–686. Springer, 2000.
12. J.G. Henriksen, M. Mukund, K. Narayan Kumar, and P.S. Thiagarajan. Regular collections of message sequence charts. In MFCS 2000, Lecture Notes in Computer Science vol. 1893. Springer, 2000.
13. W. Hodges. Model Theory. Cambridge University Press, 1993.
14. D. Kuske. Asynchronous cellular automata and asynchronous automata for pomsets. In CONCUR’98, Lecture Notes in Comp. Science vol. 1466, pages 517–532. Springer, 1998.
15. D. Kuske. Another step towards a theory for regular MSC languages. Technical Report 2001-36, Department of Mathematics and Computer Science, University of Leicester, 2001.
16. D. Kuske and R. Morin. Pomsets for local trace languages: Recognizability, logic and Petri nets. In CONCUR 2000, Lecture Notes inComp. Science vol. 1877, pages 426–411. Springer, 2000.
17. R.E. Ladner. Application of model theoretic games to discrete linear orders and finite automata. Information and Control, 33:281–303, 1977.
18. R. McNaughton and S. Papert. Counter-Free Automata. MIT Press, Cambridge, USA, 1971.
19. R. Morin. On regular message sequence chart languages and relationships to Mazurkiewicz trace theory. In FOSSACS01, Lecture Notes in Comp. Science vol. 2030, pages 332–346. Springer, 2001.
20. M. Mukund, K. Narayan Kumar, and M. Sohoni. Synthesizing distributed finite-state systems from MSCs. In C. Palamidessi, editor, CONCUR 2000, Lecture Notes in Computer Science vol. 1877, pages 521–535. Springer, 2000.
21. A.Muscholl andD.Peled. Message sequence graphs and decision problemsonMazurkiewicz traces. In MFCS’99, Lecture Notes in Computer Science vol. 1672, pages 81–91. Springer, 1999.
22. H. Straubing, D. The´rien, and W. Thomas. Regular languages defined with generalized quantifiers. Information and Computation, 118:289–301, 1995.
23. P.S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for mazurkiewicz traces. In LICS’97, pages 183–194. IEEE Computer Society Press, 1997.
24. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 133–191. Elsevier Science Publ. B.V., 1990.
25. W. Thomas. On logical definability of trace languages. In V. Diekert, editor, Proceedings of a workshopof theESPRITBRA No 3166:Algebraic and SyntacticMethods in Computer Science (ASMICS) 1989, Report TUM-I9002, Technical University of Munich, pages 172–182, 1990.