Combinatorics on traces
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-combinatori...
保存先:
| 第一著者: | |
|---|---|
| フォーマット: | Livre numérique |
| 言語: | Anglais |
| 出版事項: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| シリーズ: | Lecture notes in computer science
454 |
| 主題: | |
| オンライン･アクセス: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 注記: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Combinatorics on traces, Volker Diekert, Berlin, Springer-Verlag, 1990, 1 vol. (XII-164 p.), Lecture notes in computer science, 3-540-53031-2 • Combinatorics on Traces, Texte imprimé, 9783662175842 |
目次:
- Free partialy commutative monoids
- Recognizable and rational trace languages
- Petri nets and synchronization
- Complete semi-thue systems and möbius functions
- Trace replacement systems.