.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Dirk A. Taubner
€ 67.85
FREE Delivery in Ireland
Description for Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
Paperback. Focuses on 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. Series: Lecture Notes in Computer Science. Num Pages: 172 pages, biography. BIC Classification: UYFP. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 155 x 9. Weight in Grams: 590.
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 ... Read more
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 ... Read more
Product Details
Format
Paperback
Publication date
1989
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Germany
Number of pages
172
Condition
New
Series
Lecture Notes in Computer Science
Number of Pages
172
Place of Publication
Berlin, Germany
ISBN
9783540515258
SKU
V9783540515258
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Finite Representations of CCS and TCSP Programs by Automata and Petri Nets