Synthesizing time-triggered schedules for switched networks with faulty links

Proceedings of the 13th International Conference on Embedded Software, EMSOFT 2016

Volumn , Issue , 2016, Pages

  Avni, Guy ^a   Guha, Shibashis ^b   Rodriguez Navas, Guillermo ^c  

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c MÄLARDALEN UNIVERSITY   (Sweden)

Author keywords

Fault tolerance; Real time communication; Satisfiability Modulo Theory; Scheduling

Indexed keywords

COMPUTER SYSTEM RECOVERY; EMBEDDED SOFTWARE; EMBEDDED SYSTEMS; ERRORS; FAULT TOLERANCE; SCHEDULING; SWITCHING NETWORKS; TIME SWITCHES;

DETERMINISTIC COMMUNICATIONS; DISTRIBUTED EMBEDDED SYSTEM; ERROR HANDLING; FAULT SEQUENCES; REAL-TIME COMMUNICATION; SATISFIABILITY MODULO THEORIES; STATIC NETWORKS; TIME TRIGGERED;

REAL TIME SYSTEMS;

EID: 84995467161     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2968478.2968499     Document Type: Conference Paper

References (29)

1. S. Almagor, U. Boker, and O. Kupferman. Formalizing and reasoning about quality. To appear in J.ACM, 2016.
2. G. Avni, O. Kupferman, and T. Tamir. Congestion games with multisets of resources and applications in synthesis. In Proc. 35th FSTTCS, pp. 365-379, 2015.
3. G. Bauer and H. Kopetz. Transparent redundancy in the time-triggered architecture. In Proc. 1st DSN, pp. 5-13. IEEE, 2000.
4. A. Biewer, J. Gladigau, and C. Haubelt. Towards Tight Interaction of ASP and SMT Solving for System-Level Decision Making. In Proc. 27th ARCS, pp. 1-7. VDE, 2014.
5. R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, G. Hofferek, B. Jobstmann, B. Könighofer, and R. Könighofer. Synthesizing robust systems. Acta Informatica, 51(3-4):193-220, 2014.
6. U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman. Temporal specifications with accumulative values. In Proc. 26th LICS, pp. 43-52, 2011.
7. P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey, and J. Srba. Infinite runs in weighted timed automata with energy constraints. In Proc. 6th FORMATS, pp. 33-47, 2008.
8. T. Brihaye, G. Geeraerts, A. Haddad, B. Monmege, G. A. Pérez, and G. Renault. Quantitative games under failures. In Proc. 35th FSTTCS, pp. 293-306, 2015.
9. N. Budhiraja, K. Marzullo, F. B. Schneider, and S. Toueg. Distributed systems (2nd ed.). chapter The Primary-backup Approach, pp. 199-216, 1993.
10. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement for symbolic model checking. J. ACM, 50(5):752-794, 2003.
11. S. S. Craciunas and R. S. Oliver. SMT-based Task-and Network-level Static Schedule Generation for Time-Triggered Networked Systems. In Proc. 22nd RTNS, page 45, 2014.
12. S. S. Craciunas and R. S. Oliver. Combined task- and network-level scheduling for distributed time-triggered systems. Real-Time Systems, 52(2):161-200, 2016.
13. L. De Moura and N. Bjorner. Z3: An efficient smt solver. In Proc. 14th TACAS, pp. 337-340, 2008.
14. D. Goswami, M. Lukasiewycz, R. Schneider, and S. Chakraborty. Time-Triggered Implementations of Mixed-Criticality Automotive Software. In Proc. DATE, pp. 1227-1232, 2012.
15. A. A. Hagberg, D. A. Schult, and P. J. Swart. Exploring network structure, dynamics, and function using NetworkX. In Proc. 7th SciPy, pp. 11-15, 2008.
16. T. A. Henzinger. Two challenges in embedded systems design: predictability and robustness. Phil. Trans. R. Soc. A, 366(1881):3727-3736, 2008.
17. T. A. Henzinger. From boolean to quantitative notions of correctness. In Proc. 37th POPL, pp. 157-158, 2010.
18. J. Huang, J. O. Blech, A. Raabe, C. Buckl, and A. Knoll. Static Scheduling of a Time-Triggered Network-on-Chip based on SMT Solving. In Proc. DATE, pp. 509-514, 2012.
19. H. Kopetz, M. Braun, C. Ebner, A. Kruger, D. Millinger, R. Nossal, and A. Schedl. The Design of Large Real-Time Systems: the Time-Triggered Approach. In Proc. 16th RTSS, pp. 182-187, 1995.
20. D. Kreutz, F. M. Ramos, P. Esteves Verissimo, C. Esteve Rothenberg, S. Azodolmolky, and S. Uhlig. Software-defined networking: A comprehensive survey. Proc. of the IEEE, 103(1):14-76, 2015.
21. V. Liu, D. Halperin, A. Krishnamurthy, and T. Anderson. F10: A fault-tolerant engineered network. In Proc. 10th NSDI, pp. 399-412, 2013.
22. C. Löding and P. Rohde. Solving the sabotage game is pspace-hard. In Proc. 28th MFCS, pp. 531-540, 2003.
23. F. Pozo, W. Steiner, G. Rodriguez-Navas, and H. Hansson. A Decomposition Approach for SMT-based Synthesis for Time-Triggered Networks. In Proc. 20th ETFA, pp. 1-8. IEEE, 2015.
24. M. Reitblatt, M. Canini, A. Guha, and N. Foster. Fattire: declarative fault tolerance for software-defined networks. In Proc. 2nd HotSDN, pp. 109-114, 2013.
25. K. Schild and J. W'rtz. Scheduling of Time-Triggered Real-Time Systems. Constraints, 5(4):335-357, 2000.
26. W. Steiner. An Evaluation of SMT-based Schedule Synthesis for Time-Triggered Multi-Hop Networks. In Proc. 31st RTSS, pp. 375-384. IEEE, 2010.
27. W. Steiner, F. Bonomi, and H. Kopetz. Towards synchronous deterministic channels for the internet of things. In Proc. WF-IoT, pp. 433-436. IEEE, 2014.
28. J. van Benthem. An essay on sabotage and obstruction. In Mechanizing Mathematical Reasoning, Essays in Honor of Jörg H. Siekmann on the Occasion of His 60th Birthday, pp. 268-276, 2005.
29. Y. Wei and D.-S. Kim. Exploiting real-time switched ethernet for enhanced network recovery scheme in naval combat system. In Proc. ICTC, pp. 595-600. IEEE, 2014.