Minimum and maximum delay problems in real-time systems
From MaRDI portal
Publication:685111
DOI10.1007/BF00709157zbMath0777.68045MaRDI QIDQ685111
Mihalis Yannakakis, Costas Courcoubetis
Publication date: 30 September 1993
Published in: Formal Methods in System Design (Search for Journal in Brave)
shortest pathreachability problemcorrectness of real-time systemsdelay problemsfinite state systemtimed graphstimes
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)
Related Items
Scheduling with timed automata, Efficient timed model checking for discrete-time systems, Folk theorems on the determinization and minimization of timed automata, Schedulability of asynchronous real-time concurrent objects, Optimal paths in weighted timed automata, Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems, A survey of timed automata for the development of real-time systems, The power of reachability testing for timed automata, Unnamed Item, Interrupt timed automata: verification and expressiveness, Concavely-Priced Timed Automata, Parametric metric interval temporal logic, Fair Termination for Parameterized Probabilistic Concurrent Systems, Finding minimum and maximum termination time of timed automata models with cyclic behaviour, Compositional schedulability analysis of real-time actor-based systems, Verifying time Petri nets by linear programming, Model checking restricted sets of timed paths, An Introduction to Timed Automata, Robust safety of timed automata, On a class of timer hybrid systems reducible to finite state automata, 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
Cites Work
