Abstract
The traditional research on scheduling focuses on task scheduling and schedulability analysis in concurrent reactive systems. In this article, we dedicate ourselves to event-based scheduling. We first formally define an event-based scheduling policy and propose the notion of the correctness of a scheduling policy in terms of weak termination. Then we investigate the correctness of the decomposition of scheduling controls and finally obtain a decentralized scheduling method. The method can automatically decompose the scheduling policies of a concurrent reactive system into atomic scheduling policies. Every atomic scheduling policy corresponds to one subsystem. Each of the subsystems is a completely independent system, which may be developed and deployed independently. An experiment demonstrates these results that may help engineers to design correct and efficient schedule policies for a concurrent reactive system.
- Tilak Agerwala and Mike Flynn. 1973. Comments on capabilities, limitations and correctness of Petri nets. Computer Architecture News 2, 4, 81--86. DOI:http://dx.doi.org/10.1145/633642.803973 Google Scholar
Digital Library
- Madhukar Anand, Sebastian Fischmeister, and Insup Lee. 2013. A comparison of compositional schedulability analysis techniques for hierarchical real-time systems. ACM Transactions on Embedded Computing Systems 13, 1, 2. DOI:http://dx.doi.org/10.1145/2501626.2501629 Google Scholar
Digital Library
- Neil C. Audsley, Alan Burns, and Andy J. Wellings. 1993. Deadline monotonic scheduling theory and application. Control Engineering Practice 1, 1, 71--78. DOI:http://dx.doi.org/10.1016/0967-0661(93)92105-DGoogle Scholar
Cross Ref
- Paolo Baldan, Nadia Busi, Andrea Corradini, and G. Michele Pinna. 2004. Domain and event structure semantics for Petri nets with read and inhibitor arcs. Theoretical Computer Science 323, 1--3, 129--189. DOI:http://dx.doi.org/10.1016/j.tcs.2004.04.001 Google Scholar
Digital Library
- Simon Bliudze and Joseph Sifakis. 2007. The algebra of connectors—structuring interaction in BIP. IEEE Transactions on Computers 57, 10, 1315--1330. DOI:http://dx.doi.org/10.1109/TC.2008.26 Google Scholar
Digital Library
- Tommaso Bolognesi and Ed Brinksma. 1987. Introduction to the ISO specification language LOTOS. Computer Networks and ISDN Systems—Special Issue: Protocol Specification and Testing 14, 1, 25--59. DOI:http://dx.doi.org/10.1016/0169-7552(87)90085-7 Google Scholar
Digital Library
- Daniel Brand and Pitro Zafiropulo. 1983. On communicating finite-state machines. Journal of the ACM 30, 2, 323--342. DOI:http://dx.doi.org/10.1145/322374.322380 Google Scholar
Digital Library
- Marius C. Bujorianu, Manuela L. Bujorianu, and Howard Barringer. 2009. A unifying specification logic for cyber-physical systems. In Proceedings of the 17th Mediterranean Conference on Control and Automation (MED’09). IEEE, Los Alamitos, CA, 1166--1171. DOI:http://dx.doi.org/10.1109/MED.2009.5164704 Google Scholar
Digital Library
- Alessandro Coraiola and Marko Antscher. 2000. GSM-R network for the high speed line Rome-Naples. Signal and Draht 92, 5, 42--45.Google Scholar
- Luca de Alfaro and Thomas A. Henzinger. 2001. Interface automata. In Proceedings of the Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE’01). ACM, New York, NY, 109--120. DOI:http://dx.doi.org/10.1145/503271.503226 Google Scholar
Digital Library
- Gero Decker and Mathias Weske. 2007. Local enforceability in interaction Petri nets. In Business Process Management. Lecture Notes in Computer Science, Vol. 4714. Springer, 305--319. DOI:http://dx.doi.org/10.1007/978-3-540-75183-0_22 Google Scholar
Digital Library
- Hairong Dong, Bin Ning, Baigen Cai, and Zhongsheng Hou. 2010. Automatic train control system development and simulation for high-speed railways. IEEE Circuits and Systems Magazine 10, 2, 6--18. DOI:http://dx.doi.org/10.1109/MCAS.2010.936782 Google Scholar
Digital Library
- Vineet Gupta. 2005. Concurrent Kripke Structures. Cornell Technical Report CS-TR-93-1369. Stanford University, Stanford, CA. Retrieved August 2, 2015, from http://boole.stanford.edu/pub/cks.pdf.Google Scholar
- Matthew Hennessy and Huimin Lin. 1995. Symbolic bisimulations. Theoretical Computer Science 138, 2, 353--389. DOI:http://dx.doi.org/10.1016/0304-3975(94)00172-F Google Scholar
Digital Library
- Tony Hoare. 1978. Communicating sequential processes. Communications of the ACM 21, 8, 666--677. DOI:http://dx.doi.org/10.1145/359576.359585 Google Scholar
Digital Library
- Marija D. Ilić, Le Xie, Usman A. Khan, and José M. F. Moura. 2008. Modeling future cyber-physical energy systems. In Proceedings of the Power and Energy Society General Meeting—Conversion and Delivery of Electrical Energy in the 21st Century. IEEE, Los Alamitos, CA, 1--9. DOI:http://dx.doi.org/10.1109/PES.2008.4596708Google Scholar
- Jianmin Jiang, Shi Zhang, Ping Gong, and Zhong Hong. 2011. Message dependency-based adaptation of services. In Proceedings of the 2011 IEEE Asia-Pacific Services Computing Conference. IEEE, Los Alamitos, CA, 442--449. DOI:http://dx.doi.org/10.1109/APSCC.2011.81Google Scholar
Cross Ref
- Jianmin Jiang, Shi Zhang, Ping Gong, and Zhong Hong. 2013. Configuring business process models. ACM SIGSOFT Software Engineering Notes 38, 4, 1--10. DOI:http://dx.doi.org/10.1145/2492248.2492267 Google Scholar
Digital Library
- Jianmin Jiang, Shi Zhang, Ping Gong, Zhong Hong, and HouGuang Yue. 2012. Modeling and analyzing mixed communications in service-oriented trustworthy software. Science China Information Sciences 55, 12, 2738--2756. DOI:http://dx.doi.org/10.1007/s11432-012-4744-yGoogle Scholar
Cross Ref
- Jianmin Jiang, Huibiao Zhu, Qin Li, Shi Zhang, Ping Gong, and Zhong Hong. 2014. Configuration of services based on virtualization. In Proceedings of the 8th Theoretical Aspects of Software Engineering Conference. IEEE, Los Alamitos, CA, 177--184. DOI:http://dx.doi.org/10.1109/TASE.2014.28 Google Scholar
Digital Library
- Eun-Young Kang and Pierre-Yves Schobbens. 2014. Schedulability analysis support for automotive systems: From requirement to implementation. In Proceedings of the 29th Annual ACM Symposium on Applied Computing. ACM, New York, NY, 1080--1085. DOI:http://dx.doi.org/10.1145/2554850.2554929 Google Scholar
Digital Library
- Kyoung-Dae Kim and P. R. Kumar. 2012. Cyber-physical systems: A perspective at the centennial. Proceedings of the IEEE 100, 1, 1287--1308. DOI:http://dx.doi.org/10.1109/JPROC.2012.2189792Google Scholar
Cross Ref
- Ivan Lanese, Luca Bedogni, and Marco Di Felice. 2013. Internet of Things: A process calculus approach. In Proceedings of the 28th Symposium on Applied Computing. ACM, New York, NY, 1339--1346. DOI:http://dx.doi.org/10.1145/2480362.2480615 Google Scholar
Digital Library
- Qiao Li. 2012. Scheduling in Cyber-Physical Systems. Retrieved February 28, 2015, from http://repository.cmu.edu/dissertations/91.Google Scholar
- Qiao Li and R. Negi. 2012. Maximal scheduling in wireless ad hoc networks with hypergraph interference models. IEEE Transactions on Vehicular Technology 61, 1, 297--310. DOI:http://dx.doi.org/10.1109/TVT.2011.2176520Google Scholar
Cross Ref
- Chung Laung Liu and James W. Layland. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM 20, 1, 46--61. DOI:http://dx.doi.org/10.1145/321738.321743 Google Scholar
Digital Library
- David C. Luckham, James Vera, Doug Bryan, Larry Augustin, Frank Belz, and Larry M. Augustin. 1993. Partial orderings of event sets and their application to prototyping concurrent, timed systems. Journal of Systems and Software 21, 3, 253--265. DOI:http://dx.doi.org/10.1016/0164-1212(93)90027-U Google Scholar
Digital Library
- Nancy A. Lynch and Mark R. Tuttle. 1987. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing. ACM, New York, NY, 137--151. DOI:http://dx.doi.org/10.1145/41840.41852 Google Scholar
Digital Library
- Olivier Maréchal, Pascal Poizat, and Jean-Claude Royer. 2004. Checking asynchronously communicating components using symbolic transition systems. In On the Move to Meaningful Internet Systems 2004: CooplS, DOA, and ODBASE. Lecture Notes in Computer Science, Vol. 3291. Springer, 1502--1519. DOI:http://dx.doi.org/10.1007/978-3-540-30469-2_42Google Scholar
- Robin Milner. 1982. A Calculus of Communicating Systems. Springer-Verlag, New York, NY. Google Scholar
Digital Library
- Robin Milner, Joachim Parrow, and David Walker. 1992. A calculus of mobile processes. Information and Computation 100, 1, 1--40. DOI:http://dx.doi.org/10.1016/0890-5401(92)90008-4 Google Scholar
Digital Library
- Tadao Murata. 1989. Petri nets: Properties, analysis, and applications. Proceedings of the IEEE 77, 4, 541--580. DOI:http://dx.doi.org/10.1109/5.24143Google Scholar
Cross Ref
- Karsten Schmidt. 2005. Controllability of open workflow nets. In EMISA. LNI, Bonner Kollen Verlag, 236--249.Google Scholar
- Lee Schruben. 1983. Simulation modeling with event graphs. Communications of the ACM 26, 11, 957--963. DOI:http://dx.doi.org/10.1145/182.358460 Google Scholar
Digital Library
- John A. Stankovic, Marco Spuri, Krithi Ramamritham, and Giorgio Buttazzo. 1998. Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms. Springer. DOI:http://dx.doi.org/10.1007/978-1-4615-5535-3 Google Scholar
Digital Library
- Carolyn Talcott. 2008. Cyber-physical systems and events. In Software-Intensive Systems and New Computing Paradigms. Lecture Notes in Computer Science, Vol. 5380. Springer, Berlin, 101--115. DOI:http://dx.doi.org/10.1007/978-3-540-89437-7_6 Google Scholar
Digital Library
- Ying Tan, Mehmet C. Vuran, and Steve Goddard. 2009. Spatio-temporal event model for cyber-physical systems. In Proceedings of the International Conference on Distributed Computing Systems (ICDCS’09) Workshops on Cyber-Physical Systems. IEEE, Los Alamitos, CA, 44--50. DOI:http://dx.doi.org/10.1109/ICDCSW.2009.82 Google Scholar
Digital Library
- Ying Tan, Mehmet C. Vuran, Steve Goddard, Yue Yu, Miao Song, and Shangping Ren. 2010. A concept lattice-based event model for cyber-physical systems. In Proceedings of the 1st ACM/IEEE International Conference on Cyber-Physical Systems. ACM, New York, NY, 50--60. DOI:http://dx.doi.org/10.1145/1795194.1795202 Google Scholar
Digital Library
- Qinghui Tang, Sandeep K. S. Gupta, and Georgios Varsamopoulos. 2012. A unified methodology for scheduling in distributed cyber-physical systems. ACM Transactions on Embedded Computing Systems—Special Section on CAPA’09, Special Section on WHS’09, and Special Section VCPSS’09 11, S2, Article No. 57. DOI:http://dx.doi.org/10.1145/2331147.2331167 Google Scholar
Digital Library
- Rob J. van Glabbeeka and Gordon D. Plotkin. 1995. Configuration structures. In Proceedings of the 10th Annual IEEE Symposium on Logics in Computer Science (LICS’95). IEEE, Los Alamitos, CA, 199--209. DOI:http://dx.doi.org/10.1109/LICS.1995.523257 Google Scholar
Digital Library
- Rob J. van Glabbeeka and Gordon D. Plotkin. 2009. Configuration structures, event structures and Petri nets. Theoretical Computer Science 410, 41, 4111--4159. DOI:http://dx.doi.org/10.1016/j.tcs.2009.06.014 Google Scholar
Digital Library
- Haifeng Wang, Felix Schmid, Lei Chen, Clive Roberts, and Tianhua Xu. 2013. A topology-based model for railway train control systems. IEEE Transactions on Intelligent Transportation Systems 14, 2, 819--827. DOI:http://dx.doi.org/10.1109/TITS.2012.2237509 Google Scholar
Digital Library
- Glynn Winskel and Mogens Nielsen. 1995. Models for Concurrency. Handbook of Logic in Computer Science, Semantic Modelling, Vol. 4. Oxford Science Publications, Oxford. Google Scholar
Digital Library
- Daniel M. Yellin and Robert E. Strom. 1997. Protocol specifications and component adaptors. Transactions on Programming Languages and Systems 19, 2, 292--333. DOI:http://dx.doi.org/10.1145/244795.244801 Google Scholar
Digital Library
- Fumin Zhang, Klementyna Szwaykowska, Wayne Wolf, and Vincent Mooney. 2008. Task scheduling for control oriented requirements for cyber-physical systems. In Proceedings of the Real-Time Systems Symposium. IEEE, Los Alamitos, CA, 47--56. DOI:http://dx.doi.org/10.1109/RTSS.2008.52 Google Scholar
Digital Library
Index Terms
Analyzing Event-Based Scheduling in Concurrent Reactive Systems
Recommendations
Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
In this paper, we consider the problem of scheduling n deteriorating jobs with release dates on a single (batching) machine. Each job's processing time is a simple linear function of its starting time. The objective is to minimize the maximum lateness. ...
Concurrent open shop scheduling to minimize the weighted number of tardy jobs
We consider a relaxed version of the open shop scheduling problem--the "concurrent open shop" scheduling problem, in which any two operations of the same job on distinct machines are allowed to be processed concurrently. The completion time of a job is ...
Semi-online Multiprocessor Scheduling with Nonsimultaneous Machine Available Times
ICIC '10: Proceedings of the 2010 Third International Conference on Information and Computing - Volume 03This paper investigates scheduling problems on parallel identical machines with non-simultaneous machine available times. Each machine is not available until time. Jobs arrive one by one, and we are required to schedule jobs irrevocably on machines as ...






Comments