In: Proceedings of Fourth International Conference on Application of Concurrency to System Design (ACSD'04), June 16 - 18, 2004, Hamilton, Ontario, Canada, pages 79-88. IEEE Press, June 2004.
Abstract: In this paper we provide two new formalisations of the finite fragment of the p-calculus, defined in a way which exhibits the global state and the execution context of a process without needing to rely heavily on term rewriting techniques. In doing so, we aim at a calculus which would be amenable to a straightforward compositional translation into automata-based models such as Petri nets.
Back to the Petri Nets Bibliography