Efficient algorithms for approximate time separation of events

DOI10.1007/BF02717181zbMath1018.68098OpenAlexW2004487434MaRDI QIDQ1847541

Supratik Chakraborty, Kenneth Y. Yun, David L. Dill

Publication date: 27 November 2002

Published in: Sādhanā (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02717181

zbMATH Keywords

asynchronous systemsdatapath design

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items

Time separations of cyclic event rule systems with min-max timing constraints ⋮ Time Separation of Events: An Inverse Method

Cites Work

• Unnamed Item
• Solving linear, min and max constraint systems using CLP based on relational interval arithmetic
• Consistency and satisfiability of waveform timing specifications
• An algorithm for exact bounds on the time separation of events in concurrent systems