In: Proceedings of the 13th Annual International Computer Software and Applications Conference, 1989, Orlando, FL, USA, pages 24-31. Washington, DC, USA: IEEE Comput. Soc. Press, 1989.
Abstract: Ada tasking constructs involving time are modeled by timed Petri nets. Such modeling is helpful in interpreting the (often) ambiguous semantics described in the Ada reference manual. From a general selective wait model, it is shown how to apply Petri net reduction operations to derive other selective wait models.
Keywords: Ada tasking constructs (involving time); selective wait model; net reduction.
Back to the Petri Nets Bibliography