The following pages link to Kronos (Q14010):
Displaying 50 items.
- A Ravenscar-compliant run-time kernel for safety-critical systems (Q1395684) (← links)
- How to verify a Safe real-time system: The application of model checking and timed automata to the production cell case study (Q1395689) (← links)
- The power of reachability testing for timed automata (Q1399974) (← links)
- Generalized discrete timed automata: Decidable approximations for safety verification. (Q1401259) (← links)
- Pushdown timed automata: A binary reachability characterization and safety verification. (Q1401320) (← links)
- Deductive verification of real-time systems using STeP (Q1589585) (← links)
- PLC-automata: A new class of implementable real-time automata (Q1589587) (← links)
- Automatic verification of real-time systems with discrete probability distributions. (Q1603709) (← links)
- Specification of real-time and hybrid systems in rewriting logic (Q1608921) (← links)
- Priority-free conditionally-preemptive scheduling of modular sporadic real-time systems (Q1640292) (← links)
- Bounded determinization of timed automata with silent transitions (Q1699228) (← links)
- Decidable integration graphs. (Q1854273) (← links)
- Continuous modeling of real-time and hybrid systems: From concepts to tools (Q1856190) (← links)
- Real-time system = discrete system + clock variables (Q1856191) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- Symbolic model checking of timed guarded commands using difference decision diagrams (Q1858438) (← links)
- Automated verification of an audio-control protocol using UPPAAL (Q1858445) (← links)
- Linear parametric model checking of timed automata (Q1858447) (← links)
- Presburger liveness verification of discrete timed automata. (Q1874402) (← links)
- Forward analysis of updatable timed automata (Q1878925) (← links)
- Comparing model checking and logical reasoning for real-time systems (Q1882792) (← links)
- Updatable timed automata (Q1885906) (← links)
- On reachability and minimum cost optimal control (Q1888412) (← links)
- Efficient model-checking of dense-time systems with time-convexity analysis (Q1935781) (← links)
- Model-checking timed automata with deadlines with Uppaal (Q1941900) (← links)
- Superposition as a decision procedure for timed automata (Q1949086) (← links)
- Zone-based verification of timed automata: extrapolations, simulations and what next? (Q2112098) (← links)
- Reachability relations of timed pushdown automata (Q2221811) (← links)
- An approximation algorithm for box abstraction of transition systems on real state spaces (Q2248056) (← links)
- Model checking for probabilistic timed automata (Q2248072) (← links)
- Reconciling fault-tolerant distributed algorithms and real-time computing (Q2251157) (← links)
- Towards light-weight probabilistic model checking (Q2336743) (← links)
- Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques (Q2343139) (← links)
- Counterexample-guided predicate abstraction of hybrid systems (Q2368954) (← links)
- Scheduling with timed automata (Q2368955) (← links)
- Symbolic model checking for probabilistic timed automata (Q2373877) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- Dealing with practical limitations of distributed timed model checking for timed automata (Q2431767) (← links)
- TCTL-preserving translations from timed-arc Petri nets to networks of timed automata (Q2453531) (← links)
- Optimal reachability for multi-priced timed automata (Q2474054) (← links)
- Formal verification of multitasking applications based on timed automata model (Q2475307) (← links)
- Constructing invariants for hybrid systems (Q2475635) (← links)
- Interval timed coloured Petri net: efficient construction of its state class space preserving linear properties (Q2481211) (← links)
- A control synthesis approach for time discrete event systems (Q2489593) (← links)
- Advances in verification of time Petri nets and timed automata. A temporal logic approach. (Q2493434) (← links)
- Remove irrelevant atomic formulas for timed automaton model checking (Q2508377) (← links)
- Hybrid control of networked embedded systems (Q2512007) (← links)
- Computing efficient operation schemes for chemical plants in multi-batch mode (Q2512166) (← links)
- A partial order semantics approach to the clock explosion problem of timed automata (Q2575733) (← links)
- A theory of stochastic systems. I: Stochastic automata (Q2575854) (← links)
