TY - BOOK ID - 2461667 TI - Combinatorics on traces PY - 1990 VL - vol 454 SN - 3540530312 0387530312 3540463186 PB - Berlin New York Springer-Verlag DB - UniCat KW - Formal languages KW - Formele talen KW - Languages [Formal ] KW - Langues formalisées KW - Machines sequentielles [Theorie des ] KW - Sequential machine theory KW - Sequentiele machinetheorie KW - Talen [Formele ] KW - 681.3*F KW - Finite automata KW - Finite state machines (Machine theory) KW - Machine theory KW - Electronic digital computers KW - Formalization (Linguistics) KW - Language and languages KW - Theory of computation KW - 681.3*F Theory of computation KW - Sequential machine theory. KW - Formal languages. KW - Information theory. KW - Computer science. KW - Logic design. KW - Theory of Computation. KW - Discrete Mathematics. KW - Mathematical Logic and Formal Languages. KW - Logics and Meanings of Programs. KW - Programming Techniques. KW - Programming Languages, Compilers, Interpreters. KW - Design, Logic KW - Design of logic systems KW - Digital electronics KW - Electronic circuit design KW - Logic circuits KW - Switching theory KW - Informatics KW - Science KW - Communication theory KW - Communication KW - Cybernetics UR - https://www.unicat.be/uniCat?func=search&query=sysid:2461667 AB - 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. ER -