The following pages link to A theory of timed automata (Q1322162):
Displayed 50 items.
- Switched discrete-time systems with time-varying delays: A generalized \(\mathcal H_2\)-approach (Q2389079) (← links)
- A Petri net approach for the design and analysis of web services choreographies (Q2390034) (← links)
- POETS: process-oriented event-driven transaction systems (Q2390035) (← links)
- Schedulability of asynchronous real-time concurrent objects (Q2390036) (← links)
- Modelling and analysis of normative documents (Q2401019) (← links)
- Predictive runtime enforcement (Q2402553) (← links)
- Information rate of some classes of non-regular languages: an automata-theoretic approach (Q2407088) (← links)
- Computational techniques for reachability analysis of Max-Plus-Linear systems (Q2409446) (← 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)
- Efficient modeling of MIMO systems through timed automata based neuro-fuzzy inference engine (Q2453618) (← links)
- Cost enforcement in the real-time specification for Java (Q2460195) (← links)
- Taylor approximation for hybrid systems (Q2461793) (← links)
- On a decision procedure for quantified linear programs (Q2462634) (← links)
- WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model (Q2464934) (← links)
- A zero-space algorithm for negative cost cycle detection in networks (Q2466006) (← links)
- Algorithmic analysis of polygonal hybrid systems. II: Phase portrait and tools (Q2474069) (← links)
- Formal verification of multitasking applications based on timed automata model (Q2475307) (← links)
- Optimal infinite scheduling for multi-priced timed automata (Q2475633) (← links)
- Timed Petri nets and timed automata: On the discriminating power of Zeno sequences (Q2475807) (← links)
- Analysis of dynamic policies (Q2482441) (← links)
- Monotonic hybrid systems (Q2486564) (← links)
- A control synthesis approach for time discrete event systems (Q2489593) (← links)
- Grid automata and supervisory control of dense real-time discrete event systems (Q2489622) (← links)
- Refinement of actions for real-time concurrent systems with causal ambiguity (Q2491208) (← links)
- On model-checking timed automata with stopwatch observers (Q2492187) (← links)
- Optimal control of discrete-time hybrid automata under safety and liveness constraints (Q2496814) (← links)
- Model checking restricted sets of timed paths (Q2503042) (← links)
- LTL over integer periodicity constraints (Q2503321) (← links)
- Bisimulation for labelled Markov processes (Q2506488) (← links)
- Remove irrelevant atomic formulas for timed automaton model checking (Q2508377) (← links)
- Statistical probabilistic model checking with a focus on time-bounded properties (Q2509358) (← links)
- Verifying untimed and timed aspects of the experimental batch plant (Q2512162) (← links)
- Computing efficient operation schemes for chemical plants in multi-batch mode (Q2512166) (← links)
- On composition and lookahead delegation of \(e\)-services modeled by automata (Q2566017) (← links)
- A symbolic decision procedure for cryptographic protocols with time stamps (Q2568115) (← 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)
- A theory of stochastic systems. II: Process algebra (Q2575855) (← links)
- Safe diagnosability for fault-tolerant supervision of discrete-event systems (Q2576131) (← links)
- Expand, enlarge and check: new algorithms for the coverability problem of WSTS (Q2581762) (← links)
- Synthesising succinct strategies in safety games with an application to real-time scheduling (Q2636511) (← links)
- Parameter synthesis for probabilistic timed automata using stochastic game abstractions (Q2636513) (← links)
- Towards a formal semantics for UML/MARTE state machines based on hierarchical timed automata (Q2637308) (← links)
- Shrinking timed automata (Q2637311) (← links)
- Predictable real-time software synthesis (Q2642542) (← links)
- Predicate diagrams for the verification of real-time systems (Q2642985) (← links)
- Task automata: Schedulability, decidability and undecidability (Q2643078) (← links)
- Polynomial interrupt timed automata: verification and expressiveness (Q2662502) (← links)
- (Q2703729) (← links)