In: Kyushu Univ, Japan, Memoirs of the Faculty of Engineering, Kyushu University, Vol. 48, No. 1, pages 17-30. 1988.
Abstract: In this paper, we give a semi-formal description for the semantics of the Ada tasking using extended Petri nets. This has three advantages: The Ada tasking is easier to understand, the behavior of an Ada tasking program can be analyzed using Petri nets theory, and it is possible to systematically design Ada tasking programs whose behaviors are either known or easily verifiable based on Petri nets.
Back to the Petri Nets Bibliography