Abstract
In order to understand and analyze real-time distributed programs, one must account for interactions between proceses. Unfortunately, these interactions can be quite complex due to concurrency and nondeterminism. This paper describes a framework for automated static analysis of distributed programs written in Ada. The analysis is aimed at discovery of a program's potential tasking behavior, that is, behavior in terms of tasking-related issues. Central to the framework is the translation of a program into an abstract grammar system that represents a Petri net graph model.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
