TY  - BOOK
AU  - Diekert,Volker
ED  - SpringerLink (Online service)
TI  - Combinatorics on Traces
T2  - Lecture Notes in Computer Science,
SN  - 9783540463184
AV  - QA8.9-QA10.3 
U1  - 005.131 23
PY  - 1990///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Logic design
KW  - Combinatorics
KW  - Computer Science
KW  - Mathematical Logic and Formal Languages
KW  - Logics and Meanings of Programs
KW  - Programming Techniques
KW  - Programming Languages, Compilers, Interpreters
N1  - Free partialy commutative monoids -- Recognizable and rational trace languages -- Petri nets and synchronization -- Complete semi-thue systems and möbius functions -- Trace replacement systems
N2  - 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
UR  - http://dx.doi.org/10.1007/3-540-53031-2
ER  -