A decomposition approach for SMT-based schedule synthesis for time-triggered networks

IEEE International Conference on Emerging Technologies and Factory Automation, ETFA

Volumn 2015-October, Issue , 2015, Pages

  Pozo, Francisco ^a   Steiner, Wilfried ^b   Rodriguez Navas, Guillermo ^a   Hansson, Hans ^a  

^a MÄLARDALEN UNIVERSITY   (Sweden)

^b TTTech   (Austria)

Author keywords

Complexity theory; Context; Context modeling; Receivers; Schedules; Spread spectrum communication; Synthesizers

Indexed keywords

COMPUTATIONAL COMPLEXITY; FACTORY AUTOMATION; RECEIVERS (CONTAINERS); SCHEDULING; SPREAD SPECTRUM COMMUNICATION;

COMMUNICATION LATENCY; COMPLEXITY THEORY; CONTEXT; CONTEXT MODELING; DECOMPOSITION APPROACH; ORDERS OF MAGNITUDE; SYNTHESIZERS; TRANSMISSION POINTS;

COMPLEX NETWORKS;

EID: 84952883901     PISSN: 19460740     EISSN: 19460759     Source Type: Conference Proceeding    
DOI: 10.1109/ETFA.2015.7301436     Document Type: Conference Paper

References (28)

1. H. Kopetz and G. Bauer, "The Time-Triggered Architecture," Proceedings of the IEEE, vol. 91, no. 1, pp. 112-126, 2003.
2. M. R. Garey and D. S. Johnson, "Computers and Intractability: a Guide to the Theory of NP-completeness. 1979," San Francisco, LA: Freeman, 1979.
3. J.-P. Watson and J. C. Beck, "A Hybrid Constraint Programming/Local Search Approach to the Job-Shop Scheduling Problem," in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Springer, 2008, pp. 263-277.
4. C. Fang and L. Wang, "An Effective Shuffled Frog-Leaping Algorithm for Resource-Constrained Project Scheduling Problem," Computers & Operations Research, vol. 39, no. 5, pp. 890-901, 2012.
5. A. Ling, D. P. Singh, and S. D. Brown, "FPGA Logic Synthesis using Quantified Boolean Satisfiability," in Theory and Applications of Satisfiability Testing. Springer, 2005, pp. 444-450.
6. L. De Moura and N. Bjørner, "Satisfiability Modulo Theories: Introduction and Applications," Communications of the ACM, vol. 54, no. 9, pp. 69-77, 2011.
7. B. Dutertre and L. De Moura, "The Yices SMT Solver," Tool paper at http://yices.csl.sri.com/tool-paper.pdf, vol. 2, p. 2, 2006.
8. L. De Moura and N. Bjørner, "Z3: An efficient SMT Solver," in Tools and Algorithms for the Construction and Analysis of Systems. Springer, 2008, pp. 337-340.
9. W. Steiner, "An Evaluation of SMT-based Schedule Synthesis for Time-Triggered Multi-Hop Networks," in Real-Time Systems Symposium (RTSS), 2010 IEEE 31st. IEEE, 2010, pp. 375-384.
10. "TTEthernet Specification," TTTech Computertechnik AG, Nov, 2008.
11. L. Cordeiro, B. Fischer, and J. Marques-Silva, "SMT-based Bounded Model Checking for Embedded ansi-c Software," Software Engineering, IEEE Transactions on, vol. 38, no. 4, pp. 957-974, 2012.
12. G. Li and G. Gopalakrishnan, "Scalable SMT-based Verification of GPU Kernel Functions," in Proceedings of the eighteenth ACM SIGSOFT international symposium on Foundations of software engineering. ACM, 2010, pp. 187-196.
13. J. Peleska, E. Vorobev, and F. Lapschies, "Automated Test Case Generation with SMT-solving and Abstract Interpretation," in NASA Formal Methods. Springer, 2011, pp. 298-312.
14. S. Gulwani, S. Jha, A. Tiwari, and R. Venkatesan, "Synthesis of Loop-Free Programs," in ACM SIGPLAN Notices, vol. 46, no. 6. ACM, 2011, pp. 62-73.
15. S. S. Craciunas and R. S. Oliver, "SMT-based Task-and Network-level Static Schedule Generation for Time-Triggered Networked Systems," in Proceedings of the 22nd International Conference on Real-Time Networks and Systems. ACM, 2014, p. 45.
16. 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 Proceedings of the Conference on Design, Automation and Test in Europe. EDA Consortium, 2012, pp. 509-514.
17. Z. Hanzálek, P. Burget, and P. Sucha, "Profinet IO IRT Message Scheduling," in Real-Time Systems, 2009. ECRTS'09. 21st Euromicro Conference on. IEEE, 2009, pp. 57-65.
18. A. Metzner, M. Franzle, C. Herde, and I. Stierand, "Scheduling Distributed Real-Time Systems by Satisfiability Checking," in Embedded and Real-Time Computing Systems and Applications, 2005. Proceedings. 11th IEEE International Conference on. IEEE, 2005, pp. 409-415.
19. L. Zhang, D. Goswami, R. Schneider, and S. Chakraborty, "Taskand Network-Level Schedule Co-synthesis of Ethernet-based Time-Triggered Systems." in ASP-DAC, 2014, pp. 119-124.
20. D. Tamas-Selicean, S. Marinescu, and P. Pop, "Analysis and Optimization of Mixed-Criticality Applications on Partitioned Distributed Architectures," 2012.
21. Y. Shin and K. Choi, "Software Synthesis through Task Decomposition by Dependency Analysis," in Computer-Aided Design, 1996. ICCAD-96. Digest of Technical Papers., 1996 IEEE/ACM International Conference on. IEEE, 1996, pp. 98-102.
22. I. Harjunkoski and I. E. Grossmann, "A Decomposition Approach for the Scheduling of a Steel Plant Production," Computers & Chemical Engineering, vol. 25, no. 11, pp. 1647-1660, 2001.
23. S. Choi and K. Wang, "Flexible Flow Shop Scheduling with Stochastic Processing Times: A Decomposition-based Approach," Computers & Industrial Engineering, vol. 63, no. 2, pp. 362-373, 2012.
24. ARINC specification 664P7, Aircraft Data Network, Part 7, Avionics Full Duplex Switched Ethernet (AFDX) Network, Aeronautical Radio Inc., 2005.
25. T. P. Baker and A. Shaw, "The Cyclic Executive Model and Ada," Real-Time Systems, vol. 1, no. 1, pp. 7-25, 1989.
26. A. K. Mok and W. Wang, "Window-Constrained Real-Time Periodic Task Scheduling," in Real-Time Systems Symposium, 2001.(RTSS 2001). Proceedings. 22nd IEEE. IEEE, 2001, pp. 15-24.
27. B. Dutertre, "Yices 2.2," in Computer Aided Verification. Springer, 2014, pp. 737-744.
28. S. Ranise and C. Tinelli, "Satisfiability Modulo Theories," Trends and Controversies-IEEE Intelligent Systems Magazine, vol. 21, no. 6, pp. 71-81, 2006.