Filters








53 Hits in 4.8 sec

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  ...  Under such a condition, the location reachability problem is shown to be decidable and the optimum cost is shown to be computable for MPTA with positive and negative costs and a bounded budget.  ...  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

Timed Network Games with Clocks [article]

Guy Avni and Shibashis Guha and Orna Kupferman
2018 arXiv   pre-print
Each vertex v in the network is associated with a cost function, mapping the load on v to the price that a player pays for staying in v for one time unit with this load.  ...  In the model we study, the network is equipped with clocks, and, as in timed automata, edges are guarded by constraints on the values of the clocks, and their traversal may involve a reset of some clocks  ...  This work belongs to a line of works that transfer concepts and ideas between the areas of formal verification and algorithmic game theory: logics for specifying multi-agent systems [9, 26] , studies  ... 
arXiv:1808.04882v1 fatcat:raj3krefnbcr5ksp7b5e5zvptu

Optimal-Cost Reachability Analysis Based on Time Petri Nets

Hanifa Boucheneb, Didier Lime, Olivier H. Roux, Charlotte Seidner
2018 2018 18th International Conference on Application of Concurrency to System Design (ACSD)  
This paper shows that for some subclasses of cost time Petri nets, the optimalcost reachability problem can be solved more efficiently using a method based on the state classes, without resorting to linear  ...  This paper investigates the optimal-cost reachability problem in the context of time Petri nets, where a rate cost is associated with each place.  ...  The optimal-cost reachability problem has been addressed for Priced Timed Automata (PTAs for short) in [1] - [5] using the region graphs and the zone based graphs.  ... 
doi:10.1109/acsd.2018.000-1 dblp:conf/acsd/BouchenebLRS18 fatcat:nb6aph3rfbat3lbmp3tyi636am

Introduction to the Theory of Complexity

V. J. Rayward-Smith
1995 Journal of the Operational Research Society  
The domain of R is the set of all x such that x, y ∈ R for some y; the codomain or range of R is the set of all y such that x, y ∈ R for some x.  ...  Two pairs x, y and z, w are equal if and only if x = z and y = w. The Cartesian product of two sets A and B, denoted as A × B, is the set of all ordered pairs x, y with x ∈ A and y ∈ B.  ...  Silvestri for pointing out many corrections and for suggesting simpler and clearer proofs of some results.  ... 
doi:10.1057/jors.1995.211 fatcat:rx2m7i3vyreaflkxrbmuh5kbhu

Learning in Auctions: Regret is Hard, Envy is Easy [article]

Constantinos Daskalakis, Vasilis Syrgkanis
2016 arXiv   pre-print
We show that this obstacle is insurmountable: there are no polynomial-time no-regret algorithms for SiSPAs, unless RP⊇ NP, even when the bidders are unit-demand.  ...  Our results for XOS valuations are enabled by a novel Follow-The-Perturbed-Leader algorithm for settings where the number of experts is infinite, and the payoff function of the learner is non-linear.  ...  Revisiting simultaneous second price auctions it is easy to see that the mechanism is 1-value covered and (0, 1)-threshold covered when players actions are restricted to no-overbidding actions and valuations  ... 
arXiv:1511.01411v6 fatcat:i3sb2c5xl5fo5nsmjb7zc7hrxa

Exploiting the Power of Multiplicity: A Holistic Survey of Network-Layer Multipath

Junaid Qadir, Anwaar Ali, Kok-Lim Alvin Yau, Arjuna Sathiaseelan, Jon Crowcroft
2015 IEEE Communications Surveys and Tutorials  
We also highlight open issues and identify directions for future work.  ...  multi-channel, and multi-antenna trends in wireless; ubiquity of mobile devices that are multi-homed with heterogeneous access networks; and the development and standardization of multipath transport protocols  ...  The authors would also like to thank Gareth Tyson and the anonymous reviewers for their useful feedback.  ... 
doi:10.1109/comst.2015.2453941 fatcat:pvatolih4ngwrooewos2rgeaoe

Abstracts of Working Papers in Economics

1994 Abstracts of Working Papers in Economics  
This allows us to determine prices, and leads to additional insights concerning the role of money.  ...  In the latter, shares are also initially equally distributed to adult citizens in the form of coupons, and trade can take place on a coupon stock market, where prices of shares are quoted only in coupons  ...  adjusting a time series of U.S. consumer price and other BLS indexes.  ... 
doi:10.1017/s0951007900006379 fatcat:qmqzliobt5f25onlm3id3yywaq

Logic Synthesis [chapter]

2017 Electronic Design Automation for IC Implementation, Circuit Design, and Process Technology  
ACKNOWLEDGMENT e authors thank Vladimir Yutsis for his helpful feedback on Section 1.5.2.  ...  Vardi, and L. Fix, Prioritized traversal: E�cient reachability analysis for veri�cation and falsi�cation, Twelfth Conference on Computer Aided Verification (CAV'00), E.A. Emerson and A.P.  ...  Chou, and C.-Y. Huang, Multi-patch generation for multi-error logic recti�cation by interpolation with cofactor reduction, Design, Automation and Test in Europe, 2012. 80. H. Chockler, A.  ... 
doi:10.1201/9781315215112-13 fatcat:me52zpnxyfcczh3choo2p4zulm

Towards efficient analysis of Markov automata [article]

Yuliya Butkova, Universität Des Saarlandes
2021
Two of the most challenging problems for Markov automata to date are (i) the optimal time-bounded reachability probability and (ii) the optimal long-run average rewards.  ...  We approach the problem of time-bounded reachability from two different angles.  ...  Analysis of time-bounded properties, such as time-bounded reachability and cumulative time-bounded reward, is by far the most challenging problem for Markov automata.  ... 
doi:10.22028/d291-32744 fatcat:7llo6224uzg2fah6ec7sohlqqa

Caching Mechanism in Peer-to-Peer Networks through Active XML

Abdullah Alrefae, Eric Pardede, Binh Viet Phan
2012 Journal of Software  
Furthermore, some criteria are introduced, which are necessary and sufficient for liveness, to determine the liveness of global system by the same ones of local systems.  ...  Petri net systems synthesis can construct large systems without the requirement of reachability analysis so that it can reduce the high complexity of analyzing global system.  ...  ACKNOWLEDGMENTS To CAPES and CNPq for financial suport.  ... 
doi:10.4304/jsw.7.3.508-515 fatcat:6vlsijzaxjbohh3ti5toew7rmi

Certifying Unstability of Switched Systems Using Sum of Squares Programming

Benoît Legat, Pablo Parrilo, Raphaël Jungers
2020 SIAM Journal of Control and Optimization  
Therefore, the differential reachability and observability Gramians can be computed trajectory-wise by using impulse and initial output responses of dΣ along each φ t−t 0 (x 0 , u).  ...  This alternative way of analysis of slow-fast systems with particular structure may lead to a later analysis of multi-timescale systems over networks.  ...  This includes the polynomial-time decidability of the existence of such a product, an upper bound B = n 3 −n 6 on the length of the shortest positive-column product, and the NP-hardness of deciding if  ... 
doi:10.1137/18m1173460 fatcat:ytlzbwk7vbampbuyo6snenz33m

Abstracts of Working Papers in Economics

1990 Abstracts of Working Papers in Economics  
The simplex method for solving linear programs can be interpreted as a search for market prices that equilibrate the demand for factors of production with their supply.  ...  PD AB We consider the formulation of the non-preemptive single machine scheduling problem using time-indexed variables.  ...  TI Price Response and Optimal Vessel Size in a Multi-Output Fishery. AU Bjorndal, Trond; Gordon, Daniel V. Gorecki, Paul K.  ... 
doi:10.1017/s0951007900001777 fatcat:xbi4wofvazbhnnpitysz5ojzxi

Policy-based self-management of wireless ad hoc networks

Antonis M. Hadjiantonis, George Pavlou
2009 2009 IFIP/IEEE International Symposium on Integrated Network Management  
In the unlikely e v e n t that the a u thor did not send a c o m p le te m anuscript and there are missing pages, these will be noted.  ...  For NU>0.3 the PBM system decides to stream media, in order to avoid excessive download times and user dissatisfaction. Based on media 12.  ...  Time taken for policy retrieval and processing time overheads.  ... 
doi:10.1109/inm.2009.5188885 dblp:conf/im/HadjiantonisP09 fatcat:sdd6vgxcdnef5nztnfbnx245ni

Table of contents

2009 2009 17th Mediterranean Conference on Control and Automation  
and a multi-affine dependence on the successive instants of time of the premise variables until a maximum instant of time M.  ...  The vehicle model accounts also for the actuator dynamics. The paper proposes simple control schemes for tracking a time-parameterizing path.  ...  to decide which model (from the known time-series) has possibly generated this video.  ... 
doi:10.1109/med.2009.5164498 fatcat:bi37lbkbhfaihj7lbc64vvplo4

Advances In Multi-Parametric Programming Theory:Applications in Control And Optimisation [article]

Vasileios Charitopoulos, National Technological University Of Athens, National Technological University Of Athens
2015
LIST OF FIGURES xii 8.3 Effect of θ 2 (minimum CO 2 emissions) on the minimum production cost for fixed value of θ 1  ...  For the purpose of reachability analysis for the class of linear hybrid automata, HYTECH [116] is a symbolic model checker that utilizes polyhedra as representation for the data structure and computes  ...  Other systematic tools used for reachability analysis are: KRONOS [43] that uses symbolic model checking algorithm to determine whether a system modeled as timed automaton satisfies the timing property  ... 
doi:10.26240/heal.ntua.10156 fatcat:6vkqc6i3x5bgrpdepf5o74uhse
« Previous Showing results 1 — 15 out of 53 results