Combinatorics on traces. [Ed. board: D. Barstow .], Lecture notes in computer science

Diekert, Volker

ISBN 10: 3540530312 / ISBN 13: 9783540530312

Editore: Berlin , Heidelberg , New York , London , Paris , Tokyo , Hong Kong , Barcelona : Springer, 1990

Riguardo questo articolo

XII, 164 S. : graph. Darst. , 25 cm Sofort verfügbar Versand spätestens am nächsten Arbeitstag Rechnung mit ausgewiesener MwSt. liegt bei daily shipping worldwide with invoice ex library in good condition aus Bibliothek in guten Zustand Sprache: Englisch Gewicht in Gramm: 550.

Codice articolo 182910

Dati bibliografici

• Titolo: Combinatorics on traces. [Ed. board: D. Barstow .], Lecture notes in computer science
• Editore: Berlin , Heidelberg , New York , London , Paris , Tokyo , Hong Kong , Barcelona : Springer
• Data di pubblicazione: 1990
• Lingua: Inglese
• ISBN 10: 3540530312
• ISBN 13: 9783540530312
• Rilegatura: kart.
• Condizione: Gut
• Peso: 550 grammi
• Cataloghi dei venditori:
  • Alle Bücher

Descrizione articolo

Riassunto

Parallelism or concurrency is one of the fundamental concepts in computer science. But in spite of its importance, theoretical methods to handle concurrency are not yet sufficiently developed. This volume presents a comprehensive study of Mazurkiewicz' trace theory from an algebraic-combinatorial point of view. This theory is recognized as an important tool for a rigorous mathematical treatment of concurrent systems. The volume covers several different research areas, and contains not only known results but also various new results published nowhere else. Chapter 1 introduces basic concepts. Chapter 2 gives a straight path to Ochmanski's characterization of recognizable trace languages and to Zielonka's theory of asynchronous automata. Chapter 3 applies the theory of traces to Petri nets. A kind of morphism between nets is introduced which generalizes the concept of synchronization. Chapter 4 provides a new bridge between the theory of string rewriting and formal power series. Chapter 5 is an introduction to a combinatorial theory of rewriting on traces which can be used as an abstract calculus for transforming concurrent processes.

Contenuti

Free partialy commutative monoids.- Recognizable and rational trace languages.- Petri nets and synchronization.- Complete semi-thue systems and möbius functions.- Trace replacement systems.