The following pages link to A theory of timed automata (Q1322162):
Displayed 50 items.
- 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)
- Multi-scale verification of distributed synchronisation (Q2225471) (← links)
- Learning Mealy machines with one timer (Q2232274) (← links)
- A design of GPU-based quantitative model checking (Q2234091) (← links)
- Towards general axiomatizations for bisimilarity and trace semantics (Q2237336) (← links)
- An extension of the inverse method to probabilistic timed automata (Q2248053) (← links)
- Event clock message passing automata: a logical characterization and an emptiness checking algorithm (Q2248059) (← links)
- Time-triggered runtime verification (Q2248067) (← links)
- Model checking for probabilistic timed automata (Q2248072) (← links)
- A compositional modelling and analysis framework for stochastic hybrid systems (Q2248073) (← links)
- On-the-fly verification and optimization of DTA-properties for large Markov chains (Q2248080) (← links)
- Modelling temporal behaviour in complex systems with Timebands (Q2248089) (← links)
- Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\) (Q2249659) (← links)
- A decidable class of planar linear hybrid systems (Q2257303) (← links)
- On the expressiveness of TPTL and MTL (Q2266987) (← links)
- State estimation of max-plus automata with unobservable events (Q2280664) (← links)
- Combining free choice and time in Petri nets (Q2291812) (← links)
- Consistency in parametric interval probabilistic timed automata (Q2291816) (← links)
- Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
- Input urgent semantics for asynchronous timed session types (Q2329441) (← links)
- Conditional simple temporal networks with uncertainty and decisions (Q2334599) (← links)
- Effective definability of the reachability relation in timed automata (Q2338218) (← links)
- Sampling automata and programs (Q2339473) (← links)
- Entropy of regular timed languages (Q2343131) (← links)
- Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques (Q2343139) (← links)
- Reachability in two-clock timed automata is PSPACE-complete (Q2347796) (← links)
- A maximal entropy stochastic process for a timed automaton (Q2347798) (← links)
- Unwinding biological systems (Q2348024) (← links)
- On the expressivity of time-varying graphs (Q2348032) (← links)
- Abstraction and approximation in fuzzy temporal logics and models (Q2355383) (← links)
- Checking conformance for time-constrained scenario-based specifications (Q2355682) (← links)
- Deterministic delay analysis of AVB switched Ethernet networks using an extended trajectory approach (Q2362235) (← links)
- The Newton and Coulomb laws as information transfer by virtual particles (Q2364477) (← links)
- Continuity controlled hybrid automata (Q2368692) (← links)
- Periodicity based decidable classes in a first order timed logic (Q2368906) (← links)
- Counterexample-guided predicate abstraction of hybrid systems (Q2368954) (← links)
- Scheduling with timed automata (Q2368955) (← links)
- Schedulability analysis of fixed-priority systems using timed automata (Q2368958) (← links)
- Efficient timed model checking for discrete-time systems (Q2368994) (← links)
- A survey of temporal data mining (Q2371224) (← links)
- Algorithmic analysis of polygonal hybrid systems. I: Reachability (Q2373713) (← links)
- Symbolic model checking for probabilistic timed automata (Q2373877) (← links)
- Timed substitutions for regular signal-event languages (Q2385194) (← links)
- On the optimal reachability problem of weighted timed automata (Q2385195) (← links)
- On the expressiveness and decidability of o-minimal hybrid systems (Q2387414) (← links)