Advertisement

Abstract

The concept of traces has been introduced for describing non-sequential behaviour of concurrent systems via its sequential observations. Traces represent concurrent processes in the same way as strings represent sequential ones. The theory of traces can be used as a tool for reasoning about nets and it is hoped that applying this theory one can get a calculus of the concurrent processes analogous to that available for sequential systems. The following topics will be discussed: algebraic properties of traces, trace models of some concurrency phenomena, fixed-point calculus for finding the behaviour of nets, modularity, and some applications of the presented theory.

Key words

concurrency traces processes partial ordering Petri nets 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. [AR1]
    AALBERSBERG IJ. J., ROZENBERG, G.: "Traces, dependency graphs and DNLC grammars”, Discrete Applied Mathematics 11 (1985) 299–306CrossRefGoogle Scholar
  2. [AR2]
    AALBERSBERG, IJ. J., ROZENBERG, G.: "Trace languages defined by context-free languages", manuscript, (1985)Google Scholar
  3. [AW1]
    AALBERSBERG, IJ. J., WELZL, E.: "Trace languages defined by regular string languages", to appear (1985)Google Scholar
  4. [BBMS1]
    BERTONI, A., BRAMBILLA, M., MAURI, G., SABADINI, N.: "An application of the theory of free partially commutative monoids: asymptotic densities of trace languages", Lecture Notes in Computer Science 118 (1981) 205–215Google Scholar
  5. [BG1]
    BERTONI, A. and GOLDWURM, M.: "Average analysis of an algorithm for a membership problem of trace languages", manuscript, (1986)Google Scholar
  6. [BMS1]
    BERTONI, A., MAURI, G., SABADINI, N.: "A hierarchy of regular trace languages and some combinatorial applications", Proc. 2nd World Conf. on Math. at the Serv. of Men, Las Palmas (1982) 146–153Google Scholar
  7. [BMS2]
    BERTONI, A., MAURI, G., SABADINI, N.: "Equivalence and membership problems for regular trace languages", Lecture Notes in Computer Science 140 (1982) 61–71Google Scholar
  8. [BMS3]
    BERTONI, A., MAURI, G., SABADINI, N.: "Context — free trace languages", Proc. 7th CAAP, Lille (1982) 32–42Google Scholar
  9. [BMS4]
    BERTONI, A., MAURI, G., SABADINI, N.: "Equivalence and membership problems for regular and context — free trace languages", manuscript (1982)Google Scholar
  10. [BMS5]
    BERTONI, A., MAURI, G., SABADINI, N.: "Concurrency and commutativity", manuscript (1982)Google Scholar
  11. [BMS6]
    BERTONI, A., MAURI, G., SABADINI, N.: "Unambiguous regular trace languages", Proc. Colloq. on Algebra, Combinat. and Comp. Science, Gyor (1983)Google Scholar
  12. [BMS7]
    BERTONI, A., MAURI, G., SABADINI, N.: "Representation of prefixes of a trace and membership problem for context — free trace languages", manuscript (1985)Google Scholar
  13. [BFP1]
    BEST, E., FERNANDEZ, C. and PLUNNECKE, H.: "Concurrent systems and processes", manuscript (1985)Google Scholar
  14. [CdL1]
    CARPI, A. and LUCA, A. de: "Square — free words on partially commutative free monoids", Information Processing Letters 22 (1986) 125–132CrossRefGoogle Scholar
  15. [CF1]
    CARTIER, P. and FOATA, D.: "Problemes combinatoires de commutation et rearrangements", Lecture Notes in Mathematics 85 (1969)Google Scholar
  16. [CL1]
    CLERBOUT, M. and LATTEUX, M.: "Partial commutations and faithful rational transductions", Theoretical Computer Science 34 (1984) 241–254CrossRefGoogle Scholar
  17. [CL2]
    CLERBOUT, M. and LATTEUX, M.: "Semi — commutations", Techn. Rep. IT-63-84, Equipe Lilloise d'Inform. Theor., Univers. de Lille 1, Villeneuve d'Ascq. (1984)Google Scholar
  18. [CM1]
    CORI, R. and METIVIER, Y.: "Recognizable subsets of some partially abelian monoids", Theoretical Computer Science 35 (1984) 179–189CrossRefGoogle Scholar
  19. [CP1]
    CORI, R. and PERRIN, D.: "Automates and commutations partielles", RAIRO Informatique Theorique 19 (1985) 21–32Google Scholar
  20. [D1]
    DUBOC, C.: "Some properties of commutation in free partially commutative monoids", Information Processing Letters 20 (1985) 1–4CrossRefGoogle Scholar
  21. [D2]
    DUBOC, C.: "Equations in free partially commutative monoids", Lecture Notes in Computer Science 210 (1986) 192–202Google Scholar
  22. [ER]
    EHRENFEUCHT, A., ROZENBERG, G.: "On the Structure of Dependence Graphs", Rapport 87-02, Dept. of Computer Science, University of Leiden (1987)Google Scholar
  23. [FR1]
    FLE, M. P. and ROUCAIROL, G.: "On serializability of iterated transactions", Proc. ACM SIGACT-SIGOPS Symp. on Princ. of Distrib. Comp., Ottawa (1982) 194–200Google Scholar
  24. [FR2]
    FLE, M. P. and ROUCAIROL, G.: "Fair serializability of iterated transactions using FIFO — nets", Lecture Notes in Computer Science 188 (1985) 154–168Google Scholar
  25. [FR3]
    FLE, M. P. and ROUCAIROL, G.: "Maximal serializability of iterated transactions", Theoretical Computer Science 38 (1985) 1–16CrossRefGoogle Scholar
  26. [F1]
    FOATA, D.: "Rearrangements of words", in M. Lothaire: Combinatorics on words, Addison-Wesley, Reading, (1983) Chapter 10Google Scholar
  27. [G1]
    GRABOWSKI, J.: "On partial languages", Fundamenta Informaticae 4 (1981) 427–498Google Scholar
  28. [GKR]
    GYORY, G., KNUTH, E., RONYAI, L.: "Grammatical projections 1. Elementary constructions", Working Paper II/3, MTA SZTAKI, Budapest (1979)Google Scholar
  29. [J1]
    JANICKI, R.: "Synthesis of concurrent schemes", Lecture Notes in Computer Science 64 (1978) 298–307Google Scholar
  30. [J2]
    JANICKI, R.: "On the design of concurrent systems", Proc. 2nd Intern. Conf. on Distrib. Comp. Systems, Paris (1981) 455–466Google Scholar
  31. [J3]
    JANICKI, R.: "Mazurkiewicz traces semantics for communicating sequential processes", Proc. 5th European Workshop on Appl. and Theory of Petri Nets, Aarhus (1984) 50–70Google Scholar
  32. [J4]
    JANICKI, R.: "Trace semantics for communicating sequential processes", Techn. Rep. R-85-12, Inst. for Elektr. Syst., Alaborg Univ., Aalborg (1985)Google Scholar
  33. [K1]
    KELLER, R. M.: "A solvable program-schema equivalence problem", Proc. 5th Ann. Princeton Conf. on Inf. Sciences and Systems, Princeton (1971) 301–306Google Scholar
  34. [Kn1]
    KNUTH, E.: "Petri nets and regular trace languages", manuscript (1978)Google Scholar
  35. [Kn2]
    KNUTH, E.: "Petri nets and trace languages", Proc. 1st Europ. Conf. on Parallel and Distr. Processing, Toulouse (1979) 51–56Google Scholar
  36. [KG1]
    KNUTH, E. and GYORY, G.: "Paths and traces", Computational Linguistics and Computer Languages 13 (1979) 31–42Google Scholar
  37. [LSB]
    LAUER, P.E., SHIELDS, M.W., BEST, E.: "Formal Theory of the Basic COSY Notation", Technical Report 143, Computing Laboratory, University of Newcastle upon Tyne (1979)Google Scholar
  38. [L1]
    LEVI F. W.: "On semigroups", Bull. of the Calcutta Math. Soc. 36 (1944) 141–146Google Scholar
  39. [M1]
    MAZURKIEWICZ, A.: "Concurrent program schemes and their interpretations", DAIMI Rep. PB-78, Aarhus Univ., Aarhus (1977)Google Scholar
  40. [M2]
    MAZURKIEWICZ, A.: "Equational semantics of concurrent systems", Proc. 8th Spring School on Comp. Sci., Colleville sur mer (1980)Google Scholar
  41. [M3]
    MAZURKIEWICZ, A.: "A calculus of execution traces for concurrent systems", manuscript (1983)Google Scholar
  42. [M4]
    MAZURKIEWICZ, A.: "Traces, histories, graphs: instances of a process monoid", Lecture Notes in Computer Science 176 (1984) 115–133Google Scholar
  43. [M5]
    MAZURKIEWICZ, A.: "Semantics of concurrent systems: a modular fixed-point trace approach", Lecture Notes in Computer Science 188 (1985) 353–375Google Scholar
  44. [M6]
    MAZURKIEWICZ, A.: "Trace Theory", Advances in Petri Nets 1986, Part II, Proceedings of an Advanced Course Lecture Notes in Computer Science 255 (1987) 279–324Google Scholar
  45. [Me1]
    METIVIER, Y.: "Une condition suffisante de reconaissabilite dans un monoide partiellement commutatif", Techn. Rep. 8417, U.E.R. de Math. et d'Inform., Univ. de Bordeaux, Bordeaux (1984)Google Scholar
  46. [Me2]
    METIVIER, Y.: "Sous-ensemble reconnaisable d'un monoide partiellment commutatif libre", manuscript (1985)Google Scholar
  47. [NPW1]
    NIELSEN, M., PLOTKIN, G., WINSKEL, G.: "Petri nets, event structures and domains, Part 1", Theoretical Computer Science 13 (1981) 85–108CrossRefGoogle Scholar
  48. [01]
    OCHMANSKI, E.: "Regular trace languages", Ph. D. Thesis (1985) (summary in Bull. of EATCS 27, 1985)Google Scholar
  49. [P1]
    Perrin, D.: "Words over a partially commutative alphabet", NATO ASI Series F12 (1985) 329–340Google Scholar
  50. [Pet1]
    PETRI, C.A.: "Concepts of Net Theory", Proceedings of the Symposium and Summer School on MFCS'73, High Tatras (1973)Google Scholar
  51. [Pet2]
    PETRI, C.A.: "Non-Sequential Processes", GMD-ISF Report 77.05, Gesellschaft fuer Mathematik und Datenverarbeitung mbH Bonn (1977)Google Scholar
  52. [R1]
    REISIG, W.: "Petri nets — an introduction", EATCS Monographs on Theoretical Computer Science, Springer Verlag (1985)Google Scholar
  53. [Re1]
    REM, M.: "Concurrent Computations and VLSI Circuits", Control Flow and Data Flow: Concepts of Distributed Programming (M. Broy, editor), Springer (1985) 399–437Google Scholar
  54. [Ro1]
    ROZENBERG, G.: "Behaviour of elementary net systems", Advances in Petri Nets 1986, Part I, Proceedings of an Advanced Course Lecture Notes in Computer Science 254 (1987) 60–94Google Scholar
  55. [RT1]
    ROZENBERG, G., THIAGARAJAN, P.S.: "Petri Nets: Basic Notions, Structure and Behaviour", Lecture Notes in Computer Science 224, (1986) 585–668Google Scholar
  56. [Ry1]
    RYTTER, W.: "Some properties of trace languages", Fundamenta Informaticae 7 (1984) 117–127Google Scholar
  57. [S1]
    SAKAROVITCH, J.: "On regular trace languages", to appear (1986)Google Scholar
  58. [Sh1]
    SHIELDS, M.W.: "Adequate Path Expressions", Lecture Notes in Computer Science 70, (1979) 249–265Google Scholar
  59. [Sh2]
    SHIELDS, M.W.: "Non-Sequential Behaviour", Part 1, Int. Report CSR-120-82, Dept. of Computer Science, University of Edinburgh (1982)Google Scholar
  60. [Sh3]
    SHIELDS, M.W.: "Concurrent Machines", The Computer Journal 28, Nr. 5 (1988) 449–466CrossRefGoogle Scholar
  61. [St1]
    STARKE, P. H.: "Processes in Petri Nets", Elektron. Inf. und Kyb. 17 (1981)Google Scholar
  62. [St2]
    STARKE, P. H.: "Traces and semiwords", Lecture Notes in Computer Science 208 (1985) 332–349Google Scholar
  63. [Sz1]
    SZIJARTO, M.: "A classification and closure properties of languages for describing concurrent system behaviours", Fundamenta Informaticae 4 (1981) 531–549Google Scholar
  64. [T1]
    TARLECKI, A.: "Notes on the implementability of formal languages by concurrent systems", ICS PAS Report 481, Inst. of Comp. Science, Polish Academy of Sciences, Warszawa (1982)Google Scholar
  65. [Th1]
    THIAGARAJAN, P.S.: "Elementary net systems", Advances in Petri Nets 1986, Part I, Proceedings of an Advanced Course Lecture Notes in Computer Science 254 (1987) 26–59Google Scholar
  66. [Z1]
    ZIELONKA, W.: "Proving assertions about parallel programs by means of traces", ICS PAS Report 424, Inst. of Comp. Science, Polish Academy of Sciences, Warszawa (1980)Google Scholar
  67. [Z2]
    ZIELONKA, W.: "The notes on finite state asynchronous automata and trace languages", manuscript (1982)Google Scholar
  68. [Z3]
    ZIELONKA, W.: "Notes on Finite Asynchronous Automata", Informatique Theorique et Applications 21, Nr. 2, (1987) 99–135Google Scholar
  69. [Zu1]
    ZUIDWEG, H.: "Trace approach to synchronic distances" (manuscript), University of Leiden, Leiden (1986)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Antoni Mazurkiewicz
    • 1
  1. 1.Polish Academy of SciencesInstitute of Computer ScienceWarsaw

Personalised recommendations