On recognizable stable trace languages

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

Volumn 1784 LNCS, Issue , 2000, Pages 177-191

  Husson, Jean François ^a   Morin, Rémi ^b  

^a UNIVERSITÉ PAUL SABATIER   (France)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS; AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS;

ASYNCHRONOUS TRANSITION SYSTEM; CONCURRENT AUTOMATA; CONSTRUCTIVE METHODS; DISTRIBUTED IMPLEMENTATION; LOCAL TRACE LANGUAGES; MAZURKIEWICZ TRACES; SCOTT DOMAINS; TRACE LANGUAGES;

AUTOMATA THEORY; COMPUTATION THEORY;

EID: 54249111310     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46432-8_12     Document Type: Conference Paper

References (21)

1. Arnold A.: An extension of the notion of traces and asynchronous automata. Theoretical Informatics and Applications 25 (1991) 355-393
2. Bednarczyk M.: Categories of asynchronous systems. PhD thesis (University of Sussex, 1987)
3. Bracho F., Droste M., Kuske D.: Representations of computations in concurrent automata by dependence orders. TCS 174 (1997) 67-96 (Pubitemid 127452777)
4. Diekert V., Rozenberg G.: The Book of Traces. (World Scientific, 1995)
5. Droste M.: Concurrency, automata and domains. LNCS 443 (1990) 195-208
6. Droste M., Shortt R.M.: From Petri nets to automata with concurrency. - Unpublished manuscript (1999)
7. Ehrenfeucht A., Rozenberg G.: Partial (Set) 2-structures. Part II: State spaces of concurrent systems, Acta Informatica 27 (1990) 343-368 (Pubitemid 20682711)
8. Hoogers P.W., Kleijn H.C.M., Thiagarajan P.S.: A Trace Semantics for Petri Nets. Information and Computation 117 (1995) 98-114
9. Husson J.-Fr.: Modélisation de la causalité par des relations d'indépendances. Thesis (Université Paul Sabatier de Toulouse, 1996)
10. Husson J.-Fr., Morin R.: Relationships between Arnold's CCI sets of P-traces and Droste's stably concurrent automata. Technical report MATH-AL-1-00 (Technische Universität Dresden, 2000)
11. Kleijn H.C.M., Morin R., Rozoy B.: A General Categorical Connection between Local E vent Structures and Local Traces. FCT'99, LNCS 1684 (1999) 338-349
12. Kuske D.: Nondeterministic automata with concurrency relations and domains. CAAP'94, LNCS 787 (1994) 202-217
13. Mazurkiewicz A.: Concurrent program schemes and their interpretations. Aarhus University Publication (DAIMI PB-78, 1977)
14. Morin R., Rozoy B.: On the Semantics of Place/Transition Nets. Concur'99, LNCS 1664 (1999) 447-462
15. Mukund M.: Petri Nets and Step Transition Systems. International Journal of Foundations of Computer Science 3 (1992) 443-478
16. Nielsen M., Sassone V., Winskel G.: Relationships between Models of Concurrency. LNCS 803 (1994) 425-475
17. Schmitt V.: Stable trace automata vs. full trace automata. TCS 200 (1998) 45-100 (Pubitemid 128450813)
18. Stark E.W.: Connections between concrete and abstract model of concurrent systems. LNCS 442 (1990) 53-79
19. Szpilrajn E.: Sur l'extension de l'ordre partiel. Fund. Math. 16 (1930) 386-389
20. Winskel G.: Event structures. LNCS 255 (1987) 325-392
21. Zielonka W.: Notes on finite asynchronous automata. Theoretical Informatics and Applications 21 (1987) 99-135