The following pages link to A theory of timed automata (Q1322162):
Displayed 50 items.
- On the completeness and decidability of duration calculus with iteration (Q557828) (← links)
- Optimal paths in weighted timed automata (Q596026) (← links)
- Bisimulation on speed: Worst-case efficiency (Q598200) (← links)
- SetExp: a method of transformation of timed automata into finite state automata (Q601048) (← links)
- Learning of event-recording automata (Q604474) (← links)
- Weak bisimulation for probabilistic timed automata (Q606996) (← links)
- Aspects of availability. Enforcing timed properties to prevent denial of service (Q608233) (← links)
- Validation and verification of web services choreographies by using timed automata (Q615897) (← links)
- Untiming timed languages (Q672021) (← links)
- The algorithmic analysis of hybrid systems (Q673868) (← links)
- Symbolic bisimulations (Q674194) (← links)
- Linear reachability problems and minimal solutions to linear Diophantine equation systems (Q703515) (← links)
- Reachability results for timed automata with unbounded data structures (Q707597) (← links)
- Quantitative analysis of weighted transition systems (Q710680) (← links)
- Robustness of temporal logic specifications for continuous-time signals (Q732015) (← links)
- Checking timed Büchi automata emptiness efficiently (Q816203) (← links)
- A supervisory control method for ensuring the conformance of real-time discrete event systems (Q816702) (← links)
- Semantic domains of timed event structures (Q840017) (← links)
- Conformance testing for real-time systems (Q842583) (← links)
- Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology (Q843992) (← links)
- Supervisory control of \((\max,+)\) automata: a behavioral approach (Q843993) (← links)
- Improved undecidability results on weighted timed automata (Q844195) (← links)
- Formal verification of real-time systems with preemptive scheduling (Q844238) (← links)
- Folk theorems on the determinization and minimization of timed automata (Q845728) (← links)
- Robust parametric reachability for timed automata (Q846009) (← links)
- State explosion in almost-sure probabilistic reachability (Q846015) (← links)
- Modular design of real-time systems using hierarchical communicating real-time state machines (Q853606) (← links)
- Verifying distributed real-time properties of embedded systems via graph transformations and model checking (Q853626) (← links)
- Performance analysis of probabilistic timed automata using digital clocks (Q853731) (← links)
- How to stop time stopping (Q855006) (← links)
- Analysis of a biphase mark protocol with Uppaal and PVS (Q855013) (← links)
- Workload correlations in multi-processor hard real-time systems (Q858321) (← links)
- On the freeze quantifier in Constraint LTL: Decidability and complexity (Q868025) (← links)
- Axiomatisation and decidability of multi-dimensional Duration Calculus (Q868026) (← links)
- Hybridization methods for the analysis of nonlinear systems (Q868432) (← links)
- Symbolic models for control systems (Q868433) (← links)
- An automata-theoretic approach to constraint LTL (Q870361) (← links)
- Parametric probabilistic transition systems for system design and analysis (Q877158) (← links)
- Semantics and pragmatics of real-time maude (Q880982) (← links)
- Timed discrete event control of parallel production lines with continuous outputs (Q939012) (← links)
- Model checking duration calculus: a practical approach (Q939170) (← links)
- When are timed automata weakly timed bisimilar to time Petri nets? (Q944375) (← links)
- Automatic generation of path conditions for concurrent timed systems (Q947796) (← links)
- Models and formal verification of multiprocessor system-on-chips (Q953526) (← links)
- Verification of qualitative \(\mathbb Z\) constraints (Q959820) (← links)
- A process algebraic framework for specification and validation of real-time systems (Q968306) (← links)
- Detecting synchronisation of biological oscillators by model checking (Q969176) (← links)
- Hybrid automata, reachability, and systems biology (Q969180) (← links)
- Model checking memoryful linear-time logics over one-counter automata (Q974117) (← links)
- Model checking mobile stochastic logic (Q995465) (← links)