An algorithm for exact bounds on the time separation of events in concurrent systems
From MaRDI portal
Publication:4421149
Recommendations
- Time bounds for mutual exclusion and related problems
- Optimal time-bounded reachability analysis for concurrent systems
- scientific article; zbMATH DE number 4062568
- Coinduction in concurrent timed systems
- scientific article; zbMATH DE number 994050
- Time separations of cyclic event rule systems with min-max timing constraints
- Bounded Concurrent Time-Stamping
- The complexity of finding temporal separators under waiting time constraints
- Revisiting timing in process algebra.
- Bounded concurrent timestamp systems using vector clocks
Cited in
(12)- Globally optimal solutions of max-min systems
- Time separations of cyclic event rule systems with min-max timing constraints
- Efficient algorithms for approximate time separation of events
- Time separation of events: an inverse method
- Output feedback stabilization for a class of nonlinear time-evolution systems
- An algorithm for timing verification of systems constrained by min-max inequalities
- The level set method for the two-sided max-plus eigenproblem
- From max-plus algebra to nonexpansive mappings: A nonlinear theory for discrete event systems.
- Beyond Lamport's Happened-before
- Cycle time assignment of min-max systems
- Min-max inequalities and the timing verification problem with max and linear constraints
- Karnaugh maps of logical systems and applications in digital circuit design
This page was built for publication: An algorithm for exact bounds on the time separation of events in concurrent systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4421149)
