Articles liés à Finite Representations of CCS and TCSP Programs by...
- ÉditeurSpringer
- Date d'édition2008
- ISBN 10 3540515259
- ISBN 13 9783540515258
- ReliureBroché
- Langueanglais
- Nombre de pages184
Acheter neuf
Afficher cet article
EUR 54,15
EUR 3,55 expédition vers Etats-Unis
Destinations, frais et délais
Résultats de recherche pour Finite Representations of CCS and TCSP Programs by...
Image d'archives
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets (Lecture Notes in Computer Science 369)
Edité par
Springer-Verlag, Berlin, 1989
ISBN 10 : 3540515259
ISBN 13 : 9783540515258
Ancien ou d'occasion
Paperback
Vendeur : PsychoBabel & Skoob Books, Didcot, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Good. Etat de la jaquette : No Dust Jacket. Lecture Notes in Computer Science 369; Ex-Library. Previous owner's sticker on the front cover. Small pen inscription on title page; library catalogue sticker on colophon. Faintly bumped/scuffed spine head and leading corners. Sound, clean book with tight binding. ADG. Ex-Library. N° de réf. du vendeur 094504
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Finite representations of CCS and TCSP programs by Automata and Petri nets. Lecture notes in computer science
ISBN 10 : 3540515259
ISBN 13 : 9783540515258
Ancien ou d'occasion
kart.
Vendeur : NEPO UG, Rüsselsheim am Main, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
kart. Etat : Gut. X, 168 S. : graph. Darst. , 25 cm Sofort verfügbar / Versand spätestens am nächsten Arbeitstag / Rechnung mit ausgewiesener MwSt. liegt bei / daily shipping worldwide with invoice / ex library in good condition / aus Bibliothek in guten Zustand/ Sprache: Englisch Gewicht in Gramm: 550. N° de réf. du vendeur 182954
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets (Lecture Notes in Computer Science)
Edité par
Springer, 1989
ISBN 10 : 3540515259
ISBN 13 : 9783540515258
Ancien ou d'occasion
Couverture souple
Vendeur : NEPO UG, Rüsselsheim am Main, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : Sehr gut. Auflage: 1989. 184 Seiten ex Library Book / aus einer wissenschafltichen Bibliothek / Sprache: Englisch Gewicht in Gramm: 969 23,5 x 15,5 x 1,1 cm, Taschenbuch. N° de réf. du vendeur 367810
Quantité disponible : 1 disponible(s)
Image d'archives
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Edité par
Springer Berlin Heidelberg, 1989
ISBN 10 : 3540515259
ISBN 13 : 9783540515258
Ancien ou d'occasion
Couverture souple
Vendeur : Buchpark, Trebbin, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : Sehr gut. Zustand: Sehr gut - Gepflegter, sauberer Zustand. Aus der Auflösung einer renommierten Bibliothek. Kann Stempel beinhalten. | Seiten: 184 | Sprache: Englisch | Produktart: Bücher. N° de réf. du vendeur 838488/202
Quantité disponible : 1 disponible(s)
Image d'archives
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets (Lecture Notes in Computer Science, 369)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020168891
Quantité disponible : Plus de 20 disponibles
Image d'archives
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets (Lecture Notes in Computer Science, 369)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783540515258_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Edité par
Springer Berlin Heidelberg, 1989
ISBN 10 : 3540515259
ISBN 13 : 9783540515258
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This work relates different approaches for the modelling of parallel processes. On the one hand there are theso-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. N° de réf. du vendeur 9783540515258
Quantité disponible : 1 disponible(s)
Image d'archives
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9783540515258
Quantité disponible : 10 disponible(s)
Image fournie par le vendeur
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Edité par
Springer Berlin Heidelberg, 1989
ISBN 10 : 3540515259
ISBN 13 : 9783540515258
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 . N° de réf. du vendeur 4892005
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Edité par
Springer Berlin Heidelberg Aug 1989, 1989
ISBN 10 : 3540515259
ISBN 13 : 9783540515258
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This work relates different approaches for the modelling of parallel processes. On the one hand there are theso-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. 184 pp. Englisch. N° de réf. du vendeur 9783540515258
Quantité disponible : 2 disponible(s)