Items related to 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, 369) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
- PublisherSpringer
- Publication date1989
- ISBN 10 3540515259
- ISBN 13 9783540515258
- BindingPaperback
- LanguageEnglish
- Number of pages184
Search results for Finite Representations of CCS and TCSP Programs by...
Stock Image
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets (Lecture Notes in Computer Science 369)
Published by
Springer-Verlag, Berlin, 1989
ISBN 10: 3540515259
ISBN 13: 9783540515258
Used
Paperback
Seller: PsychoBabel & Skoob Books, Didcot, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Good. Dust Jacket Condition: 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. Seller Inventory # 094504
Quantity: 1 available
Seller Image
Finite representations of CCS and TCSP programs by Automata and Petri nets. Lecture notes in computer science
ISBN 10: 3540515259
ISBN 13: 9783540515258
Used
kart.
Seller: NEPO UG, Rüsselsheim am Main, Germany
Seller rating 5 out of 5 stars
kart. Condition: 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. Seller Inventory # 182954
Quantity: 1 available
Seller Image
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets (Lecture Notes in Computer Science)
Seller: NEPO UG, Rüsselsheim am Main, Germany
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 367810
Quantity: 1 available
Stock Image
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Published by
Springer Berlin Heidelberg, 1989
ISBN 10: 3540515259
ISBN 13: 9783540515258
Used
Softcover
Seller: Buchpark, Trebbin, Germany
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 838488/202
Quantity: 1 available
Stock Image
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets (Lecture Notes in Computer Science, 369)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020168891
Quantity: Over 20 available
Stock Image
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets (Lecture Notes in Computer Science, 369)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540515258_new
Quantity: Over 20 available
Seller Image
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Published by
Springer Berlin Heidelberg, 1989
ISBN 10: 3540515259
ISBN 13: 9783540515258
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540515258
Quantity: 1 available
Stock Image
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783540515258
Quantity: 10 available
Seller Image
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Published by
Springer Berlin Heidelberg, 1989
ISBN 10: 3540515259
ISBN 13: 9783540515258
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: 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 . Seller Inventory # 4892005
Quantity: Over 20 available
Seller Image
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Published by
Springer Berlin Heidelberg Aug 1989, 1989
ISBN 10: 3540515259
ISBN 13: 9783540515258
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540515258
Quantity: 2 available