Filters








1,687 Hits in 4.6 sec

Costs and Rewards in Priced Timed Automata [article]

Martin Fränzle, Mahsa Shirmohammadi, Mani Swaminathan, James Worrell
2018 arXiv   pre-print
We consider Pareto analysis of reachable states of multi-priced timed automata (MPTA): timed automata equipped with multiple observers that keep track of costs (to be minimised) and rewards (to be maximised  ...  We study the Pareto Domination Problem, which asks whether it is possible to reach a target location via a run in which the accumulated costs and rewards Pareto dominate a given objective vector.  ...  Introduction Multi Priced Timed Automata (MPTA) [5, 7, 8, 10, 17, 18, 19] extend priced timed automata [2, 3, 4, 6, 16] with multiple observers that capture the accumulation of costs and rewards along  ... 
arXiv:1803.01914v2 fatcat:7urcpelts5cg7ozwtoqkfea6me

Costs and Rewards in Priced Timed Automata

Martin Fränzle, Mahsa Shirmohammadi, Mani Swaminathan, James Worrell, Michael Wagner
2018 International Colloquium on Automata, Languages and Programming  
We consider Pareto analysis of reachable states of multi-priced timed automata (MPTA): timed automata equipped with multiple observers that keep track of costs (to be minimised) and rewards (to be maximised  ...  We study the Pareto Domination Problem, which asks whether it is possible to reach a target location via a run in which the accumulated costs and rewards Pareto dominate a given objective vector.  ...  On the other hand, if there is a run ρ with γ ε cost(ρ) then for some S and T , the system ϕ S ∧ ψ T will have a real solution in which moreover the inequalities f i (n 1 λ 1 , . . . , n k λ d+1 ) ≤ c  ... 
doi:10.4230/lipics.icalp.2018.125 dblp:conf/icalp/FranzleSS018 fatcat:b7wkdxtufrbvfepfx5iqjsipmq

Staying Alive as Cheaply as Possible [chapter]

Patricia Bouyer, Ed Brinksma, Kim G. Larsen
2004 Lecture Notes in Computer Science  
To cover a wide class of optimality criteria we start out by introducing an extension of the (priced) timed automata model that includes both costs and rewards as separate modelling features.  ...  This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal.  ...  Called linearly priced timed automata in [BFH + 01b,BFH + 01a,LBB + 01] and weighted timed automata in [ALTP01] .  ... 
doi:10.1007/978-3-540-24743-2_14 fatcat:qpfeqsfsfvgirojm4hzcxkukh4

Learning Automata Based Method for Grid Computing Resource Valuation with Resource Suitability Criteria

Ali Sarhadi
2011 International Journal of Grid Computing & Applications  
In this paper, we present a new method of resource allocation and valuation based on the learning automata algorithms in order to maximize the benefit for both grid providers and grid users.  ...  Pricing policies are based on the demand from the users and the supply of resources is the main driver in the competitive, economic market model.  ...  For each new user, LA's chooses a resource with the highest reward. A Resource with minimum cost that execute users job in specified deadline has a higher reward and will be selected.  ... 
doi:10.5121/ijgca.2011.2401 fatcat:spvelutr6fhsfgyxc2hssg4ziy

Optimal infinite scheduling for multi-priced timed automata

Patricia Bouyer, Ed Brinksma, Kim G. Larsen
2007 Formal methods in system design  
To cover a wide class of optimality criteria we start out by introducing an extension of the (priced) timed automata model that includes both costs and rewards as separate modelling features.  ...  This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal.  ...  -)priced timed automata with adversaries [5, 13, 22] .  ... 
doi:10.1007/s10703-007-0043-4 fatcat:wxhauegqvbd3tkqpvrwsxz2nfa

New Algorithm for Resource Selection in Economic Grid with the Aim of Cost Optimization Using Learning Automata

Ali Sarhadi, Mohammad Reza Meybodi
2010 2010 International Conference on Challenges in Environmental Science and Computer Engineering  
The user determines his deadline and budget and then requests cost or time optimization.  ...  In economic computational grids, resources have prices and the users must pay for executing their applications.  ...  After each selection, the LA gets a response from environment (containing the price of resource and completion time), calculates the complete time, and translates it into reward r or penalty p for resource  ... 
doi:10.1109/cesce.2010.185 fatcat:tr5trmrm5zdy3p7e7dyphsxzhu

PRISM 4.0: Verification of Probabilistic Real-Time Systems [chapter]

Marta Kwiatkowska, Gethin Norman, David Parker
2011 Lecture Notes in Computer Science  
This paper describes a major new release of the PRISM probabilistic model checker, adding, in particular, quantitative verification of (priced) probabilistic timed automata.  ...  These model systems exhibiting probabilistic, nondeterministic and real-time characteristics.  ...  The authors are part supported by ERC Advanced Grant VERIWARE, EU-FP7 project CONNECT, DARPA/Air Force Research Laboratory contract FA8650-10-C-7077 (PRISMATIC) and EPSRC grant EP/D07956X.  ... 
doi:10.1007/978-3-642-22110-1_47 fatcat:y6aqczsj3fhtrcwwwljw5iqqki

Proffering a Brand New Methodology for Resource Discovery and Pricing in Computational Grid Using Learning Automata

Ali Sarhadi, Hasan Khotanlo, ali yousefi
2010 International Journal of Computer Applications  
In this paper, we present a method of resource discovery and pricing based on the learning automata, and discuss the process of resource discovery and resource pricing algorithms for discover and pricing  ...  After discover of resource, pricing of it based on its complete time is done.  ...  CRITERIA FOR SELECTING REWARD AND PENALTY BY LEARNING AUTOMATA 5- Environment response for learning automata associated to application based on ideal conditions in a time optimization criteria will be  ... 
doi:10.5120/967-1242 fatcat:di5gaakmjfhm3hgnca27filpo4

Population Based Methods for Optimising Infinite Behaviours of Timed Automata

Lewis Tolonen, Tim French, Mark Reynolds, Michael Wagner
2018 International Symposium/Workshop on Temporal Representation and Reasoning  
The optimal infinite scheduling problem for double-priced timed automata is concerned with finding infinite runs of a system whose long term cost to reward ratio is minimal.  ...  Timed automata are powerful models for the analysis of real time systems.  ...  In 2008, Bouyer, Brinksma and Larsen proposed the model of double-priced timed automata: a timed automaton extended with two price functions: costs and rewards [4].  ... 
doi:10.4230/lipics.time.2018.22 dblp:conf/time/Tolonen0R18 fatcat:7t6apv2dajevlf2foycjglmdzy

Average-price-per-reward games on hybrid automata with strong resets

Michał Rutkowski, Ranko Lazić, Marcin Jurdziński
2010 International Journal on Software Tools for Technology Transfer (STTT)  
We study price-per-reward games on hybrid automata with strong resets. They generalise priced games previously studied and have applications in scheduling.  ...  The cost and reward of following an edge are determined by the outcome of the edge game that is assigned to it.  ...  A game-based approach was proposed in [11] , and was applied to hybrid automata [12, 13] and timed automata [14] .  ... 
doi:10.1007/s10009-010-0180-8 fatcat:7szyriucsrhrzl7mfins4yryki

Average-Price-per-Reward Games on Hybrid Automata with Strong Resets [chapter]

Marcin Jurdziński, Ranko Lazić, Michał Rutkowski
2008 Lecture Notes in Computer Science  
We study price-per-reward games on hybrid automata with strong resets. They generalise priced games previously studied and have applications in scheduling.  ...  The cost and reward of following an edge are determined by the outcome of the edge game that is assigned to it.  ...  A game-based approach was proposed in [11] , and was applied to hybrid automata [12, 13] and timed automata [14] .  ... 
doi:10.1007/978-3-540-93900-9_16 fatcat:bda7xdzkpzdr5esa6qbok3m42u

Multi-weighted Automata and MSO Logic [chapter]

Manfred Droste, Vitaly Perevoshchikov
2013 Lecture Notes in Computer Science  
In multi-weighted automata, transitions carry several weights and can model, for example, the ratio between rewards and costs, or the efficiency of use of a primary resource under some upper bound constraint  ...  In our main results, we show that this multi-weighted MSO logic and multi-weighted automata are expressively equivalent both for finite and infinite words.  ...  In our further work, we wish to combine the ideas of [21] and the current work to obtain a Büchi theorem for multi-weighted timed automata.  ... 
doi:10.1007/978-3-642-38536-0_36 fatcat:xli2b77ew5du7aywg6pebkrq4u

Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata [chapter]

Martin Fränzle, Mani Swaminathan
2009 Lecture Notes in Computer Science  
We investigate the optimum reachability problem for Multi-Priced Timed Automata (MPTA) that admit both positive and negative costs on edges and locations, thus bridging the gap between the results of Bouyer  ...  This undecidability result follows from an encoding of Stop-Watch Automata using such MPTA, and applies to MPTA with as few as two cost variables, and even when no costs are incurred upon taking edges.  ...  We wish to thank Ernst-Rüdiger Olderog and the reviewers for useful comments that helped in improving the presentation of this paper.  ... 
doi:10.1007/978-3-642-04368-0_13 fatcat:g6joqdf6lzfotfevqgp72zurny

A Cost-AWARE Approach Based ON Learning Automata FOR Resource Auto-Scaling IN Cloud Computing Environment

Khosro Mogoui, Mostafa Ghobaei Arani
2015 International Journal of Hybrid Information Technology  
In this paper, we have suggested an approach based on learning automata for resource auto-scaling, in order to manage and optimize factor cost.  ...  In recent years, applications of cloud services have been increasingly expanded. Cloud services, are distributed infrastructures which develop the communication and services.  ...  In our sample environment will operate n times in any action:  New input load (a) enters in environment.  Includes reward and penalty comes from environment. Probability vector is as P={0.5, 0.5}.  ... 
doi:10.14257/ijhit.2015.8.7.35 fatcat:d22x5nmvorhp7lfntg6igumos4

Emptiness and Universality Problems in Timed Automata with Positive Frequency [chapter]

Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer
2011 Lecture Notes in Computer Science  
We study various properties of timed languages accepted with positive frequency, and in particular the emptiness and universality problems.  ...  In this paper we propose a natural quantitative semantics for timed automata based on the so-called frequency, which measures the proportion of time spent in the accepting locations.  ...  We decorate this finite automaton with two weights for representing frequencies, one which we call the cost, and the other which we call the reward (by analogy with double-priced timed automata in [?]  ... 
doi:10.1007/978-3-642-22012-8_19 fatcat:r2ao6negrnex5jnk7bwcwp2cr4
« Previous Showing results 1 — 15 out of 1,687 results