Regular sets of pomsets with autoconcurrency

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

Volumn 2421 LNCS, Issue , 2002, Pages 402-417

  Fanchon, Jean ^a   Morin, Rémi ^b  

^a LAAS CNRS   (France)

^b AIX MARSEILLE UNIV   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; PETRI NETS;

CLOSURE PROPERTY; MESSAGE SEQUENCE CHARTS; MULTI-SETS; MULTISET; POMSETS; REGULAR SETS; SERIES-PARALLEL;

PETRI NETS; COMPUTATIONAL LINGUISTICS;

EID: 34548105362     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45694-5_27     Document Type: Conference Paper

References (16)

1. R. Alur and M. Yannakakis: Model Checking of Message Sequence Charts. CONCUR'99, LNCS 1664 (1999) 114-129
2. A. Arnold: An extension of the notion of traces and asynchronous automata. Theoretical Informatics and Applications 25 (1991) 355-393
3. V. Diekertand Y. Métivier: Partial Commutations and Traces. Handbook of Formal languages, vol. 3 (1997) 457-533
4. M. Droste, P. Gastin, and D. Kuske: Asynchronous cellular automata for pomsets. Theoretical Computer Science Vol. 247 (2000) 1-38
5. M. Droste and D. Kuske: Logical definability of recognizable and aperiodic languages in concurrency monoids. LNCS 1092 (1996) 233-251
6. J. Fanchon: A syntactic congruence for the recognizability of pomset languages. RR 99008 (LAAS, Toulouse, 1999)
7. J. L. Gischer: The equational theory of pomsets. Theoretical Comp. Science 61 (1988) 199-224
8. J. Grabowski: On partial languages. Fund. Informatica IV(2) (1981) 427-498
9. D. Kuske: Infinite series-parallel posets: logic and languages. LNCS 1853 (2000) 648-662
10. D. Kuske and R. Morin: Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets. CONCUR 2000, LNCS 1877 (2000) 426-440
11. K. Lodaya and P. Weil: Series-parallel languages and the bounded-width property. Theoretical Comp. Science 237 (2000) 347-380
12. R. Morin: Recognizable Sets of Message Sequence Charts. STACS 2002, LNCS 2030 (2002) 332-342
13. M. Mukund, K. Narayan Kumar, and M. Sohoni: Synthesizing distributed finite-state systems from MSCs. CONCUR 2000, LNCS 1877 (2000) 521-535
14. V. Pratt: Modelling concurrency with partial orders. Int. J. of Parallel Programming 15 (1986) 33-71
15. W. Thomas: Automata Theory on Trees and Partial Orders. TAPSOFT 97, LNCS 1214 (1998) 20-34
16. W. Vogler: Modular Construction and Partial Order Semantics of Petri Nets. LNCS 625 (1992) 252-275