Symbolic Optimal Reachability in Weighted Timed Automata

DOI10.1007/978-3-319-41528-4_28zbMath1411.68052arXiv1602.00481OpenAlexW2253126574MaRDI QIDQ4633550

Patricia Bouyer, Nicolas Markey, Maximilien Colange

Publication date: 3 May 2019

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.00481

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

An integer static analysis for better extrapolation in Uppaal ⋮ Better abstractions for timed automata ⋮ Parameter Synthesis for Bounded Cost Reachability in Time Petri Nets ⋮ Monte Carlo tree search for priced timed automata ⋮ Unnamed Item ⋮ Backward symbolic optimal reachability in weighted timed automata ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next? ⋮ Cost Problems for Parametric Time Petri Nets*

This page was built for publication: Symbolic Optimal Reachability in Weighted Timed Automata