research-article

Analyzing Event-Based Scheduling in Concurrent Reactive Systems

Authors:

Jian-Min Jiang,

Zhong HongAuthors Info & Claims

ACM Transactions on Embedded Computing Systems (TECS), Volume 14, Issue 4

Article No.: 86, Pages 1 - 27

https://doi.org/10.1145/2783438

Published: 24 September 2015 Publication History

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.

References

[1]

Tilak Agerwala and Mike Flynn. 1973. Comments on capabilities, limitations and correctness of Petri nets. Computer Architecture News 2, 4, 81--86.

Digital Library

[2]

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.

Digital Library

[3]

Neil C. Audsley, Alan Burns, and Andy J. Wellings. 1993. Deadline monotonic scheduling theory and application. Control Engineering Practice 1, 1, 71--78.

[4]

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.

Digital Library

[5]

Simon Bliudze and Joseph Sifakis. 2007. The algebra of connectors—structuring interaction in BIP. IEEE Transactions on Computers 57, 10, 1315--1330.

Digital Library

[6]

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.

Digital Library

[7]

Daniel Brand and Pitro Zafiropulo. 1983. On communicating finite-state machines. Journal of the ACM 30, 2, 323--342.

Digital Library

[8]

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.

Digital Library

[9]

Alessandro Coraiola and Marko Antscher. 2000. GSM-R network for the high speed line Rome-Naples. Signal and Draht 92, 5, 42--45.

[10]

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.

Digital Library

[11]

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.

[12]

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.

Digital Library

[13]

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.

[14]

Matthew Hennessy and Huimin Lin. 1995. Symbolic bisimulations. Theoretical Computer Science 138, 2, 353--389.

Digital Library

[15]

Tony Hoare. 1978. Communicating sequential processes. Communications of the ACM 21, 8, 666--677.

Digital Library

[16]

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.

[17]

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.

[18]

Jianmin Jiang, Shi Zhang, Ping Gong, and Zhong Hong. 2013. Configuring business process models. ACM SIGSOFT Software Engineering Notes 38, 4, 1--10.

Digital Library

[19]

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.

[20]

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.

Digital Library

[21]

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.

Digital Library

[22]

Kyoung-Dae Kim and P. R. Kumar. 2012. Cyber-physical systems: A perspective at the centennial. Proceedings of the IEEE 100, 1, 1287--1308.

[23]

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.

Digital Library

[24]

Qiao Li. 2012. Scheduling in Cyber-Physical Systems. Retrieved February 28, 2015, from http://repository.cmu.edu/dissertations/91.

[25]

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.

[26]

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.

Digital Library

[27]

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.

Digital Library

[28]

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.

Digital Library

[29]

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.

[30]

Robin Milner. 1982. A Calculus of Communicating Systems. Springer-Verlag, New York, NY.

Digital Library

[31]

Robin Milner, Joachim Parrow, and David Walker. 1992. A calculus of mobile processes. Information and Computation 100, 1, 1--40.

Digital Library

[32]

Tadao Murata. 1989. Petri nets: Properties, analysis, and applications. Proceedings of the IEEE 77, 4, 541--580.

[33]

Karsten Schmidt. 2005. Controllability of open workflow nets. In EMISA. LNI, Bonner Kollen Verlag, 236--249.

[34]

Lee Schruben. 1983. Simulation modeling with event graphs. Communications of the ACM 26, 11, 957--963.

Digital Library

[35]

John A. Stankovic, Marco Spuri, Krithi Ramamritham, and Giorgio Buttazzo. 1998. Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms. Springer.

[36]

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.

Digital Library

[37]

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.

Digital Library

[38]

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.

Digital Library

[39]

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.

Digital Library

[40]

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.

[41]

Rob J. van Glabbeeka and Gordon D. Plotkin. 2009. Configuration structures, event structures and Petri nets. Theoretical Computer Science 410, 41, 4111--4159.

Digital Library

[42]

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.

Digital Library

[43]

Glynn Winskel and Mogens Nielsen. 1995. Models for Concurrency. Handbook of Logic in Computer Science, Semantic Modelling, Vol. 4. Oxford Science Publications, Oxford.

Digital Library

[44]

Daniel M. Yellin and Robert E. Strom. 1997. Protocol specifications and component adaptors. Transactions on Programming Languages and Systems 19, 2, 292--333.

Digital Library

[45]

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.

Digital Library

Cited By

Chen CHong ZJiang J(2022)Scheduling in Real-Time Mobile SystemsACM Transactions on Embedded Computing Systems10.1145/351774721:3(1-36)Online publication date: 28-May-2022
https://dl.acm.org/doi/10.1145/3517747
Jiang JZhu HLi QZhao YZhang SGong PHong Z(2020)Event-based functional decompositionInformation and Computation10.1016/j.ic.2019.104484271:COnline publication date: 1-Apr-2020
https://dl.acm.org/doi/10.1016/j.ic.2019.104484
Chen YChen CWen HJiang JZeng QShu HZhong Hong (2019)From Use Case to Use Case SlicesInternational Journal of Information System Modeling and Design10.4018/IJISMD.201910010210:4(24-50)Online publication date: Oct-2019
https://doi.org/10.4018/IJISMD.2019100102
Show More Cited By

Index Terms

Analyzing Event-Based Scheduling in Concurrent Reactive Systems
1. Computer systems organization
  1. Embedded and cyber-physical systems
    1. Embedded systems
      1. Embedded software
2. Theory of computation
  1. Models of computation
    1. Concurrency
      1. Parallel computing models

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 ...
Single machine parallel-batch scheduling with deteriorating jobs

We consider several single machine parallel-batch scheduling problems in which the processing time of a job is a linear function of its starting time. We give a polynomial-time algorithm for minimizing the maximum cost, an O(n⁵) time algorithm for ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Embedded Computing Systems

ACM Transactions on Embedded Computing Systems Volume 14, Issue 4

December 2015

604 pages

ISSN:1539-9087

EISSN:1558-3465

DOI:10.1145/2821757

Editor:
Sandeep K. Shukla
Virginia Tech, USA

Issue’s Table of Contents

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

ACM Journals for the Design of Smart and Connected Systems

Publication History

Published: 24 September 2015

Accepted: 01 May 2015

Revised: 01 May 2015

Received: 01 July 2014

Published in TECS Volume 14, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

NSF of Fujian province
National Natural Science Foundation of China
Shanghai Collaborative Innovation Center of Trustworthy Software for Internet of Things
Open Project of Shanghai Key Laboratory of Trustworthy Computing

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
290
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chen CHong ZJiang J(2022)Scheduling in Real-Time Mobile SystemsACM Transactions on Embedded Computing Systems10.1145/351774721:3(1-36)Online publication date: 28-May-2022
https://dl.acm.org/doi/10.1145/3517747
Jiang JZhu HLi QZhao YZhang SGong PHong Z(2020)Event-based functional decompositionInformation and Computation10.1016/j.ic.2019.104484271:COnline publication date: 1-Apr-2020
https://dl.acm.org/doi/10.1016/j.ic.2019.104484
Chen YChen CWen HJiang JZeng QShu HZhong Hong (2019)From Use Case to Use Case SlicesInternational Journal of Information System Modeling and Design10.4018/IJISMD.201910010210:4(24-50)Online publication date: Oct-2019
https://doi.org/10.4018/IJISMD.2019100102
Zhou PZuo DHou KZhang ZDong JLi JZhou H(2019)A Comprehensive Technological Survey on the Dependable Self-Management CPS: From Self-Adaptive Architecture to Self-Management StrategiesSensors10.3390/s1905103319:5(1033)Online publication date: 28-Feb-2019
https://doi.org/10.3390/s19051033
Jiang JHong ZChen Y(2019)Modeling and Analyzing Incremental Natures of Developing SoftwareACM Transactions on Management Information Systems10.1145/333353510:2(1-32)Online publication date: 10-Jul-2019
https://dl.acm.org/doi/10.1145/3333535
Jiang JZhu HLi QZhao YHong ZZhang SGong P(2019)Isolation Modeling and Analysis Based on MobilityACM Transactions on Software Engineering and Methodology10.1145/330660628:2(1-31)Online publication date: 26-Feb-2019
https://dl.acm.org/doi/10.1145/3306606
Yu XJiang JHong Z(2018)Decomposition and Composition of Sequence Diagrams2018 International Symposium on Theoretical Aspects of Software Engineering (TASE)10.1109/TASE.2018.00018(76-83)Online publication date: Aug-2018
https://doi.org/10.1109/TASE.2018.00018
Jiang JZhu HLi QZhao YZhao LZhang SGong PHong ZChen D(2017)Event-Based Mobility Modeling and AnalysisACM Transactions on Cyber-Physical Systems10.1145/28233531:2(1-32)Online publication date: 20-Feb-2017
https://dl.acm.org/doi/10.1145/2823353
Chen HJiang JHong ZLin L(2017)Decomposition of UML activity diagramsSoftware: Practice and Experience10.1002/spe.251948:1(105-122)Online publication date: 10-Aug-2017
https://doi.org/10.1002/spe.2519

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents