+612 9045 4394
 
CHECKOUT
Combinatorics on Traces : Lecture Notes in Computer Science - Volker Diekert

Combinatorics on Traces

Lecture Notes in Computer Science

Paperback

Published: 12th September 1990
Ships: 5 to 9 business days
5 to 9 business days
$116.16
or 4 easy payments of $29.04 with Learn more
if ordered within

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.

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

ISBN: 9783540530312
ISBN-10: 3540530312
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 174
Published: 12th September 1990
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 0.99
Weight (kg): 0.27