Articoli correlati a Finite Representations of CCS and TCSP Programs by...
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreSpringer
- Data di pubblicazione2008
- ISBN 10 3540515259
- ISBN 13 9783540515258
- RilegaturaCopertina flessibile
- LinguaInglese
- Numero di pagine184
- Contatto del produttorenon disponibile
Compra nuovo
Visualizza questo articolo
EUR 48,37
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costi
Risultati della ricerca per Finite Representations of CCS and TCSP Programs by...
Immagini fornite dal venditore
Finite representations of CCS and TCSP programs by Automata and Petri nets. Lecture notes in computer science
ISBN 10: 3540515259
ISBN 13: 9783540515258
Antico o usato
kart.
Da: NEPO UG, Rüsselsheim am Main, Germania
Valutazione del venditore 5 su 5 stelle
kart. Condizione: 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. Codice articolo 182954
Quantità: 1 disponibili
Foto dell'editore
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Editore:
Springer Berlin Heidelberg, 1989
ISBN 10: 3540515259
ISBN 13: 9783540515258
Antico o usato
Brossura
Da: Buchpark, Trebbin, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: Sehr gut. Zustand: Sehr gut | Seiten: 184 | Sprache: Englisch | Produktart: Bücher. Codice articolo 838488/202
Quantità: 1 disponibili
Immagini fornite dal venditore
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets (Lecture Notes in Computer Science)
Da: NEPO UG, Rüsselsheim am Main, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 367810
Quantità: 1 disponibili
Foto dell'editore
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets (Lecture Notes in Computer Science 369)
Editore:
Springer-Verlag, Berlin, 1989
ISBN 10: 3540515259
ISBN 13: 9783540515258
Antico o usato
Paperback
Da: PsychoBabel & Skoob Books, Didcot, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Good. Condizione sovraccoperta: 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. Codice articolo 094504
Quantità: 1 disponibili
Immagini fornite dal venditore
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: 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 . Codice articolo 4892005
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Editore:
Springer Berlin Heidelberg, 1989
ISBN 10: 3540515259
ISBN 13: 9783540515258
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783540515258
Quantità: 1 disponibili
Immagini fornite dal venditore
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
ISBN 10: 3540515259
ISBN 13: 9783540515258
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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. 184 pp. Englisch. Codice articolo 9783540515258
Quantità: 1 disponibili
Foto dell'editore
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets (Lecture Notes in Computer Science, 369)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783540515258_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Editore:
Springer Berlin Heidelberg Aug 1989, 1989
ISBN 10: 3540515259
ISBN 13: 9783540515258
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783540515258
Quantità: 2 disponibili
Foto dell'editore
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 5 su 5 stelle
PF. Condizione: New. Codice articolo 6666-IUK-9783540515258
Quantità: 10 disponibili