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

DOI10.1007/978-3-319-44878-7_9zbMath1433.68248OpenAlexW2517932978MaRDI QIDQ4603564

Hanna Klaudel, Raymond Devillers

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

zbMATH Keywords

approximationtimed automatadurationstate 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)

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