Efficient algorithms for approximate time separation of events
From MaRDI portal
Recommendations
- An algorithm for exact bounds on the time separation of events in concurrent systems
- An algorithm for timing verification of systems constrained by min-max inequalities
- Time separations of cyclic event rule systems with min-max timing constraints
- Time separation of events: an inverse method
- Min-max inequalities and the timing verification problem with max and linear constraints
Cites work
- An algorithm for exact bounds on the time separation of events in concurrent systems
- Consistency and satisfiability of waveform timing specifications
- scientific article; zbMATH DE number 744067 (Why is no real title available?)
- Solving linear, min and max constraint systems using CLP based on relational interval arithmetic
Cited in
(4)- An algorithm for timing verification of systems constrained by min-max inequalities
- Time separation of events: an inverse method
- Localizing Multiple Events Using Times of Arrival: a Parallelized, Hierarchical Approach to the Association Problem
- Time separations of cyclic event rule systems with min-max timing constraints
This page was built for publication: Efficient algorithms for approximate time separation of events
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1847541)