Finding minimum and maximum termination time of timed automata models with cyclic behaviour

DOI10.1016/J.TCS.2016.12.020zbMath1357.68109arXiv1610.09795OpenAlexW2548654831MaRDI QIDQ507600

Omar Al-Bataineh, Tim French, M. A. Reynolds

Publication date: 6 February 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

timed automatamodel checkingworst-case execution time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Uses Software

• Uppaal
• opaal
• Algorithm 97
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum and maximum delay problems in real-time systems
• Checking timed Büchi automata emptiness efficiently
• A quadratic-time DBM-based successor algorithm for checking timed automata
• A theory of timed automata
• Forward analysis of updatable timed automata
• Efficient Detection of Zeno Runs in Timed Automata
• Static Detection of Zeno Runs in UPPAAL Networks Based on Synchronization Matrices and Two Data-Variable Heuristics
• Computer Aided Verification
• Formal Methods for the Design of Real-Time Systems
• Formal Methods for the Design of Real-Time Systems
• Finding Best and Worst Case Execution Times of Systems Using Difference-Bound Matrices
• Lectures on Concurrency and Petri Nets
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: Finding minimum and maximum termination time of timed automata models with cyclic behaviour