caa a22 4500 467989729 CHVBK 20180323112541.0 cr unu---uuuuu 170328e19900501xx s 000 0 eng 10.1007/BF00277389 doi (NATIONALLICENCE)springer-10.1007/BF00277389 Taubner Dirk Corporate Research and Development (ZFE IS INF2), Siemens AG, Otto-Hahn-Ring 6, D-8000, München 83, Federal Republic of Germany aut Representing CCS programs by finite predicate/transition nets [Elektronische Daten] [Dirk Taubner] Summary: A construction is given which for CCS programs (in which every choice and recursion starts sequentially) yields a finite and strict predicate/ transition net. Consistency of this construction is proved not only with respect to the standard interleaving semantics but with respect to the distributed operational semantics of Degano, De Nicola, and Montanari which additionally models the concurrency explicitly. Springer-Verlag, 1990 Acta Informatica Springer-Verlag 27/6(1990-05-01), 533-565 0001-5903 27:6<533 1990 27 236 https://doi.org/10.1007/BF00277389 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF00277389 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Taubner Dirk Corporate Research and Development (ZFE IS INF2), Siemens AG, Otto-Hahn-Ring 6, D-8000, München 83, Federal Republic of Germany aut NATIONALLICENCE 773 0- Acta Informatica Springer-Verlag 27/6(1990-05-01), 533-565 0001-5903 27:6<533 1990 27 236 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer