Pages that link to "Item:Q1327398"
From MaRDI portal
The following pages link to Symbolic model checking for real-time systems (Q1327398):
Displayed 50 items.
- Symbolic synthesis of masking fault-tolerant distributed programs (Q1938357) (← links)
- Model-checking timed automata with deadlines with Uppaal (Q1941900) (← links)
- Superposition as a decision procedure for timed automata (Q1949086) (← links)
- Modal event-clock specifications for timed component-based design (Q1951603) (← links)
- Discrete-time control for rectangular hybrid automata (Q1960531) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- Zone-based verification of timed automata: extrapolations, simulations and what next? (Q2112098) (← links)
- Computing branching distances with quantitative games (Q2210522) (← links)
- Model checking for probabilistic timed automata (Q2248072) (← links)
- On the expressiveness of TPTL and MTL (Q2266987) (← links)
- Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques (Q2343139) (← links)
- The complexity of automated addition of fault-tolerance without explicit legitimate states (Q2355327) (← links)
- Scheduling with timed automata (Q2368955) (← links)
- Efficient timed model checking for discrete-time systems (Q2368994) (← links)
- Symbolic model checking for probabilistic timed automata (Q2373877) (← links)
- Schedulability of asynchronous real-time concurrent objects (Q2390036) (← links)
- Dealing with practical limitations of distributed timed model checking for timed automata (Q2431767) (← links)
- Analysis of meeting protocols by formalisation, simulation, and verification (Q2463822) (← links)
- A contribution to the validation of grafcet controlled systems (Q2512110) (← links)
- Verifying untimed and timed aspects of the experimental batch plant (Q2512162) (← 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)
- Polynomial interrupt timed automata: verification and expressiveness (Q2662502) (← links)
- Timed Semantics of Message Sequence Charts Based on Timed Automata (Q2842583) (← links)
- Modular Synthesis of Timed Circuits using Partial Orders on LPNs (Q2842584) (← links)
- Predicate Abstraction for Dense Real-Time Systems1 1This research was supported by the National Science Foundation under grants CCR-00-82560 and CCR-00-86096 and by NASA Langley Research Center under contract B09060051 and Cooperative Agreement NCC-1-399 (Q2842588) (← links)
- Classes of Timed Automata and the Undecidability of Universality (Q2842589) (← links)
- Timed CSP = Closed Timed Automata1 (Q2842610) (← links)
- (Q2842866) (← links)
- (Q2842869) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- Tropical Fourier–Motzkin elimination, with an application to real-time verification (Q2923336) (← links)
- Nested Timed Automata with Frozen Clocks (Q2945595) (← links)
- Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems (Q2948229) (← links)
- Statistical Verification of Probabilistic Properties with Unbounded Until (Q2999315) (← links)
- VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES (Q3021942) (← links)
- THE EXISTENCE OF ω-CHAINS FOR TRANSITIVE MIXED LINEAR RELATIONS AND ITS APPLICATIONS (Q3021995) (← links)
- Performance Evaluation of Schedulers in a Probabilistic Setting (Q3172839) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Model Checking Real-Time Systems (Q3176387) (← links)
- Strict Divergence for Probabilistic Timed Automata (Q3184704) (← links)
- Time-Progress Evaluation for Dense-Time Automata with Concave Path Conditions (Q3540075) (← links)
- A Compositional Translation of Timed Automata with Deadlines to Uppaal Timed Automata (Q3648831) (← links)
- Stochastic Games for Verification of Probabilistic Timed Automata (Q3648833) (← links)
- Discrete-time control for rectangular hybrid automata (Q4571988) (← links)
- Hybrid automata with finite bisimulations (Q4645189) (← links)
- The expressive power of clocks (Q4645197) (← links)
- Automatic synthesis of real time systems (Q4645208) (← links)
- What’s Decidable About Parametric Timed Automata? (Q4686606) (← links)