Reliable generalized and context dependent commutation relations

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

Volumn 1214, Issue , 1997, Pages 165-176

  Biermann, Isabelle ^a   Rozoy, Brigitte ^b  

^a UNIV LILLE   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS; QUANTUM THEORY;

COMMUTATION RELATION; CONTEXT DEPENDENT; TRACE THEORY;

SOFTWARE DESIGN;

EID: 46949094274     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030594     Document Type: Conference Paper

References (15)

1. S. Bauget and P. Gastin. On congruences and partial orders. Lecture Notes in Computer Science, 969:434-443, 1995. MFCS'95.
2. I. Biermarm. Extensions structurelles des traces de commutation. PhD thesis, Universit6 Paris-Sud, Orsay, France, 1995.
3. Biermann and B. Rozoy. Context traces and transition systems. In ISCIS IX, Antalya, Turkey, 1994.
4. M. Clerbout and M. Latteux. Semi-commutations. Information and Computation, 73:59-74, 1987.
5. M. Clerbout and Y. Roos. Semi commutations and algebraic languages. Theoretical computer science, 103:39-49
6. R. Cori and D. Perrin. Automates et commutations partietles. RARO Theoretical Informaties and Applications, 19:21-32, 1985.
7. V. Diekert and G. Rozenberg. The book of traces. World Scientific Publ. Co., Singapour, 1995.
8. P. Gastin, E. Ochmanski, A. Petit, and B. Rozoy. Decidability of the star problem in a*×{b}*. Information Processing Letters, 44:65-71, 1992.
9. P. Hoogers, H.C.M. Kleijn, and P.S. Thiagarajan. A trace semantics for Petri nets. Technical Report 92-03, Leiden University, 1992. to appear in 1995 in Information and Computation.
10. J. Lacaze. Parties reconnaissables de monoi'des définis par g6n6rateurs et relations. R.A.LR.O. Informatique thdorique et applications, 26(6):541-552, 1992.
11. M. Lothaire. Combinatorics on words, volume 17 of Encyclopedia of Mathematics. Addison-Wesley, 1982.
12. A. Mazurkiewicz. Concurrent program schemes and their interpretations. Aarhus University, DAIMI Rep. PB 78, 1977.
13. Y. M6tivier. Une condition suffisante de reconnaissabilit6 darts un mono'ide partiellement commutatif. R.A.I.R.O. Theoretical Informatics and Applications, 20:121-127, 1986.
14. Y. Métivier, G. Richomme, and P. A. Wacrenier. Computing the closure of sets of wox'ds under partial commutations. Lecture Notes in Computer Science, 944:75-86, 1995. IGALP'95.
15. E. Ochmanski. Regular behaviour of concurrent systems. Bulletin of EATCS, 27:56-67, October 1985.