000 05515cam a2200841 a 4500
001 ocn321316276
003 OCoLC
005 20250703150131.0
006 m o d
007 cr unu||||||||
008 890724s1989 gw a ob 001 0 eng d
040 _aSCPER
_beng
_epn
_cCUSER
_dOCLCQ
_dGW5XE
_dOCLCF
_dDKDLA
_dOCLCQ
_dITD
_dOCLCQ
_dUAB
_dESU
_dCOO
_dOCLCQ
_dOL$
_dOCLCQ
_dOCLCO
_dOCLCQ
_dOCLCE
_dOCLCO
_dOCLCL
_dOCLCQ
_dOCLCA
019 _a1355501271
020 _a9783540482154
_q(electronic bk.)
020 _a3540482156
_q(electronic bk.)
020 _a0387515259
_q(U.S.)
020 _a9780387515250
_q(U.S.)
020 _z9783540515258
020 _z3540515259
024 7 _a10.1007/3-540-51525-9
_2doi
029 1 _aNZ1
_b15494235
035 _a(OCoLC)321316276
_z(OCoLC)1355501271
042 _adlr
050 4 _aQA76.9.D5
_bT39 1989
082 0 4 _a004/.36
_220
084 _a54.10
_2bcl
084 _a*68-02
_2msc
084 _a68N25
_2msc
084 _a68Q85
_2msc
084 _a28
_2sdnb
049 _aMAIN
100 1 _aTaubner, Dirk,
_d1959-
_1https://id.oclc.org/worldcat/entity/E39PCjwHWwm4jkWKmTpDHdtfHK
_932962
245 1 0 _aFinite representations of CCS and TCSP programs by automata and Petri nets /
_cDirk Taubner.
260 _aBerlin ;
_aNew York :
_bSpringer-Verlag,
_c©1989.
300 _a1 online resource (x, 168 pages) :
_billustrations
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
490 1 _aLecture notes in computer science ;
_v369
504 _aIncludes bibliographical references (pages 159-164).
520 8 _aAnnotation 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.
588 0 _aPrint version record.
505 0 _aAbstract 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.
506 _3Use copy
_fRestrictions unspecified
_2star
_5MiAaHDL
533 _aElectronic reproduction.
_b[Place of publication not identified]:
_cHathiTrust Digital Library.
_d2022.
_5MiAaHDL
538 _aMaster and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
_uhttp://purl.oclc.org/DLF/benchrepro0212
_5MiAaHDL
583 1 _adigitized
_c2022.
_hHathiTrust Digital Library
_lcommitted to preserve
_2pda
_5MiAaHDL
650 0 _aElectronic data processing
_xDistributed processing.
650 0 _aPetri nets.
_915417
650 0 _aProgramming languages (Electronic computers)
_9986
650 2 _aProgramming Languages
_931442
650 6 _aTraitement réparti.
_920596
650 6 _aRéseaux de Pétri.
_9966767
650 6 _aLangages de programmation.
_914691
650 7 _aElectronic data processing
_xDistributed processing
_2fast
650 7 _aPetri nets
_2fast
_915417
650 7 _aProgramming languages (Electronic computers)
_2fast
_9986
650 7 _aTCSP
_2gnd
_9976388
650 7 _aParallelverarbeitung
_2gnd
_95043
650 7 _aProgrammierung
_2gnd
_95173
650 7 _aAutomat
_2gnd
_920473
650 7 _aPetri-Netz
_2gnd
_926466
650 7 _aCCS
_2gnd
_9976389
650 7 _aPetri nets.
_2nli
_915417
650 7 _aMachine theory.
_2nli
_914628
650 7 _aElectronic data processing
_xDistributed processing.
_2nli
655 4 _aElectronic resources (Books)
_914725
776 0 8 _iPrint version:
_aTaubner, Dirk, 1959-
_tFinite representations of CCS and TCSP programs by automata and Petri nets.
_dBerlin ; New York : Springer-Verlag, ©1989
_w(OCoLC)20170933
830 0 _aLecture notes in computer science ;
_v369.
856 4 0 _uhttps://link.springer.com/10.1007/3-540-51525-9
936 _aBATCHLOAD
994 _a92
_bATIST
999 _c638661
_d638661