Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6874818 | Journal of Logical and Algebraic Methods in Programming | 2018 | 35 Pages |
Abstract
Using a transition system framework that associates costs (e.g., time, energy) with executing an action on a particular resource configuration, we formulate a very simple version of simulation relations for cumulative cost transition systems. This notion of simulation forms the basis for specifying deadline/budget-conformant executions, and appropriate notions for comparing such executions. We believe these simulation-based notions can provide the basis for an operational theory of optimal cost executions and performance guarantees for approximate solutions, in particular relating the notion of simulation from transition systems to that of competitive analysis used for, e.g., online algorithms.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Sanjiva Prasad,