Timing Analysis Of Cyclic Concurrent Programs
- 24 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 312-318
- https://doi.org/10.1109/icse.1989.714440
Abstract
An approach to timing analysis of cyclic concurrent programs is presented. GR/sub 0/ path-expressions are used to describe synchronization and concurrency of atomic operations in cyclic concurrent programs. The behavior of a cyclic concurrent program is represented as a partial order of atomic operations, and a technique to derive this partial order from a GR/sub 0/ program is developed. Given the execution times of the individual atomic operations of a GR/sub 0/ program and a set of timing constraints, our timing analysis technique uses the partial order to determine whether the concurrent program, when executed, will satisfy the set of timing constraints. The timing analysis technique can be completely automated.Keywords
This publication has 12 references indexed in Scilit:
- A Graph-Theoretic Approach for Timing Analysis and its ImplementationIEEE Transactions on Computers, 1987
- Concurrent and maximally concurrent evolution of nonsequential systemsTheoretical Computer Science, 1986
- Compiling path expressions into VLSI circuitsDistributed Computing, 1986
- Safety analysis of timing properties in real-time systemsIEEE Transactions on Software Engineering, 1986
- An interval logic for higher-level temporal reasoningPublished by Association for Computing Machinery (ACM) ,1983
- Adequacy properties of path programsTheoretical Computer Science, 1982
- Proving real-time properties of programs with temporal logicPublished by Association for Computing Machinery (ACM) ,1981
- An overview of path Pascal's designACM SIGPLAN Notices, 1980
- COSY ? a system specification language based on paths and processesActa Informatica, 1979
- Formal semantics of a class of high-level primitives for coordinating concurrent processesActa Informatica, 1975