An algorithm for exact bounds on the time separation of events in concurrent systems

DOI10.1109/12.475126zbMath1054.68516OpenAlexW2132385281MaRDI QIDQ4421149

Tod Amon, Steven M. Burns, Henrik Hulgaard, Gaetano Borriello

Publication date: 1995

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/09ac103c20fedfc4888b51a5fcead5d050b434cb

zbMATH Keywords

asynchronous systemstiming verification

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (10)

An algorithm for timing verification of systems constrained by min-max inequalities ⋮ The level set method for the two-sided max-plus eigenproblem ⋮ Karnaugh maps of logical systems and applications in digital circuit design ⋮ Globally optimal solutions of max-min systems ⋮ Time separations of cyclic event rule systems with min-max timing constraints ⋮ Cycle time assignment of min-max systems ⋮ Min-max inequalities and the timing verification problem with max and linear constraints ⋮ Output feedback stabilization for a class of nonlinear time-evolution systems ⋮ Efficient algorithms for approximate time separation of events ⋮ From max-plus algebra to nonexpansive mappings: A nonlinear theory for discrete event systems.

This page was built for publication: An algorithm for exact bounds on the time separation of events in concurrent systems