Combinatorics on Traces: 454 (Lecture Notes in Computer Science, 454) - Tapa blanda

Diekert, Volker

 
9783540530312: Combinatorics on Traces: 454 (Lecture Notes in Computer Science, 454)
Tapa blanda
ISBN 10: 3540530312 ISBN 13: 9783540530312
Editorial: Springer, 2008

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
2008
Idioma
Inglés
ISBN 10 
3540530312
ISBN 13 
9783540530312
Encuadernación
Tapa blanda
Número de páginas
188
Contacto del fabricante
ProductSafety@springernature.com
ProductSafety@springernature.com

Poststr. 9
Darmstadt
64293
Alemania

Otras ediciones populares con el mismo título

9780387530314: Combinatorics on Traces (Lecture Notes in Computer Science)

Edición Destacada

ISBN 10:  0387530312 ISBN 13:  9780387530314
Tapa blanda