The following pages link to Kronos (Q14010):
Displaying 50 items.
- Timed recursive state machines: expressiveness and complexity (Q264999) (← links)
- Rewriting modulo SMT and open system analysis (Q347384) (← links)
- A survey of timed automata for the development of real-time systems (Q394966) (← 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)
- Robust reachability in timed automata and games: a game-based approach (Q481098) (← links)
- On regions and zones for event-clock automata (Q487253) (← links)
- A formal approach to the WCRT analysis of multicore systems with memory contention under phase-structured task sets (Q488240) (← links)
- Finding minimum and maximum termination time of timed automata models with cyclic behaviour (Q507600) (← links)
- Model checking weighted integer reset timed automata (Q537908) (← links)
- Timed modal logics for real-time systems. Specification, verification and control (Q548704) (← links)
- SetExp: a method of transformation of timed automata into finite state automata (Q601048) (← links)
- Learning of event-recording automata (Q604474) (← links)
- A Kleene-Schützenberger theorem for weighted timed automata (Q631775) (← links)
- Scenario-based verification of real-time systems using UPPAAL (Q633291) (← links)
- Efficient verification of distributed real-time systems with broadcasting behaviors (Q656082) (← links)
- Reachability results for timed automata with unbounded data structures (Q707597) (← 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)
- Explaining safety violations in real-time systems (Q832041) (← links)
- Conformance testing for real-time systems (Q842583) (← links)
- Verifying distributed real-time properties of embedded systems via graph transformations and model checking (Q853626) (← links)
- On using priced timed automata to achieve optimal scheduling (Q853729) (← 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)
- Model checking of time Petri nets using the state class timed automaton (Q859736) (← links)
- Specification and analysis of the AER/NCA active network protocol suite in real-time Maude (Q862853) (← links)
- Axiomatisation and decidability of multi-dimensional Duration Calculus (Q868026) (← links)
- Hybridization methods for the analysis of nonlinear systems (Q868432) (← links)
- Semantics and pragmatics of real-time maude (Q880982) (← links)
- Cost-related interface for software product lines (Q898616) (← links)
- Timed discrete event control of parallel production lines with continuous outputs (Q939012) (← links)
- When are timed automata weakly timed bisimilar to time Petri nets? (Q944375) (← links)
- Design and verification of long-running transactions in a timed framework (Q955710) (← links)
- Detecting synchronisation of biological oscillators by model checking (Q969176) (← links)
- Hybrid automata, reachability, and systems biology (Q969180) (← links)
- Implementation and analysis of real-time communication protocol compositions (Q995821) (← links)
- Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude (Q1004068) (← links)
- M-nets: a survey (Q1006339) (← links)
- Timed verification of the generic architecture of a memory circuit using parametric timed automata (Q1028737) (← links)
- Hybrid systems: From verification to falsification by combining motion planning and discrete search (Q1039839) (← links)
- A quadratic-time DBM-based successor algorithm for checking timed automata (Q1044715) (← links)
- Event-clock automata: a determinizable class of timed automata (Q1274452) (← links)
- Verification of logic controllers for continuous plants using timed condition/event-system models (Q1301427) (← links)
- A compared study of two correctness proofs for the standardized algorithm of ABR conformance (Q1395676) (← links)
