scientific article; zbMATH DE number 1796156
From MaRDI portal
Publication:4551180
zbMath0991.68536MaRDI QIDQ4551180
Gerd Behrmann, Thomas Hune, Ansgar Fehnker, Ed Brinksma, Kim Guldstrand Larsen
Publication date: 4 September 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2102/21020493
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (28)
Model Checking Real-Time Systems ⋮ Concavely-Priced Probabilistic Timed Automata ⋮ On using priced timed automata to achieve optimal scheduling ⋮ Performance analysis of probabilistic timed automata using digital clocks ⋮ How to stop time stopping ⋮ Optimal paths in weighted timed automata ⋮ Symbolic Minimum Expected Time Controller Synthesis for Probabilistic Timed Automata ⋮ Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems ⋮ Pushdown timed automata: A binary reachability characterization and safety verification. ⋮ Optimal controller synthesis for timed systems ⋮ Parameter Synthesis for Bounded Cost Reachability in Time Petri Nets ⋮ Cost-optimal timed trace synthesis for scheduling of intermittent embedded systems ⋮ Unnamed Item ⋮ Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets ⋮ Concavely-Priced Timed Automata ⋮ Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata ⋮ Optimal reachability for multi-priced timed automata ⋮ Optimal infinite scheduling for multi-priced timed automata ⋮ Backward symbolic optimal reachability in weighted timed automata ⋮ Discount-Optimal Infinite Runs in Priced Timed Automata ⋮ Quantitative analysis of weighted transition systems ⋮ Trading Plaintext-Awareness for Simulatability to Achieve Chosen Ciphertext Security ⋮ Minimal Cost Reachability/Coverability in Priced Timed Petri Nets ⋮ Conditional Probabilities over Probabilistic and Nondeterministic Systems ⋮ Costs and rewards in priced timed automata ⋮ Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next? ⋮ Cost Problems for Parametric Time Petri Nets*
Uses Software
This page was built for publication:
