Time separation of events: an inverse method
From MaRDI portal
Recommendations
- An algorithm for exact bounds on the time separation of events in concurrent systems
- Min-max inequalities and the timing verification problem with max and linear constraints
- Efficient algorithms for approximate time separation of events
- Formal Modeling and Analysis of Timed Systems
- Extensions of asynchronous circuits and the delay problem. I: Good extensions and the delay problem of the first kind
Cites work
Cited in
(7)- Min-max inequalities and the timing verification problem with max and linear constraints
- Efficient algorithms for approximate time separation of events
- An algorithm for timing verification of systems constrained by min-max inequalities
- A new clocking algorithm based on polynomial manipulations
- GLOBAL DELAY TIME FOR GENERAL DISTRIBUTED NETWORKS WITH APPLICATIONS TO TIMING ANALYSIS OF DIGITAL MOS INTEGRATED CIRCUITS
- Parameter synthesis for hierarchical concurrent real-time systems
- An inverse method for parametric timed automata
This page was built for publication: Time separation of events: an inverse method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870195)