Formal modeling of synchronization methods for concurrent objects in Ada 95
Proceedings of the 1999 annual ACM SIGAda international conference on Ada
Translating Time Petri Net Structures into Ada 95 Statements
Ada-Europe '99 Proceedings of the 1999 Ada-Europe International Conference on Reliable Software Technologies
Process algebra model of Ada protected objects
ACM SIGPLAN Notices
Compositional Petri net models of advanced tasking in Ada-95
Computer Languages
| Hi-index | 0.01 |
The Ada language has been designed to support development of concurrent and distributed software. While the Ada-83 standard defined the basic mechanisms of rendezvous-based tasking, the Ada-95 standard significantly extended this capability with the introduction of several advanced tasking constructs. We present and discuss formal models of these key tasking constructs using the Petri net model. The new constructs considered are the asynchronous transfer of control, protected objects, and the requeue statement. By modeling these advanced Ada tasking constructs with Petri nets, we obtain "executable" models of the constructs that are complementary to earlier work in net-based modeling of Ada tasking, both in terms of defining precise behavior for tasking semantics, and also in terms of providing support for automated analysis of concurrent software.