TY - BOOK ID - 1285473 TI - Finite representations of CCS and TCSP programs by automata and Petri nets PY - 1989 VL - vol 369 SN - 3540515259 3540482156 PB - Berlin Heidelberg New York Tokyo Springer DB - UniCat KW - Computer science KW - 681.3*D13 KW - 681.3*D31 KW - 681.3*F11 KW - 681.3*F32 KW - 681.3*F4 KW - Concurrent programming KW - Formal definitions and theory: semantics; syntax (Programming languages)--See also {681.3*D21}; {681.3*F31}; {681.3*F32}; {681.3*F42}; {681.3*F43} KW - Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} KW - Semantics of programming languages: algebraic approaches to semantics; denotational semantics; operational semantics (Logics and meanings of programs)--See also {681.3*D31} KW - Mathematical logic and formal languages (Theory of computation) KW - 681.3*F4 Mathematical logic and formal languages (Theory of computation) KW - 681.3*F32 Semantics of programming languages: algebraic approaches to semantics; denotational semantics; operational semantics (Logics and meanings of programs)--See also {681.3*D31} KW - 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} KW - 681.3*D31 Formal definitions and theory: semantics; syntax (Programming languages)--See also {681.3*D21}; {681.3*F31}; {681.3*F32}; {681.3*F42}; {681.3*F43} KW - 681.3*D13 Concurrent programming KW - Computer network architectures. KW - Logic design. KW - Computer science. KW - Computer System Implementation. KW - Logics and Meanings of Programs. KW - Computation by Abstract Devices. KW - Mathematical Logic and Formal Languages. KW - Programming Techniques. KW - Programming Languages, Compilers, Interpreters. KW - Informatics KW - Science KW - Design, Logic KW - Design of logic systems KW - Digital electronics KW - Electronic circuit design KW - Logic circuits KW - Machine theory KW - Switching theory KW - Architectures, Computer network KW - Network architectures, Computer KW - Computer architecture UR - https://www.unicat.be/uniCat?func=search&query=sysid:1285473 AB - 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. ER -