On the domain of traces and sequential composition
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Branching processes of Petri nets
Acta Informatica
Net-definability of process languages
Fundamenta Informaticae - Special issue on Petri nets
Theoretical Computer Science
Place/transition Petri net evolutions: recording ways, analysis and synthesis
Fundamenta Informaticae
Place or Transition Petri Nets
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Associative Omega-products of Traces
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
ω-Process Languages for Place/Transition Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
| Hi-index | 0.00 |
The notion of an associative omega-product is applied to processes. Processes are one of the ways to represent behavior of Petri nets. They have been studied for some years as an alternative to traces and dependence graphs. One advantage of processes, as compared to traces, is a very simple way to define infinite concatenation. We take a closer look at this operation, and show that it is a free associative omega-product of finite processes. Its associativity simplifies some arguments about infinite concatenation, as illustrated by the proof of interleaving theorem.