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...
Sparad:
| Huvudupphovsman: | |
|---|---|
| Materialtyp: | Thèse numérique |
| Språk: | Anglais |
| Publicerad: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
369 |
| Ämnen: | |
| Länkar: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmärkning: |
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 |
| LEADER | 04192nam a22004097a 4500 | ||
|---|---|---|---|
| 001 | 944033 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155172247 | ||
| 020 | |a 9783540482154 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004.36 | ||
| 082 | |a 004 | ||
| 100 | 1 | |a Taubner, Dirk, |d 1959- | |
| 245 | 1 | 0 | |a Finite representations of CCS and TCSP programs by automata and Petri nets |c Dirk Taubner. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 369 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a 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 Communicating Sequential Processes (CSP) as main representatives. On the other hand there are machine models, i.e. the classical finite state automata (transition systems), for which, however, more discriminating notions of equivalence than equality of languages are used; and secondly, there are differently powerful types of Petri nets, namely safe and general (place/transition) nets respectively, and predicate/transition nets. Within a uniform framework the syntax and the operational semantics of CCS and TCSP are explained. We consider both, Milner's well-known interleaving semantics, which is based on infinite transition systems, as well as the new distributed semantics introduced by Degano et al., which is based on infinite safe nets. The main part of this work contains three syntax-driven constructions of transition systems, safe nets, and predicate/transition nets respectively. Each of them is accompanied by a proof of consistency. Due to intrinsic limits, which are also investigated here, neither for transition systems and finite nets, nor for general nets does a finite consistent representation of all CCS and TCSP programs exist. However sublanguages which allow finite representations are discerned. On the other hand the construction of predicate/transition nets is possible for all CCS programs in which every choice and every recursive body starts sequentially. | ||
| 650 | |a Informatique | ||
| 650 | |a Traitement réparti | ||
| 650 | |a Langages de programmation | ||
| 650 | |a Ordinateurs | ||
| 650 | |a Petri, Réseaux de | ||
| 650 | |a Logique symbolique et mathématique | ||
| 776 | 0 | |0 021234396 |t Finite representations of CCS and TCSP programs by automata and Petri nets |f Dirk Taubner |c Berlin |n Springer-Verlag |d 1989 |p 1 vol. (X-168 p.) |s Lecture notes in computer science |z 3-540-51525-9 | |
| 776 | 0 | |t Finite Representations of CCS and TCSP Programs by Automata and Petri Nets |b Texte imprimé |z 9783662207574 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-51525-9 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-M6JC8X81-R |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747923337 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-51525-9 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750935626 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-51525-9 |z Accès INSA CVL | |
| 997 | |0 944033 |1 Thèse numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||