Pages that link to "Item:Q5705876"

The following pages link to Foundations of Software Science and Computational Structures (Q5705876):

Displaying 22 items.

• A game-theoretic approach to fault diagnosis and identification of hybrid systems (Q391104) (← links)
• Conformance testing for real-time systems (Q842583) (← links)
• Estimating the latent time of fault detection in finite automaton tested in real time (Q1003066) (← links)
• Symbolic synthesis of masking fault-tolerant distributed programs (Q1938357) (← links)
• A game approach to determinize timed automata (Q2018058) (← links)
• Fault localization of timed automata using maximum satisfiability (Q2026559) (← links)
• Failure detection and localization for timed event graphs in \((\max,+)\)-algebra (Q2063096) (← links)
• Detectability of labeled weighted automata over monoids (Q2081085) (← links)
• Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems (Q2348371) (← links)
• The complexity of automated addition of fault-tolerance without explicit legitimate states (Q2355327) (← links)
• A brief account of runtime verification (Q2390027) (← links)
• Diagnosability of delay-deadline failures in fair real time discrete event models (Q3161644) (← links)
• (Q4804897) (← links)
• (Q5089309) (← links)
• (Q5094137) (← links)
• Fault diagnosis in discrete-event systems: incorporating timing information (Q5274106) (← links)
• The On-Line Diagnosis of Time Petri Nets (Q5496935) (← links)
• Automated repair for timed systems (Q6108434) (← links)
• Diagnosis of timed patterns for discrete event systems by means of state isolation (Q6110300) (← links)
• Probabilistic verification of diagnosability for a certain class of timed stochastic systems (Q6174049) (← links)
• Diagnosability of fault patterns with labeled stochastic Petri nets (Q6190046) (← links)
• Diagnosability of labeled \(\mathfrak{D}_{\mathfrak{p}}\)-automata (Q6614006) (← links)