scientific article; zbMATH DE number 1794367
From MaRDI portal
Publication:4552463
zbMath0991.68037MaRDI QIDQ4552463
Ansgar Fehnker, Paul Pettersson, Thomas Hune, Gerd Behrmann, Kim Guldstrand Larsen
Publication date: 3 September 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2034/20340147
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (68)
Scheduling with timed automata ⋮ Language Emptiness of Continuous-Time Parametric Timed Automata ⋮ Statistical Model Checking for Networks of Priced Timed Automata ⋮ Model Checking Real-Time Systems ⋮ Verification of Hybrid Systems ⋮ Improved undecidability results on weighted timed automata ⋮ On the optimal reachability problem of weighted timed automata ⋮ On using priced timed automata to achieve optimal scheduling ⋮ Performance analysis of probabilistic timed automata using digital clocks ⋮ Optimal paths in weighted timed automata ⋮ Symbolic Minimum Expected Time Controller Synthesis for Probabilistic Timed Automata ⋮ Verification and Control of Partially Observable Probabilistic Real-Time Systems ⋮ Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems ⋮ A survey of timed automata for the development of real-time systems ⋮ Concurrent weighted logic ⋮ Controller synthesis for dynamic hierarchical real-time plants using timed automata ⋮ Cost-related interface for software product lines ⋮ Optimal controller synthesis for timed systems ⋮ Monte Carlo tree search for priced timed automata ⋮ Cost-optimal timed trace synthesis for scheduling of intermittent embedded systems ⋮ Unnamed Item ⋮ Energy Büchi problems ⋮ A Kleene-Schützenberger theorem for weighted timed automata ⋮ Unnamed Item ⋮ Weighted o-minimal hybrid systems ⋮ Alternation-free weighted mu-calculus: decidability and completeness ⋮ Parametric Verification of Weighted Systems ⋮ Specifications for decidable hybrid games ⋮ Model-checking precision agriculture logistics: the case of the differential harvest ⋮ Optimal Reachability in Divergent Weighted Timed Games ⋮ Infinite Runs in Weighted Timed Automata with Energy Constraints ⋮ Concavely-Priced Timed Automata ⋮ Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets ⋮ Emptiness and Universality Problems in Timed Automata with Positive Frequency ⋮ Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata ⋮ Optimal infinite scheduling for multi-priced timed automata ⋮ Backward symbolic optimal reachability in weighted timed automata ⋮ Optimal and robust controller synthesis using energy timed automata with uncertainty ⋮ Complete proof systems for weighted modal logic ⋮ MSO logics for weighted timed automata ⋮ Discount-Optimal Infinite Runs in Priced Timed Automata ⋮ On model-checking timed automata with stopwatch observers ⋮ Quantitative analysis of weighted transition systems ⋮ Formal language properties of hybrid systems with strong resets ⋮ Optimal and robust controller synthesis. Using energy timed automata with uncertainty ⋮ Weighted register automata and weighted logic on data words ⋮ Unnamed Item ⋮ Hybrid control of networked embedded systems ⋮ On decidability of recursive weighted logics ⋮ A Kleene-Schützenberger Theorem for Weighted Timed Automata ⋮ Unnamed Item ⋮ STORMED Hybrid Games ⋮ Optimal run problem for weighted register automata ⋮ Unnamed Item ⋮ Weighted Timed MSO Logics ⋮ Symbolic Approximation of Weighted Timed Games ⋮ Costs and rewards in priced timed automata ⋮ Model-checking Timed Temporal Logics ⋮ Model Checking Logic WCTL with Multi Constrained Modalities on One Clock Priced Timed Automata ⋮ Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata ⋮ On the Supports of Recognizable Timed Series ⋮ Energy Games in Multiweighted Automata ⋮ Weighted automata ⋮ Keeping Secrets in Resource Aware Components ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next? ⋮ Parametric Analyses of Attack-fault Trees* ⋮ Cost Problems for Parametric Time Petri Nets* ⋮ Timed network games
This page was built for publication:
