0
Your cart

Your cart is empty

Books > Computing & IT > Computer hardware & operating systems > Computer architecture & logic design > Parallel processing

Buy Now

Finite Representations of CCS and TCSP Programs by Automata and Petri Nets (Paperback, 1989 ed.) Loot Price: R1,625
Discovery Miles 16 250
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets (Paperback, 1989 ed.): Dirk A. Taubner

Finite Representations of CCS and TCSP Programs by Automata and Petri Nets (Paperback, 1989 ed.)

Dirk A. Taubner

Series: Lecture Notes in Computer Science, 369

 (sign in to rate)
Loot Price R1,625 Discovery Miles 16 250 | Repayment Terms: R152 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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.

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Lecture Notes in Computer Science, 369
Release date: August 1989
First published: 1989
Authors: Dirk A. Taubner
Dimensions: 235 x 155 x 9mm (L x W x T)
Format: Paperback
Pages: 172
Edition: 1989 ed.
ISBN-13: 978-3-540-51525-8
Categories: Books > Computing & IT > Computer hardware & operating systems > Computer architecture & logic design > Parallel processing
Promotions
LSN: 3-540-51525-9
Barcode: 9783540515258

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Edsger Wybe Dijkstra - His Life, Work…
Krzysztof R. Apt, Tony Hoare Hardcover R3,326 Discovery Miles 33 260
Kreislauf des Lebens
Jacob Moleschott Hardcover R1,305 Discovery Miles 13 050
Constraint Decision-Making Systems in…
Santosh Kumar Das, Nilanjan Dey Hardcover R7,630 Discovery Miles 76 300
Applying Integration Techniques and…
Gabor Kecskemeti Hardcover R6,903 Discovery Miles 69 030
Creativity in Load-Balance Schemes for…
Alberto Garcia-Robledo, Arturo Diaz Perez, … Hardcover R4,447 Discovery Miles 44 470
Blockchain - Novice to Expert - 2…
Keizer Soeze Hardcover R1,138 R957 Discovery Miles 9 570
Cyber-Physical Systems for Social…
Maya Dimitrova, Hiroaki Wagatsuma Hardcover R7,449 Discovery Miles 74 490
Concurrency - The Works of Leslie…
Dahlia Malkhi Hardcover R2,810 Discovery Miles 28 100
Migrating Legacy Applications…
Anca Daniela Ionita, Marin Litoiu, … Hardcover R5,640 Discovery Miles 56 400
Cloud Technology - Concepts…
Irma Hardcover R20,397 Discovery Miles 203 970
Cloud Technology - Concepts…
Irma Hardcover R20,400 Discovery Miles 204 000
Blockchain Applications
Arshdeep Bagha Hardcover R2,137 R1,728 Discovery Miles 17 280

See more

Partners