Bounded delay timing analysis of a class of CSP programs with choice

Author

Hulgaard, Henrik ; Burns, Steven M.

Author_Institution

Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA

fYear

1994

fDate

3-5 Nov 1994

Firstpage

2

Lastpage

11

Abstract

We extend our technique for determining exact time separation of events in systems with just concurrency to a restricted but still useful class of systems with both choice and concurrency. Such a system is described using a CSP program (including Martin´s probe operator) with the restrictions that the communication behavior is data-independent, that there is no OR-causality, and that guard selection is either completely free or mutually exclusive. Such a CSP program is transformed into a safe Petri net. Interval time delays are specified on the places of the net. The timing analysis we perform is, for all possible timed executions of the system, determine the extreme separations in time for all occurrences of specified events. We formally define this problem, propose an algorithm for its solution, and apply the algorithm to an example program

Keywords

delays; CSP programs; Martin´s probe operator; Petri net; bounded delay timing analysis; communication behavior; concurrency; exact time separation; guard selection; interval time delays; timed executions; timing analysis; Algorithm design and analysis; Circuit synthesis; Computer science; Concurrent computing; Delay; Performance analysis; Petri nets; Probes; Specification languages; Timing;

fLanguage

English

Publisher

ieee

Conference_Titel

Advanced Research in Asynchronous Circuits and Systems, 1994., Proceedings of the International Symposium on

Conference_Location

Salt Lake City, UT

Print_ISBN

0-8186-6210-7

Type

conf

DOI

10.1109/ASYNC.1994.656281

Filename

656281