Finite representations of CCS and TCSP programs by automata and Petri nets
This work relates different approaches for the modelling of parallel processes. On the one hand there are the so-called "process algebras" or "abstract programming languages" with Milner's Calculus of Communicating Systems (CCS) and the theoretical version of Hoare's Co...
Enregistré dans:
| 主要作者: | |
|---|---|
| 格式: | Thèse numérique |
| 語言: | Anglais |
| 出版: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| 叢編: | Lecture notes in computer science
369 |
| 主題: | |
| 在線閱讀: | 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: | • Finite representations of CCS and TCSP programs by automata and Petri nets, Dirk Taubner, Berlin, Springer-Verlag, 1989, 1 vol. (X-168 p.), Lecture notes in computer science, 3-540-51525-9 • Finite Representations of CCS and TCSP Programs by Automata and Petri Nets, Texte imprimé, 9783662207574 |
書本目錄:
- Abstract programming languages
- Connections with language theory
- Representation by finite automata
- Representation by finite and safe Petri nets
- A remark on the representation by finite Petri nets
- Representation by finite and strict predicate/transition nets.