Combinatorics on traces
Author(s)
Bibliographic Information
Combinatorics on traces
（Lecture notes in computer science, 454）
Springer-Verlag, c1990
- : gw
- : us
Available at / 62 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||45490093765
-
University of Tsukuba Library, Library on Library and Information Science
: gw007.08:L-49:454901008600
-
No Libraries matched.
- Remove all filters.
Note
Bibliographical references: p. [157]-164
Including index
Description and Table of Contents
Description
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.
Table of Contents
Free partialy commutative monoids.- Recognizable and rational trace languages.- Petri nets and synchronization.- Complete semi-thue systems and moebius functions.- Trace replacement systems.
by "Nielsen BookData"
