Combinatorics on Traces [electronic resource] / by Volker Diekert.

By: Diekert, Volker [author.]Contributor(s): SpringerLink (Online service)Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science: 454Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1990Description: XIV, 174 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540463184Subject(s): Computer science | Logic design | Combinatorics | Computer Science | Mathematical Logic and Formal Languages | Logics and Meanings of Programs | Programming Techniques | Programming Languages, Compilers, Interpreters | CombinatoricsAdditional physical formats: Printed edition:: No titleDDC classification: 005.131 LOC classification: QA8.9-QA10.3Online resources: Click here to access online
Contents:
Free partialy commutative monoids -- Recognizable and rational trace languages -- Petri nets and synchronization -- Complete semi-thue systems and möbius functions -- Trace replacement systems.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

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

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.

There are no comments on this title.

to post a comment.

Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha