Guarded autonomous transitions increase conciseness and expressiveness of timed automata

DOI10.1007/978-3-030-57628-8_13OpenAlexW3080312608MaRDI QIDQ1996031

Susanna Donatelli, Serge Haddad

Publication date: 2 March 2021

Full work available at URL: https://hal.inria.fr/hal-03136066

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Guarded autonomous transitions increase conciseness and expressiveness of timed automata

Cites Work

• Unnamed Item
• Unnamed Item
• Expressiveness and conciseness of timed automata for the verification of stochastic models
• Guarded autonomous transitions increase conciseness and expressiveness of timed automata
• Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
• State-space support for path-based reward variables
• Expressing and Computing Passage Time Measures of GSPN Models with HASL
• Model-checking continuous-time Markov chains

This page was built for publication: Guarded autonomous transitions increase conciseness and expressiveness of timed automata