| 書目名稱 | Finite Representations of CCS and TCSP Programs by Automata and Petri Nets | | 編輯 | Dirk A. Taubner | | 視頻video | http://file.papertrans.cn/344/343647/343647.mp4 | | 叢書名稱 | Lecture Notes in Computer Science | | 圖書封面 |  | | 描述 | 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 pro | | 出版日期 | Book 1989 | | 關(guān)鍵詞 | CCS; Endliche Automaten; Finite Automata; Operational Semantics; Operationelle Semantik; Parallel Process | | 版次 | 1 | | doi | https://doi.org/10.1007/3-540-51525-9 | | isbn_softcover | 978-3-540-51525-8 | | isbn_ebook | 978-3-540-48215-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 | | issn_series | 0302-9743 | | copyright | Springer-Verlag Berlin Heidelberg 1989 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-9 22:30
發(fā)表于 2025-3-21 17:47:19
