Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume contains selected papers for the Parcella '88, the Fourth International Workshop on "Parallel Processing by Cellular Automata and Arrays" held in Berlin from October 17 to 21, 1988. The profile of the Parcella workshop series is focused on problems of processing by regular structures, i.e. their "flexibilization" or adapting to "irregular" algorithms and, closely related to this, on the "regularization" of algorithms for their embedding into regular structures. It seems that these problems will have an increasing priority within the list of central problems in parallelization and will determine the profile of Parcella for the next years.

Computer architecture. Operating systems --- 681.3 *C2 --- 681.3*D13 --- 681.3*F2 --- Computer communication networks: data communications; OSI; security and protection --- Concurrent programming --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*D13 Concurrent programming --- 681.3 *C2 Computer communication networks: data communications; OSI; security and protection --- Computer network architectures. --- Computer science. --- Computer System Implementation. --- Computation by Abstract Devices. --- Programming Techniques. --- Processor Architectures. --- Informatics --- Science --- Architectures, Computer network --- Network architectures, Computer --- Computer architecture --- Parallel processing (Electronic computers)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Programming --- Algebra --- Computer software --- Algèbre --- Logiciels --- Congresses --- Development --- Congrès --- Développement --- Data structures (Computer science) --- SDL (Computer program language) --- Computer programs --- 681.3*C22 --- 681.3*D13 --- 681.3*F3 --- Network protocols: protocol architecture; protocol verification --- Concurrent programming --- Logics and meanings of programs (Theory of computation) --- 681.3*F3 Logics and meanings of programs (Theory of computation) --- 681.3*D13 Concurrent programming --- 681.3*C22 Network protocols: protocol architecture; protocol verification --- Algèbre --- Congrès --- Développement --- Software engineering. --- Computer science. --- Computer Communication Networks. --- Logic design. --- Software Engineering. --- Software Engineering/Programming and Operating Systems. --- Programming Languages, Compilers, Interpreters. --- Programming Techniques. --- Logics and Meanings of Programs. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Informatics --- Science --- Computer software engineering --- Engineering --- Data structures (Computer science) - Congresses --- Algebra - Computer programs - Congresses --- SDL (Computer program language) - Congresses --- Congresses.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Computer science --- 681.3*D13 --- 681.3*D31 --- 681.3*F11 --- 681.3*F32 --- 681.3*F4 --- Concurrent programming --- 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} --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Semantics of programming languages: algebraic approaches to semantics; denotational semantics; operational semantics (Logics and meanings of programs)--See also {681.3*D31} --- Mathematical logic and formal languages (Theory of computation) --- 681.3*F4 Mathematical logic and formal languages (Theory of computation) --- 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} --- 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} --- 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} --- 681.3*D13 Concurrent programming --- Computer network architectures. --- Logic design. --- Computer science. --- Computer System Implementation. --- Logics and Meanings of Programs. --- Computation by Abstract Devices. --- Mathematical Logic and Formal Languages. --- Programming Techniques. --- Programming Languages, Compilers, Interpreters. --- Informatics --- Science --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Architectures, Computer network --- Network architectures, Computer --- Computer architecture