| 書目名稱 | Combinatorics on Traces |
| 編輯 | Volker Diekert |
| 視頻video | http://file.papertrans.cn/231/230051/230051.mp4 |
| 叢書名稱 | Lecture Notes in Computer Science |
| 圖書封面 |  |
| 描述 | 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. |
| 出版日期 | Book 1990 |
| 關(guān)鍵詞 | Automat; Automatentheorie; Ersetzungssysteme; Spurtheorie; Verteilte (nebenl?ufige) Systeme; automata; com |
| 版次 | 1 |
| doi | https://doi.org/10.1007/3-540-53031-2 |
| isbn_softcover | 978-3-540-53031-2 |
| isbn_ebook | 978-3-540-46318-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag Berlin Heidelberg 1990 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-5 22:31
發(fā)表于 2025-3-21 17:30:30
