The following pages link to A theory of timed automata (Q1322162):
Displayed 50 items.
- A new model for model checking: cycle-weighted Kripke structure (Q351985) (← links)
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Automata-theoretic decision of timed games (Q386611) (← links)
- Robust synthesis for real-time systems (Q386617) (← links)
- Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems (Q388224) (← links)
- A game-theoretic approach to fault diagnosis and identification of hybrid systems (Q391104) (← links)
- Similarity in languages and programs (Q391201) (← links)
- A survey of timed automata for the development of real-time systems (Q394966) (← links)
- General quantitative specification theories with modal transition systems (Q404008) (← links)
- Combined model checking for temporal, probabilistic, and real-time logics (Q407511) (← links)
- Low dimensional hybrid systems -- decidable, undecidable, don't know (Q418141) (← links)
- The sweep-line state space exploration method (Q418783) (← links)
- Efficiently identifying deterministic real-time automata from labeled data (Q420918) (← links)
- Regular set of representatives for time-constrained MSC graphs (Q436617) (← links)
- State-based scheduling with tree schedules: analysis and evaluation (Q438213) (← links)
- Model checking time-dependent system specifications using time stream Petri nets and \texttt{UPPAAL} (Q440685) (← links)
- Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets (Q442295) (← links)
- Reachability analysis for timed automata using max-plus algebra (Q444476) (← links)
- Interrupt timed automata: verification and expressiveness (Q453513) (← links)
- Efficient emptiness check for timed Büchi automata (Q453519) (← links)
- A concurrency-preserving translation from time Petri nets to networks of timed automata (Q453542) (← links)
- Control: a perspective (Q463779) (← links)
- Finite-state automata in information technologies (Q464949) (← links)
- Constraint LTL satisfiability checking without automata (Q472802) (← links)
- A succinct canonical register automaton model (Q478388) (← links)
- Learning register automata: from languages to program structures (Q479461) (← links)
- Improving active Mealy machine learning for protocol conformance testing (Q479471) (← links)
- Robust reachability in timed automata and games: a game-based approach (Q481098) (← links)
- On regions and zones for event-clock automata (Q487253) (← links)
- Runtime enforcement of timed properties revisited (Q487258) (← links)
- Parameter synthesis for hierarchical concurrent real-time systems (Q488231) (← 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)