Amazon cover image
Image from Amazon.com

Finite representations of CCS and TCSP programs by automata and Petri nets / Dirk Taubner.

By: Material type: TextTextSeries: Lecture notes in computer science ; 369.Publication details: Berlin ; New York : Springer-Verlag, ©1989.Description: 1 online resource (x, 168 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540482154
  • 3540482156
  • 0387515259
  • 9780387515250
Subject(s): Genre/Form: Additional physical formats: Print version:: Finite representations of CCS and TCSP programs by automata and Petri nets.DDC classification:
  • 004/.36 20
LOC classification:
  • QA76.9.D5 T39 1989
Other classification:
  • 54.10
  • *68-02
  • 68N25
  • 68Q85
  • 28
Online resources:
Contents:
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.
Action note:
  • digitized 2022. HathiTrust Digital Library committed to preserve
Summary: Annotation 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.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes bibliographical references (pages 159-164).

Annotation 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.

Print version record.

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.

Use copy Restrictions unspecified star MiAaHDL

Electronic reproduction. [Place of publication not identified]: HathiTrust Digital Library. 2022. MiAaHDL

Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL

http://purl.oclc.org/DLF/benchrepro0212

digitized 2022. HathiTrust Digital Library committed to preserve pda MiAaHDL

Powered by Koha