Temporal specifications with accumulative values
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5366670 (Why is no real title available?)
- scientific article; zbMATH DE number 3932372 (Why is no real title available?)
- scientific article; zbMATH DE number 176728 (Why is no real title available?)
- scientific article; zbMATH DE number 3501006 (Why is no real title available?)
- scientific article; zbMATH DE number 3628347 (Why is no real title available?)
- scientific article; zbMATH DE number 2038728 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
- A really temporal logic
- Automata, Languages and Programming
- Better Quality in Synthesis through Quantitative Objectives
- Branching-time model checking of parametric one-counter automata
- Church synthesis problem for noisy input
- Decidable problems for powerful programs
- Describing average- and longtime-behavior by weighted MSO logics
- Energy parity games
- Finite Automata Computing Real Functions
- Generalized mean-payoff and energy games
- Handbook of weighted automata
- Lattice Automata
- Mathematical Foundations of Computer Science 2004
- Mathematical Foundations of Computer Science 2004
- Model checking discounted temporal properties
- Multi-valued model checking via classical model checking.
- On Context-Free Languages
- On Omega-Languages Defined by Mean-Payoff Conditions
- Presburger arithmetic with bounded quantifier alternation
- Quantitative Languages
- Reasoning in a restricted temporal logic
- Semigroups, Presburger formulas, and languages
- Simple Programs Realize Exactly Presburger Formulas
- Temporal specifications with accumulative values
- The Complexity of Mean-Payoff Automaton Expression
- The complexity of mean payoff games on graphs
- The temporal logic of branching time
- Using branching time temporal logic to synthesize synchronization skeletons
- Weighted automata and weighted logics
- When model-checking freeze LTL over counter machines becomes decidable
Cited in
(30)- Correct Hardware Design and Verification Methods
- Synchronized CTL over one-counter automata
- Probabilistic model checking for energy-utility analysis
- Discounted-sum automata with multiple discount factors
- Approximate learning of limit-average automata
- On the complexity of rational verification
- ``Most of leads to undecidability: failure of adding frequencies to LTL
- scientific article; zbMATH DE number 7649930 (Why is no real title available?)
- Temporal specifications with accumulative values
- Collecting statistics over runtime executions
- Hyperplane separation technique for multidimensional mean-payoff games
- Bidirectional nested weighted automata
- Ratio and weight quantiles
- Designing equilibria in concurrent games with social welfare and temporal logic constraints
- Discounted-sum automata with multiple discount factors
- Stochastization of weighted automata
- Synthesis for multi-weighted games with branching-time winning conditions
- Pumping lemmas for weighted automata
- Characterising and verifying the core in concurrent multi-player mean-payoff games
- Nearly optimal verifiable data streaming
- Quantitative safety and liveness
- Reasoning about Quality and Fuzziness of Strategic Behaviors
- Introduction to model checking
- What's decidable about weighted automata?
- Solving mean-payoff games via quasi dominions
- Quantitative vs. weighted automata
- Model checking and synthesis for branching multi-weighted logics
- Maximizing the conditional expected reward for reaching the goal
- Averaging in LTL
- Quantitative fair simulation games
This page was built for publication: Temporal specifications with accumulative values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946736)
