Publisher: Springer; 1989 edition (June 13, 2008)
Format: PDF / Kindle / ePub
Size: 8.1 MB
Downloadable formats: PDF
This paintings relates assorted ways for the modelling of parallel techniques. at the one hand there are the so-called "process algebras" or "abstract programming languages" with Milner's Calculus of speaking platforms (CCS) and the theoretical model of Hoare's speaking Sequential procedures (CSP) as major representatives. however there are computing device types, i.e. the classical finite nation automata (transition systems), for which, notwithstanding, extra discriminating notions of equivalence than equality of languages are used; and secondly, there are otherwise strong different types of Petri nets, particularly secure and basic (place/transition) nets respectively, and predicate/transition nets. inside of a uniform framework the syntax and the operational semantics of CCS and TCSP are defined. We reflect on either, Milner's recognized interleaving semantics, that's in response to endless transition structures, in addition to the hot dispensed semantics brought through Degano et al., that is in response to countless secure nets. the most a part of this paintings includes 3 syntax-driven structures of transition structures, secure nets, and predicate/transition nets respectively. every one of them is observed via an evidence of consistency. as a result of intrinsic limits, that are additionally investigated right here, neither for transition platforms and finite nets, nor for normal nets does a finite constant illustration of all CCS and TCSP courses exist. despite the fact that sublanguages which enable finite representations are discerned. nevertheless the development of predicate/transition nets is feasible for all CCS courses during which each selection and each recursive physique starts off sequentially.