Minimum and maximum delay problems in real-time systems

DOI10.1007/BF00709157zbMATH Open0777.68045MaRDI QIDQ685111FDOQ685111

Authors: Mihalis Yannakakis, Costas Courcoubetis 

Publication date: 30 September 1993

Published in: Formal Methods in System Design (Search for Journal in Brave)

Recommendations

• A theory of timed automata
• Model-checking in dense real-time
• scientific article; zbMATH DE number 2102690
• Symbolic model checking for real-time systems
• Time bounds for real-time process control in the presence of timing uncertainty

zbMATH Keywords

shortest pathreachability problemcorrectness of real-time systemsdelay problemsfinite state systemtimed graphstimes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• A really temporal logic
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (26)

• Optimal paths in weighted timed automata
• A survey of timed automata for the development of real-time systems
• Model-based verification, optimization, synthesis and performance evaluation of real-time systems
• Schedulability of asynchronous real-time concurrent objects
• Compositional schedulability analysis of real-time actor-based systems
• Robust safety of timed automata
• Scheduling with timed automata
• Folk theorems on the determinization and minimization of timed automata
• Interrupt timed automata: verification and expressiveness
• A performance analysis of minimum laxity and earliest deadline scheduling in a real-time system
• Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
• Efficient timed model checking for discrete-time systems
• On a class of timer hybrid systems reducible to finite state automata
• Verifying time Petri nets by linear programming
• Is your model checker on time? On the complexity of model checking for timed modal logics
• Reachability in two-clock timed automata is PSPACE-complete
• Checking timed Büchi automata emptiness efficiently
• Model checking restricted sets of timed paths
• The power of reachability testing for timed automata
• Parametric metric interval temporal logic
• Concavely-Priced Timed Automata
• Title not available (Why is that?)
• On the minimum delay problem
• Finding minimum and maximum termination time of timed automata models with cyclic behaviour
• An introduction to timed automata
• Fair termination for parameterized probabilistic concurrent systems

This page was built for publication: Minimum and maximum delay problems in real-time systems

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