Advances in Petri Nets 1988
Detecting cycles in dynamic graphs in polynomial time
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Coherence and satisfiability of waveform timing specifications
Coherence and satisfiability of waveform timing specifications
The use of a synchronizer yields maximum computation rate in distributed networks
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Analysis of free schedule in periodic graphs
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Interface timing verification with application to synthesis
DAC '94 Proceedings of the 31st annual Design Automation Conference
Scheduling Parallel Computations
Journal of the ACM (JACM)
Algorithms for Interface Timing Verification
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
An efficient algorithm for a class of constraint satisfaction problems
Operations Research Letters
| Hi-index | 0.00 |
Inthis paper a method to check the solvability of a set of linearequations in the (\max, \min, +) algebra is described.Then, extensions to dynamic (or periodic) systems in the (\max,\min, +) algebra are provided. Further, some results regardingthe uniqueness of solutions in both cases are given. Finally,we address a more general quasi periodic problem and providean algorithm for its solution.