Finite Reresentations of CCS and TCSP Programs by Automata and Petri Nets [1 ed.] 3540515259, 9783540515258

This work relates different approaches for the modelling of parallel processes. On the one hand there are the so-called

279 107 1MB

English Pages 172 [176] Year 1989

Report DMCA / Copyright

DOWNLOAD DJVU FILE

Table of contents :
Introduction....Pages 1-6
Abstract programming languages....Pages 7-45
Connections with language theory....Pages 46-60
Representation by finite automata....Pages 61-94
Representation by finite and safe Petri nets....Pages 95-117
A remark on the representation by finite Petri nets....Pages 118-122
Representation by finite and strict predicate/transition nets....Pages 123-155

Finite Reresentations of CCS and TCSP Programs by Automata and Petri Nets [1 ed.]
 3540515259, 9783540515258

  • 0 0 0
  • Like this paper and download? You can publish your own PDF file online for free in a few minutes! Sign Up
Recommend Papers