Combinatorics on Traces by Volker DiekertCombinatorics on Traces by Volker Diekert

Combinatorics on Traces

byVolker Diekert

Paperback | September 12, 1990

Pricing and Purchase Info

$104.61 online 
$116.95 list price save 10%
Earn 523 plum® points

Prices and offers may vary in store


In stock online

Ships free on orders over $25

Not available in stores


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.
Title:Combinatorics on TracesFormat:PaperbackDimensions:180 pagesPublished:September 12, 1990Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540530312

ISBN - 13:9783540530312

Look for similar items by category:


Table of Contents

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