The following pages link to A theory of timed automata (Q1322162):
Displaying 50 items.
- Applications of an expressive statistical model checking approach to the analysis of genetic circuits (Q498908) (← links)
- Finding minimum and maximum termination time of timed automata models with cyclic behaviour (Q507600) (← links)
- On parametric timed automata and one-counter machines (Q515666) (← links)
- Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata (Q517046) (← links)
- Compositional schedulability analysis of real-time actor-based systems (Q530212) (← links)
- Linear logic as a tool for planning under temporal uncertainty (Q534715) (← links)
- Model checking weighted integer reset timed automata (Q537908) (← links)
- A contract-based approach to adaptivity (Q541295) (← links)
- MSO logics for weighted timed automata (Q548692) (← links)
- Timed modal logics for real-time systems. Specification, verification and control (Q548704) (← links)
- The efficiency of identifying timed automata and the power of clocks (Q553334) (← links)
- 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)
- A Kleene-Schützenberger theorem for weighted timed automata (Q631775) (← links)
- Scenario-based verification of real-time systems using UPPAAL (Q633291) (← links)
- Weighted o-minimal hybrid systems (Q636266) (← links)
- Automata and logics over finitely varying functions (Q636272) (← links)
- Hardness of preorder checking for basic formalisms (Q650916) (← links)
- Efficient verification of distributed real-time systems with broadcasting behaviors (Q656082) (← links)
- Supervisory controller design to enforce some basic properties in timed-transition Petri nets using stretching (Q665122) (← 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)
- On timed alternating simulation for concurrent timed games (Q715043) (← links)
- Counting and generating permutations in regular classes (Q727971) (← links)
- A logical characterization of timed regular languages (Q728264) (← links)
- Robustness of temporal logic specifications for continuous-time signals (Q732015) (← links)
- Time-budgeting: a component based development methodology for real-time embedded systems (Q736795) (← links)
- Towards verification of computation orchestration (Q736807) (← links)
- Continuous KAOS, ASM, and formal control system design across the continuous/discrete modeling interface: a simple train stopping application (Q736916) (← links)
- Verification of continuous dynamical systems by timed automata (Q763240) (← links)
- Using formal verification to evaluate the execution time of Spark applications (Q782497) (← 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)
- Timed hyperproperties (Q821560) (← links)
- Spotlight abstraction in model checking real-time task schedulability (Q832017) (← links)
- On the complexity of timed pattern matching (Q832025) (← links)
- An integer static analysis for better extrapolation in Uppaal (Q832038) (← links)
- Tweaking the odds in probabilistic timed automata (Q832050) (← links)
- \textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability (Q832203) (← links)
- Fast zone-based algorithms for reachability in pushdown timed automata (Q832208) (← links)
