Compositional Petri net models of advanced tasking in Ada-95

Authors:
Ravi K. Gedela;Sol M. Shatz;Haiping Xu
Affiliations:
Concurrent Software Systems Laboratory, The University of Illinois at Chicago, Chicago, IL 60607, USA;Concurrent Software Systems Laboratory, The University of Illinois at Chicago, Chicago, IL 60607, USA;Concurrent Software Systems Laboratory, The University of Illinois at Chicago, Chicago, IL 60607, USA
Venue:
Computer Languages
Year:
1999

Citing 6
Cited 1

Modeling the ADA task system by Petri nets

Computer Languages
Application and experimental evaluation of state space reduction methods for deadlock analysis in Ada

ACM Transactions on Software Engineering and Methodology (TOSEM)
Timing Analysis of Ada Tasking Programs

IEEE Transactions on Software Engineering - Special issue: best papers of the 1996 international symposium on software testing and analysis ISSTA'96
An Application of Petri Net Reduction for Ada Tasking Deadlock Analysis

IEEE Transactions on Parallel and Distributed Systems
Implementing Atomic Actions in Ada 95

IEEE Transactions on Software Engineering
Modeling of Advanced Tasking in Ada-95: A Petri Net Perspective

PDSE '97 Proceedings of the 2nd International Workshop on Software Engineering for Parallel and Distributed Systems

Process algebra model of Ada protected objects

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. We also provide some formal evaluation of the models using one particular net-based method, invariant analysis. The constructs considered are the asynchronous transfer of control, the protected object, and the requeue statement. By modeling these advanced Ada tasking constructs with Petri nets, we obtain compositional 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.