The following pages link to A theory of timed automata (Q1322162):
Displayed 50 items.
- Product interval automata (Q1847544) (← links)
- Counter machines and verification problems. (Q1853523) (← links)
- On probabilistic timed automata. (Q1853732) (← links)
- Decidable integration graphs. (Q1854273) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- Positive loop-closed automata: A decidable class of hybrid systems (Q1858439) (← links)
- Linear parametric model checking of timed automata (Q1858447) (← links)
- Automatic synthesis of a subclass of schedulers in timed systems. (Q1874276) (← links)
- Presburger liveness verification of discrete timed automata. (Q1874402) (← links)
- Eliminating the storage tape in reachability constructions. (Q1874416) (← links)
- Concurrency in timed automata (Q1884910) (← links)
- Updatable timed automata (Q1885906) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- Exploiting timed automata based fuzzy controllers for designing adaptive intrusion detection systems (Q1933806) (← links)
- A study on shuffle, stopwatches and independently evolving clocks (Q1938360) (← links)
- Composition methods for constructing characteristic formulas for dense-time models (Q1938922) (← links)
- Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions (Q1941851) (← links)
- Checking noninterference in timed CSP (Q1941887) (← links)
- Model-checking timed automata with deadlines with Uppaal (Q1941900) (← links)
- Superposition as a decision procedure for timed automata (Q1949086) (← links)
- Modal event-clock specifications for timed component-based design (Q1951603) (← links)
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations (Q1960526) (← links)
- Discrete-time control for rectangular hybrid automata (Q1960531) (← links)
- On the initialization of clocks in timed formalisms (Q1989329) (← links)
- Parameterized model checking of networks of timed automata with Boolean guards (Q1989334) (← links)
- Timeline-based planning over dense temporal domains (Q1989337) (← links)
- Intention as commitment toward time (Q1989411) (← links)
- Probabilistic timed graph transformation systems (Q1994363) (← links)
- On the semantics of polychronous polytimed specifications (Q1996008) (← links)
- Backward symbolic optimal reachability in weighted timed automata (Q1996010) (← links)
- Certifying emptiness of timed Büchi automata (Q1996011) (← links)
- Learning specifications for labelled patterns (Q1996014) (← links)
- On subgame perfect equilibria in turn-based reachability timed games (Q1996016) (← links)
- Computing maximally-permissive strategies in acyclic timed automata (Q1996019) (← links)
- Active learning of timed automata with unobservable resets (Q1996023) (← links)
- Optimal and robust controller synthesis using energy timed automata with uncertainty (Q1996422) (← links)
- Semantics of temporal constrained objects (Q1996867) (← links)
- Dense-choice counter machines revisited (Q2015129) (← links)
- A game approach to determinize timed automata (Q2018058) (← links)
- The compound interest in relaxing punctuality (Q2024340) (← links)
- Optimal and robust controller synthesis. Using energy timed automata with uncertainty (Q2024347) (← links)
- Timed vacuity (Q2024362) (← links)
- A process calculus BigrTiMo of mobile systems and its formal semantics (Q2026376) (← links)
- Flexible nets: a modeling formalism for dynamic systems with uncertain parameters (Q2177765) (← links)
- Time-optimal control of large-scale systems of systems using compositional optimization (Q2177769) (← links)
- PuRSUE -- from specification of robotic environments to synthesis of controllers (Q2198133) (← links)
- Computing branching distances with quantitative games (Q2210522) (← links)
- Operator precedence temporal logic and model checking (Q2215961) (← links)
- Model-checking precision agriculture logistics: the case of the differential harvest (Q2220343) (← links)
- Reachability relations of timed pushdown automata (Q2221811) (← links)