rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Finite representations of CCS and TCSP programs by automata and Petri nets
  name:
    name part: Taubner, Dirk
    name part: 1959-
    role:
      role term: creator
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  genre: bibliography
  genre: Electronic books.
  origin info:
    place:
      place term: gw
    date issued: 1989
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: remote
    extent: 1 online resource (x, 168 pages) : illustrations
  abstract: 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
  note: Dirk Taubner.
  note: Electronic resource.
  note: Includes bibliographical references (pages [159]-164).
  subject:
    topic: Electronic data processing
    topic: Distributed processing
  subject:
    topic: Petri nets
  subject:
    topic: Programming languages (Electronic computers)
  subject:
    topic: Electronic data processing
    topic: Distributed processing
  subject:
    topic: Petri nets
  subject:
    topic: Programming languages (Electronic computers)
  classification: QA76.9.D5 T39 1989
  classification: 004/.36
  related item:
    identifier: (OCoLC)20170933
  related item:
    title info:
      title: Lecture notes in computer science ; 369
  identifier: 9783540482154 (electronic bk.)
  identifier: 3540482156 (electronic bk.)
  identifier: 9783540515258
  identifier: 0387515259 (U.S.)
  identifier: 9780387515250 (U.S.)
  identifier: 89021604
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record content source: SCPER
    record creation date: 890724
    record change date: 20260422215545.5
    record identifier: in00003507534