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

Hulgaard, Henrik; Burns, Steven

doi:10.1109/async.1994.656281

Cited by 34 publications

(16 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several asynchronous modelling approaches and systems have been developed which use CSP-based notations, including the work of Martin [9,40,41], Hulgaard [33], and Brunvand [7], trace theory [20,21], Delay-Insensitive algebra [37], Tangram [56], SHILPA [29], and LARD [23].…”

Section: Introductionmentioning

confidence: 99%

Distributed Simulation of Asynchronous Hardware: The Program Driven Synchronization Protocol

Theodoropoulos

2002

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

Distributed Simulation of Asynchronous Hardware: The Program Driven Synchronization Protocol

Theodoropoulos

2002

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

“…Their algorithm, however, has a worst-case exponential time complexity. Extensions of this algorithm to deal with extended free choice and unique choice have been proposed in [4]. Lavagno and Sangiovanni-Vincentelli used a variant of the present problem to find optimum delay paddings to eliminate hazards in asynchronous circuits [6].…”

Section: Related Workmentioning

confidence: 96%

“…t f I ts + max (A,J +(4) 1 E p r e d s ( f )where we have used the notation p e d s ( f ) to denote the set of events 1 that have a directed edge to f in the timing constraint graph. Since the event s was arbitrarily chosen, inequality (4) holds for al'l events in the system.…”

mentioning

confidence: 99%

Approximate algorithms for time separation of events

Chakraborty

Dill²

1997

Proceedings of IEEE International Conference on Computer Aided Design (ICCAD) ICCAD-97

View full text Add to dashboard Cite

We describe a polynomial-time approximate algorithm for computing minimum and maximum time separations between all pairs of events in systems specijied by acyclic timing constraint graphs. Even for acyclic graphs, the problem is NP-complete. We propose finding an approximate solution by first approximating the non-convex feasible space with a suitable convex "envelope", and then solving the problem ejjiciently in the approximate convex space. Unlike previous works, our algorithm can handle both min and m a type timing constraints in the same system, and has a computational complexity that is polynomial in the number of events. Although the computed separations are conservative in the worst-case, experiments indicate that our results are highly accurate in practice.

show abstract

“…For example, there often is a need to check if all traces of a system satisfy that the separation in time between two given events is within a given time interval, which is called bounded delay analysis . This problem has been considered for timed automata by Courcoubetis and Yannakakis 19, and for a class of Petri nets by Hulgaard and Burns 20.…”

Section: Introductionmentioning

confidence: 99%

Timing analysis of scenario‐based specifications using linear programming

Pan

et al. 2012

Software Testing Verif & Rel

View full text Add to dashboard Cite

SUMMARYScenario‐based specifications (SBSs), such as UML interaction models, offer an intuitive and visual way of describing design requirements, and are playing an increasingly important role in the design of software systems. This paper presents an approach to timing analysis of SBSs expressed by UML interaction models. The approach considers more general and expressive timing constraints in UML sequence diagrams (SDs), and gives a solution to the reachability analysis, constraint conformance analysis and bounded delay analysis problems, which reduces these problems into linear programs. With the synchronous interpretation of the SD compositions, the timing analysis algorithms in the approach form a decision procedure for a class of SBSs where any loop in any path is time‐independent of the other parts in the path. These algorithms are also a semi‐decision procedure for general SBSs with both the synchronous and asynchronous composition semantics. The approach also supports bounded timing analysis of SBSs, which investigates all the paths in the bound limit one by one, and performs the timing analysis for each finite path by linear programming. A tool prototype has been developed to support this approach. Copyright © 2010 John Wiley & Sons, Ltd.

show abstract

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

Cited by 34 publications

References 13 publications

Distributed Simulation of Asynchronous Hardware: The Program Driven Synchronization Protocol

Distributed Simulation of Asynchronous Hardware: The Program Driven Synchronization Protocol

Approximate algorithms for time separation of events

Timing analysis of scenario‐based specifications using linear programming

Contact Info

Product

Resources

About