Filters








113 Hits in 4.2 sec

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  ...  For MPTA whose observers are all costs or all rewards, we show that the Pareto Domination Problem is PSPACE-complete.  ...  125:13 Intuitively, ψ T expresses that λ i is "small" for i ∈ T and "large" for i ∈ T .  ... 
doi:10.4230/lipics.icalp.2018.125 dblp:conf/icalp/FranzleSS018 fatcat:b7wkdxtufrbvfepfx5iqjsipmq

Energy-aware scheduling of FIR filter structures using a timed automata model

Erik Ramsgaard Wognsen, Rene Rydhof Hansen, Kim Guldstrand Larsen, Peter Koch
2016 2016 IEEE 19th International Symposium on Design and Diagnostics of Electronic Circuits & Systems (DDECS)  
We next model the FIR structures in UPPAAL CORA and employ model checking to find energyoptimal solutions in linearly priced timed automata.  ...  Based on actual measurements on the Altera Cyclone IV FPGA, we derive power and timing estimates for addition and multiplication, including idling power consumption.  ...  UPPAAL timed automaton modeling a physical functional unit. state. By extending timed automata with prices (cost rates), the problem can be extended to cost-optimal reachability.  ... 
doi:10.1109/ddecs.2016.7482468 dblp:conf/ddecs/WognsenHLK16 fatcat:mikgcn33nvawfb2ljijtatasgm

Optimizing Control Strategy Using Statistical Model Checking [chapter]

Alexandre David, Dehui Du, Kim Guldstrand Larsen, Axel Legay, Marius Mikučionis
2013 Lecture Notes in Computer Science  
This paper proposes a new efficient approach to optimize energy consumption for energy aware buildings. Our approach relies on stochastic hybrid automata for representing energy aware systems.  ...  The model is parameterized by several cost values that need to be optimized in order to minimize energy consumption.  ...  In our previous work [10, 11] we have proposed to capture the behavior of cyber-physical systems with Priced Timed Automata (PTA).  ... 
doi:10.1007/978-3-642-38088-4_24 fatcat:pkcipbekyng3dpf77ryaadwqce

The 10,000 Facets of MDP Model Checking [chapter]

Christel Baier, Holger Hermanns, Joost-Pieter Katoen
2019 Lecture Notes in Computer Science  
We focus on Markov decision processes (MDPs, for short).  ...  Using the region construction technique from timed automata [1] , the standard algorithms for finite MDPs suffice for the analysis [118] .  ...  PMC algorithms for timed reachability determine -close approximations of the optimal total-time positional deterministic policy.  ... 
doi:10.1007/978-3-319-91908-9_21 fatcat:yjsuwb5ibjff3cq3niatu6sbxq

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  ...  For MPTA whose observers are all costs or all rewards, we show that the Pareto Domination Problem is PSPACE-complete.  ...  MPTA lie at the frontier between timed automata (for which reachability is decidable [1] ) and linear hybrid automata (for which reachability is undecidable [13] ).  ... 
arXiv:1803.01914v2 fatcat:7urcpelts5cg7ozwtoqkfea6me

High-level frameworks for the specification and verification of scheduling problems

Mounir Chadli, Jin H. Kim, Kim G. Larsen, Axel Legay, Stefan Naujokat, Bernhard Steffen, Louis-Marie Traonouez
2017 International Journal on Software Tools for Technology Transfer (STTT)  
These frameworks consist of graphical and user-friendly languages for describing scheduling problems.  ...  In a series of recent work, we have shown that schedulability analysis of CPS could be performed with a model-based approach and extensions of verification tools such as UPPAAL.  ...  Fig. 1 : 1 Fig. 1: Implementations of a simple real-time task with timed, stopwatch, priced and hybrid automata Fig. 2 : 2 Fig. 2: Stochastic dispatcher implemented with a stochastic TA Fig. 4 :Fig  ... 
doi:10.1007/s10009-017-0466-1 fatcat:hmx6snzr4vhjdb2h7bkrxymd3q

Quantitative verification and strategy synthesis for stochastic games

Mária Svoreňová, Marta Kwiatkowska
2016 European Journal of Control  
In this paper, we focus on analysis of complex computer systems modelled as turn-based 2 1 2 -player games, or stochastic games for short, that are able to express both stochastic and non-stochastic uncertainties  ...  These include probabilistic linear-time properties, expected total, discounted and average reward properties, and their branching-time extensions and multi-objective combinations.  ...  Acknowledgements We would like to thank Vojtěch Forejt, Clemens Wiltsche, Dave Parker and Nicolas Basset for valuable comments and discussions.  ... 
doi:10.1016/j.ejcon.2016.04.009 fatcat:2et2q63ldbblvj6nlbeyj4klmm

Price Optimal Routing in Public Transportation [article]

Ricardo Euler, Ralf Borndörfer
2022 arXiv   pre-print
With the development of fast routing algorithms for public transit the optimization of criteria other than arrival time has moved into the spotlight.  ...  An exemplary model for the fare system of Mitteldeutsche Verkehrsbetriebe (MDV) is provided. PSEAP is NP-hard, even when considering a single-criterion version that optimizes for price only.  ...  Acknowledgement We thank MDV and InfraDialog Gmbh for providing the data for this study.  ... 
arXiv:2204.01326v1 fatcat:ogp7bsggy5bg3bplmuwiv6soku

Interval Markov Decision Processes with Multiple Objectives

Ernst Moritz Hahn, Vahid Hashemi, Holger Hermanns, Morteza Lahijanian, Andrea Turrini
2019 ACM Transactions on Modeling and Computer Simulation  
We investigate the problem of robust multi-objective synthesis for IMDPs and Pareto curve analysis of multi-objective queries on IMDPs.  ...  Afterwards, we extend our solution approach to approximate the Pareto curve for other types of queries.  ...  We define the Pareto set or Pareto curve of Y to be the set of all Pareto optimal vectors in Y , i.e., Pareto set Y = { y ∈ Y | y is Pareto optimal }.  ... 
doi:10.1145/3309683 fatcat:z5e2flzjqvhrdb6wvcvif3iypy

Deep Attention on Measurable and Behavioral-driven Complete Service Composition Design Process

Ilyass El Kassmi, Radia Belkeziz, Zahi Jarir
2021 International Journal of Advanced Computer Science and Applications  
service composition formalization 657 | P a g e www.ijacsa.thesai.org In this perspective, we suggest in this paper a contribution having the advantage of: • Handling quantifiable and behavioral NFRs using automata-based  ...  This work consists of performing a goal softening to reduce the candidate using Pareto techniques combined with Vector Ordinal Optimization in order to find Pareto Optimal Solutions, by considering multiple  ...  + The Availability metric (Av) is the percentage of time, in a specific time interval, during which the service can be reachable and functional.  ... 
doi:10.14569/ijacsa.2021.0120377 fatcat:ovsvi5nr4ndhrocudw3oth353u

Timed automata as a formalism for expressing security: A survey on theory and practice

Johan Arcile, Étienne André
2022 ACM Computing Surveys  
Timed automata are a common formalism for the verification of concurrent systems subject to timing constraints.  ...  In this work, we review works studying security properties for timed automata in the last two decades.  ...  We would like to thank anonymous reviewers for their useful comments, as well as Jaime Arias and Laure Petrucci for a feedback on their recent works.  ... 
doi:10.1145/3534967 fatcat:bq3focapvzh77lf5qvdx4oskcm

A Platform-Based Design Methodology With Contracts and Related Tools for the Design of Cyber-Physical Systems

Pierluigi Nuzzo, Alberto L. Sangiovanni-Vincentelli, Davide Bresolin, Luca Geretti, Tiziano Villa
2015 Proceedings of the IEEE  
We illustrate our approach on the design of embedded controllers for aircraft electric power distribution systems.  ...  For each level, we highlight how the contract operations can be concretely computed as well as the research challenges that should be faced to fully implement them.  ...  Therefore, in general, it is not possible to perform exact reachability analysis. Hybrid automata come in several flavors.  ... 
doi:10.1109/jproc.2015.2453253 fatcat:symvbgghdfar3ey2dbwp3l5vrm

A blueprint for system-level performance modeling of software-intensive embedded systems

Martijn Hendriks, Twan Basten, Jacques Verriet, Marco Brassé, Lou Somers
2014 International Journal on Software Tools for Technology Transfer (STTT)  
Often, high-level models of the dynamic behavior of the system are used for the analysis of design alternatives.  ...  It currently is used by TNO-ESI and Océ-Technologies B.V. for early model-based performance analysis that supports the design process for professional printing systems.  ...  Acknowledgement We thank the anonymous reviewers for their valuable comments that helped us to improve the paper.  ... 
doi:10.1007/s10009-014-0340-3 fatcat:fz2wisdlvnh4jlavyhxj44fibu

Decentralized spatial spectrum access

Bangyi Zhu, Xu Chen, Jianwei Huang
2013 2013 IEEE International Conference on Communications (ICC)  
Numerical results show that the performance loss of the proposed algorithms is less than 10%, compared with the centralized optimal solution.  ...  Moreover, we show that the proposed algorithms can converge to either an approximate Nash equilibrium or an approximate Pareto optimum, based on the different threshold designs.  ...  The channel selection profile s is ε-Pareto optimal if there exists no other channel selection profile that is ε-Pareto superior to s.  ... 
doi:10.1109/icc.2013.6655620 dblp:conf/icc/ZhuCH13 fatcat:ol52lcwfefe6lg3yeazqa5wjwe

The Price of Stochastic Anarchy [chapter]

Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron Roth
2008 Lecture Notes in Computer Science  
The price of stochastic anarchy can be viewed as a smoothed analysis of the price of anarchy, distinguishing equilibria that are resilient to noise from those that are not.  ...  We consider the solution concept of stochastic stability, and propose the price of stochastic anarchy as an alternative to the price of (Nash) anarchy for quantifying the cost of selfishness and lack of  ...  Acknowledgments We would like to thank Yishay Mansour for bringing the unbounded price of anarchy in the load balancing game to our attention, Avrim Blum for useful discussion, and Alexander Matros for  ... 
doi:10.1007/978-3-540-79309-0_27 fatcat:qzbawhieibej7eejjershmqswi
« Previous Showing results 1 — 15 out of 113 results