Synthesizing robust systems

Bloem, Roderick; Chatterjee, Krishnendu; Greimel, Karin; Henzinger, Thomas A.; Hofferek, Georg; Jobstmann, Barbara; Könighofer, Bettina; Könighofer, Robert

doi:10.1007/s00236-013-0191-5

Cited by 73 publications

(86 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A system is said to be robust if small disturbances of the environment can cause only small system errors, which corresponds as well with the definition of graceful degradation in classical fault tolerance [5]. Robustness has been discussed in relation to predictability as two "universal challenges" of embedded systems design [16], even if they are seldom addressed together.…”

Section: Introductionmentioning

confidence: 93%

See 1 more Smart Citation

Synthesizing time-triggered schedules for switched networks with faulty links

Avni

Guha

Rodríguez-Navas

2016

Proceedings of the 13th International Conference on Embedded Software

View full text Add to dashboard Cite

Time-triggered (TT) switched networks are a deterministic communication infrastructure used by real-time distributed embedded systems. These networks rely on the notion of globally discretized time (i.e. time slots) and a static TT schedule that prescribes which message is sent through which link at every time slot, such that all messages reach their destination before a global timeout. These schedules are generated offline, assuming a static network with fault-free links, and entrusting all error-handling functions to the end user. Assuming the network is static is an over-optimistic view, and indeed links tend to fail in practice. We study synthesis of TT schedules on a network in which links fail over time and we assume the switches run a very simple error-recovery protocol once they detect a crashed link. We address the problem of finding a pk, qresistant schedule; namely, one that, assuming the switches run a fixed error-recovery protocol, guarantees that the number of messages that arrive at their destination by the timeout is at least , no matter what sequence of at most k links fail. Thus, we maintain the simplicity of the switches while giving a guarantee on the number of messages that meet the timeout. We show how a pk, q-resistant schedule can be obtained using a CEGAR-like approach: find a schedule, decide whether it is pk, q-resistant, and if it is not, use the witnessing fault sequence to generate a constraint that is added to the program. The newly added constraint disallows the schedule to be regenerated in a future iteration while also eliminating several other schedules that are not pk, q-resistant. We illustrate the applicability of our approach using an SMT-based implementation.

show abstract

Section: Introductionmentioning

confidence: 93%

“…Robustness has been discussed in relation to predictability as two "universal challenges" of embedded systems design [16], even if they are seldom addressed together. Our definition of pk, qresistant schedule can be interpreted as a variation of the notion of k-robustness introduced in [5].…”

Section: Introductionmentioning

confidence: 99%

Synthesizing time-triggered schedules for switched networks with faulty links

Avni

Guha

Rodríguez-Navas

2016

Proceedings of the 13th International Conference on Embedded Software

View full text Add to dashboard Cite

show abstract

“…The new delays are computed relatively to v. The construction works for any order on transitions, possibly yielding different deterministic automata 7 .…”

Section: Determinizability Problemmentioning

confidence: 99%

Quantitative Languages Defined by Functional Automata

Filiot

Gentilini

Raskin

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. A weighted automaton is functional if any two accepting runs on the same finite word have the same value. In this paper, we investigate functional weighted automata for four different measures: the sum, the mean, the discounted sum of weights along edges and the ratio between rewards and costs. On the positive side, we show that functionality is decidable for the four measures. Furthermore, the existential and universal threshold problems, the language inclusion problem and the equivalence problem are all decidable when the weighted automata are functional. On the negative side, we also study the quantitative extension of the realizability problem and show that it is undecidable for sum, mean and ratio. We finally show how to decide whether the language associated with a given functional automaton can be defined with a deterministic one, for sum, mean and discounted sum. The results on functionality and determinizability are expressed for the more general class of functional group automata. This allows one to formulate within the same framework new results related to discounted sum automata and known results on sum and mean automata. Ratio automata do not fit within this general scheme and different techniques are required to decide functionality.

show abstract

“…discrete changes of states, an essential part of our algorithm. Another extension of MPGs with dual-cost was studied in [7].…”

Section: Weighted Mean Payoff Gamesmentioning

confidence: 99%

Dual-Priced Modal Transition Systems with Time Durations

Beneš

Křetínský

Larsen

et al. 2012

Logic for Programming, Artificial Intelligence, and Reasoning

View full text Add to dashboard Cite

Modal transition systems are a well-established specification formalism for a highlevel modelling of component-based software systems. We present a novel extension of the formalism called modal transition systems with durations where time durations are modelled as controllable or uncontrollable intervals. We further equip the model with two kinds of quantitative aspects: each action has its own running cost per time unit, and actions may require several hardware components of different costs. We ask the question, given a fixed budget for the hardware components, what is the implementation with the cheapest long-run average reward. We give an algorithm for computing such optimal implementations via a reduction to a new extension of mean payoff games with time durations and analyse the complexity of the algorithm.

show abstract

Synthesizing robust systems

Cited by 73 publications

References 44 publications

Synthesizing time-triggered schedules for switched networks with faulty links

Synthesizing time-triggered schedules for switched networks with faulty links

Quantitative Languages Defined by Functional Automata

Dual-Priced Modal Transition Systems with Time Durations

Contact Info

Product

Resources

About