Finite Representations of CCS and TCSP Programs by Automata and Petri Nets. 1st ed. 1989

種類:

電子ブック

責任表示:

by Dirk A. Taubner

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1989

著者名:

• Taubner, Dirk A.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 369

ISBN:

9783540482154 [3540482156]    

注記:

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

ローカル注記:

学内専用E-BOOKS (local access only)