The Book of TracesThe theory of traces employs techniques and tackles problems from quite diverse areas which include formal language theory, combinatorics, graph theory, algebra, logic, and the theory of concurrent systems. In all these areas the theory of traces has led to interesting problems and significant results. It has made an especially big impact in formal language theory and the theory of concurrent systems. In both these disciplines it is a well-recognized and dynamic research area. Within formal language theory it yields the theory of partially commutative monoids, and provides an important connection between languages and graphs. Within the theory of concurrent systems it provides an important formal framework for the analysis and synthesis of concurrent systems.This monograph covers all important research lines of the theory of traces; each chapter is devoted to one research line and is written by leading experts. The book is organized in such a way that each chapter can be read independently ? and hence it is very suitable for advanced courses or seminars on formal language theory, the theory of concurrent systems, the theory of semigroups, and combinatorics. An extensive bibliography is included. At present, there is no other book of this type on trace theory. |
Contents
Introduction to Trace Theory | 3 |
Dependence Graphs | 43 |
ALGEBRA AND COMBINATORICS | 69 |
Combinatorics in Trace Monoids II | 83 |
Counting Techniques for Inclusion Equivalence and Membership | 131 |
LANGUAGES AND AUTOMATA | 165 |
Asynchronous Automata | 205 |
Construction of Asynchronous Automata | 249 |
CONCURRENCY AND LOGIC | 269 |
Traces and Logic | 307 |
GENERALIZATIONS | 391 |
SemiCommutations | 487 |
| 553 | |
Other editions - View all
Common terms and phrases
actions acyclic algebraic algorithm alph(u asynchronous cellular automaton behaviour characterization closure complex trace languages concatenation concurrent connected components Corollary CTLp d-graph defined Definition denote dependence graph equivalence event structures Example exists fat-system Figure finite monoid finite traces fo(u formula free monoids Hence implies independence alphabet independence relation induction hypothesis infinite integer isomorphic ISTL labelled least upper bound Lemma letter logic Lyndon trace Lyndon words mapping model checking morphism nodes notion obtain occurrences partial commutation partial order Petri nets poset prefix Proof properties Proposition prove real trace languages REC(M recognizable languages recognizable real trace regular language result satisfies semantics semi-commutation function semi-commutation relation strings strongly connected strongly connected component subset T₁ Theorem trace monoid trace structures trace system transfinite traces transition relation transitive closure w₁ Z-code Σ₁


