Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata

DOI10.1007/978-3-319-44878-7_9zbMATH Open1433.68248OpenAlexW2517932978MaRDI QIDQ4603564FDOQ4603564

Authors: Raymond Devillers, Hanna Klaudel 

Publication date: 16 February 2018

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44878-7_9

Recommendations

• Automatic abstraction algorithm for timed automata
• Trace abstraction refinement for timed automata
• Better abstractions for timed automata
• Better abstractions for timed automata
• Revisiting local time semantics for networks of timed automata
• Timed Unfoldings for Networks of Timed Automata
• Automatic Abstraction Refinement for Timed Automata
• scientific article; zbMATH DE number 1796133
• Complete abstractions of dynamical systems by timed automata

zbMATH Keywords

durationapproximationtimed automatastate space explosion

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (1)

• An efficient state space construction for a class of timed automata

This page was built for publication: Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603564)