Verwandte Artikel zu Finite Representations of CCS and TCSP Programs by...
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets: 369 (Lecture Notes in Computer Science) - Softcover
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagSpringer
- Erscheinungsdatum2008
- ISBN 10 3540515259
- ISBN 13 9783540515258
- EinbandTapa blanda
- SpracheEnglisch
- Anzahl der Seiten184
Neu kaufen
Diesen Artikel anzeigen
EUR 53,49
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & Dauer
Suchergebnisse für Finite Representations of CCS and TCSP Programs by...
Beispielbild für diese ISBN
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Verlag:
Springer Berlin Heidelberg, 1989
ISBN 10: 3540515259
ISBN 13: 9783540515258
Gebraucht
Softcover
Anbieter: Buchpark, Trebbin, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 838488/202
Anzahl: 1 verfügbar
Foto des Verkäufers
Finite representations of CCS and TCSP programs by Automata and Petri nets. Lecture notes in computer science
ISBN 10: 3540515259
ISBN 13: 9783540515258
Gebraucht
kart.
Anbieter: NEPO UG, Rüsselsheim am Main, Deutschland
Verkäuferbewertung 5 von 5 Sternen
kart. Zustand: 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. Bestandsnummer des Verkäufers 182954
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets (Lecture Notes in Computer Science 369)
Verlag:
Springer-Verlag, Berlin, 1989
ISBN 10: 3540515259
ISBN 13: 9783540515258
Gebraucht
Paperback
Anbieter: PsychoBabel & Skoob Books, Didcot, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: Good. Zustand des Schutzumschlags: 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. Bestandsnummer des Verkäufers 094504
Anzahl: 1 verfügbar
Foto des Verkäufers
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets (Lecture Notes in Computer Science)
Anbieter: NEPO UG, Rüsselsheim am Main, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 367810
Anzahl: 1 verfügbar
Foto des Verkäufers
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783540515258
Anzahl: 1 verfügbar
Foto des Verkäufers
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. 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 . Bestandsnummer des Verkäufers 4892005
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets (Lecture Notes in Computer Science, 369)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9783540515258_new
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Verlag:
Springer Berlin Heidelberg Aug 1989, 1989
ISBN 10: 3540515259
ISBN 13: 9783540515258
Neu
Taschenbuch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783540515258
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
PF. Zustand: New. Bestandsnummer des Verkäufers 6666-IUK-9783540515258
Anzahl: 10 verfügbar
Beispielbild für diese ISBN
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets (Lecture Notes in Computer Science, 369)
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar3113020168891
Anzahl: Mehr als 20 verfügbar