Filters








13,106 Hits in 3.3 sec

Model-Checking for Weighted Timed Automata [chapter]

Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
2004 Lecture Notes in Computer Science  
We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach.  ...  Weighted timed automata are timed automata extended with costs on both edges and locations.  ...  In this paper, we investigate the WCTL model-checking problem for weighted timed automata.  ... 
doi:10.1007/978-3-540-30206-3_20 fatcat:j2q4qlobdzd4pfhohq35jnfa4e

On model-checking timed automata with stopwatch observers

Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
2006 Information and Computation  
In this paper, we study the model-checking problem for weighted timed automata and the weighted CTL logic; we also study the finiteness of bisimulations of weighted timed automata.  ...  Weighted timed automata are timed automata extended with costs on both edges and locations.  ...  Our contribution In this paper, we investigate the WCTL model-checking problem for weighted timed automata.  ... 
doi:10.1016/j.ic.2005.12.001 fatcat:qdmb5j2yzfg7rc4q2er3busaci

Model Checking for a Class of Weighted Automata [article]

Peter Buchholz, Peter Kemper
2003 arXiv   pre-print
Afterwards, algorithms to check a weighted automaton according to a CTL formula are presented. As a last result, a bisimulation is presented for weighted automata and for CTL.  ...  of weighted automata.  ...  The automata models used in the mentioned approaches are untimed automata for standard model checking, probabilistic automata for timed and probabilistic model checking, stochastic automata for stochastic  ... 
arXiv:cs/0304021v1 fatcat:5g5l532gpzeqdjxb7ao3omkoha

Model Checking Real-Time Systems [chapter]

Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Joël Ouaknine, James Worrell
2018 Handbook of Model Checking  
This chapter surveys timed automata as a formalism for model checking real-time systems.  ...  We then present the main model-checking results in this framework, and give a hint about some recent extensions (namely weighted timed automata and timed games).  ...  Acknowledgement We thank the reviewers for their numerous comments, remarks and additional references, which greatly helped us improve this chapter.  ... 
doi:10.1007/978-3-319-10575-8_29 fatcat:thsp3udcpnfyjpjzn6i2slbplm

Weighted Timed Automata: Model-Checking and Games

Patricia Bouyer
2006 Electronical Notes in Theoretical Computer Science  
In this paper, we present weighted/priced timed automata, an extension of timed automaton with costs, and solve several interesting problems on that model.  ...  I would like to thank my co-authors for fruitful collaboration and discussions on the subject of timed automata extended with cost information: Thomas Brihaye, Ed Brinksma, Véronique Bruyère, Franck Cassez  ...  Theorem 4.1 ([18,13,17] ) Model-checking WCTL is undecidable for weighted timed automata with at least three clocks. It is decidable for weighted timed automata with one clock.  ... 
doi:10.1016/j.entcs.2006.04.002 fatcat:d4o7fe7tpfhbvm5tuufxpsw2ce

Quantitative Verification of Weighted Kripke Structures [chapter]

Patricia Bouyer, Patrick Gardy, Nicolas Markey
2014 Lecture Notes in Computer Science  
Following several recent works, we study model checking for (one-dimensional) weighted Kripke structures with positive and negative weights, and temporal logics constraining the total and/or average weight  ...  Extending formal verification techniques to handle quantitative aspects, both for the models and for the properties to be checked, has become a central research topic over the last twenty years.  ...  Algorithms for model checking fragments of WLTL Decidability of WLTL rf Sum model checking It follows from the proof of Theorem 12 that model checking WLTL rf Avg is undecidable: the formula we built  ... 
doi:10.1007/978-3-319-11936-6_6 fatcat:fc3xuqmwrzhibpau7ijyjqxrry

Robustness in Timed Automata [chapter]

Patricia Bouyer, Nicolas Markey, Ocan Sankur
2013 Lecture Notes in Computer Science  
In this paper we survey several approaches to the robustness of timed automata, that is, the ability of a system to resist to slight perturbations or errors.  ...  We will concentrate on robustness against timing errors which can be due to measuring errors, imprecise clocks, and unexpected runtime behaviors such as execution times that are longer or shorter than  ...  Robust model-checking of safety, Büchi, LTL properties for closed timed automata is PSPACE-complete.  ... 
doi:10.1007/978-3-642-41036-9_1 fatcat:i2otw7n7bbhl7gcvmgcpevkufm

From Model Checking to Model Measuring [chapter]

Thomas A. Henzinger, Jan Otop
2013 Lecture Notes in Computer Science  
We use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for standard word and tree automata by the optimal-weight question for the weighted versions of these  ...  We show that for automatic distance functions, and ω-regular linear-time and branching-time specifications, the model-measuring problem can be solved.  ...  Returning to the branching-time case, a (qualitative) automata-theoretic CTL model-checking procedure works as follows.  ... 
doi:10.1007/978-3-642-40184-8_20 fatcat:kp4t75xuungrdlzuvyaxodzvfi

Linear-Time Limited Automata [chapter]

Bruno Guillon, Luca Prigioniero
2018 Lecture Notes in Computer Science  
We also obtain polynomial transformations into related models, including weight-reducing Hennie machines, and we show exponential gaps for converse transformations in the deterministic case.  ...  The time complexity of 1-limited automata is investigated from a descriptional complexity view point.  ...  We are very indebted to Giovanni Pighizzini for suggesting the problem and for many stimulating conversations.  ... 
doi:10.1007/978-3-319-94631-3_11 fatcat:gizq3nh5nrel5cee6m7vuga2ba

Quantitative Modal Transition Systems [chapter]

Kim G. Larsen, Axel Legay
2013 Lecture Notes in Computer Science  
This extended abstract offers a brief survey presentation of the specification formalism of modal transition systems and its recent extensions to the quantitative setting of timed as well as stochastic  ...  For instance, the reception of a new email (action receive) must take between one and three time units, the checking of the email (action check) is allowed to take up to five time units. receive, [1,  ...  There are various other extensions of automata, among which one finds weighted automata, that are classical automata whose transitions are equipped with integer weights.  ... 
doi:10.1007/978-3-642-37635-1_3 fatcat:tc6kcx2tcvcatminyfupo5sc3q

Model measuring for hybrid systems

Thomas A. Henzinger, Jan Otop
2014 Proceedings of the 17th international conference on Hybrid systems: computation and control - HSCC '14  
We are interested in distances represented by monotonic hybrid automata, a hybrid counterpart of (discrete) weighted automata, whose recognized timed languages are monotone (w.r.t. inclusion) in the values  ...  The model-measuring problem asks, given a model M and a specification, what is the maximal distance such that all models within that distance from M satisfy (or violate) the specification.  ...  Acknowledgment This work was supported in part by the Austrian Science Fund NFN RiSE (Rigorous Systems Engineering) and by the ERC Advanced Grant QUAREM (Quantitative Reactive Modeling).  ... 
doi:10.1145/2562059.2562130 dblp:conf/hybrid/HenzingerO14 fatcat:wpq67ynf3rbcfhvburimxeaccq

Creating and Weighting Hunspell Dictionariesas Finite-State Automata

Tommi Pirinen, Krister Lindén
2010 Investigationes Linguisticae  
What we propose is a generic and efficient language-independent framework of weighted finite-state automata for spell-checking in typical open-source software, e.g.  ...  In this paper, we demonstrate a method for converting Hunspell and related spell-checking lexicons into finite-state automata.  ...  Acknowledgment The authors would like to thank Miikka Silfverberg, Sam Hardwick and Brian Croom and others in the HFST research team for contributions to research tools and useful discussions.  ... 
doi:10.14746/il.2010.21.1 fatcat:i2y5ob46nnf4doqyik3kduqpyi

Stochastic Semantics and Statistical Model Checking for Networks of Priced Timed Automata [article]

Alexandre David, Kim G. Larsen, Axel Legay, Marius Mikučionis, Danny Bøgsted Poulsen, Jonas van Vliet, Zheng Wang
2014 arXiv   pre-print
The semantics provides the basis for satisfaction of probabilistic Weighted CTL properties (PWCTL), conservatively extending the classical satisfaction of timed automata with respect to TCTL.  ...  In particular the extension allows for hard real-time properties of timed automata expressible in TCTL to be refined by performance properties, e.g. in terms of probabilistic guarantees of time- and cost-bounded  ...  STATISTICAL MODEL CHECKING FOR NPTA As we pointed out, most of model checking problems for NPTAs and PWCTL (including reachability) are undecidable.  ... 
arXiv:1106.3961v2 fatcat:t4lleblwjvgybfek4zvypjsmp4

Verifying Linear Duration Constraints of Timed Automata [chapter]

Pham Hong Thai, Dang Van Hung
2005 Lecture Notes in Computer Science  
We prove that linear duration invariants of timed automata are discretisable, and reduce checking if a timed automaton satisfies a linear duration invariant to checking if the integer timed region graph  ...  Abstract This report aims at developing a technique for checking if a timed automaton satisfies a linear duration constraint on the automaton states.  ...  Timed Automata Timed automata was introduced in [1, 2] as formal models for real-time systems. Here we only give a brief description for timed automata and their behavior.  ... 
doi:10.1007/978-3-540-31862-0_22 fatcat:hjsikawexnfn3dgx6tfvjxlcp4

Synchronous composition of interval weighted automata

Jan Komenda, Sébastien Lahaye, Jean-Louis Boimond
2010 IFAC Proceedings Volumes  
They constitute an extension of (max,+) automata since they enable us to model temporal constraints (instead of exact durations) for transitions.  ...  Their synchronous composition, which coincides with the synchronous product of underlying (one clock) timed automata, results in multi-event interval weighted automata, whose behaviors are studied.  ...  CONCLUSION We have shown how techniques based on semirings of interval and tensor linear algebra enable modeling of an  ... 
doi:10.3182/20100830-3-de-4013.00053 fatcat:f2p5tgbprfdrvomhpljfihcbga
« Previous Showing results 1 — 15 out of 13,106 results