An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages

  • A. Bertoni
  • M. Brambilla
  • G. Mauri
  • N. Sabadini
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)


Rational Number Strict Sense Formal Power Series Regular Language Usual Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Berstel, J., Sur la densité asymptotique de languages formels, in "Automata, Languages and Programming" (M. Nivat ed.), North Holland, Amsterdam, 1973, pp. 345–358Google Scholar
  2. [2]
    Bertoni, A., Mathematical methods of the theory of stochastic automata, Lect. Not. in Comp. Sci. 28, Springer, Berlin, 1974, pp.9–23Google Scholar
  3. [3]
    Chomsky, N., Schuetzenberger, P., The algebraic theory of context-free languages, in "Computer Programming and Formal Systems", North Holland, Amsterdam, 1963Google Scholar
  4. [4]
    Furtek, F., A new approach to Petri nets, MIT Computation Structures Group Memo 123, 1975Google Scholar
  5. [5]
    Knuth, E., Cycles of partial orders, Lect. Not. in Comp. Sci. 64, Springer, Berlin, 1978Google Scholar
  6. [6]
    Knuth, E., Petri nets and trace languages, Proc. 1st European Conf. on Parallel and Distributed Processing, Toulouse, 1979Google Scholar
  7. [7]
    Janicki, R., Synthesis of concurrent schemes, Lect. Not. in Comp. Sci. 64, Springer, Berlin, 1978, pp.298–307Google Scholar
  8. [8]
    Janicki, R., A characterization of concurrency-like relations, Lect. Not. in Comp. Sci. 70, Springer, Berlin, 1979, pp.109–122Google Scholar
  9. [9]
    Lallement, G., Semigroups and Combinatorial Applications, J. Wiley and Sons, New York, 1979Google Scholar
  10. [10]
    Mazurkiewicz, A., Concurrent program schemes and their interpretations, DAIMI, PB 78, Aarhus University, 1977Google Scholar
  11. [11]
    McNaughton,L.,Papert,S., Counter free automata, MIT Press, 1971Google Scholar
  12. [12]
    Petri, C.A., Non sequential processes, ISF Report 77-01, GMD, Bonn, 1977Google Scholar
  13. [13]
    Petri, C.A., Concurrency as a basis of system thinking, ISF Report 7806, GMD, Bonn, 1978Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • A. Bertoni
    • 1
  • M. Brambilla
    • 1
  • G. Mauri
    • 1
    • 2
  • N. Sabadini
    • 1
  1. 1.Istituto di CiberneticaUniversità di MilanoMilanoItaly
  2. 2.Istituto di Matematica, Sistemistica e InformaticaUniversità di UdineUdineItaly

Personalised recommendations