Abstract

The complex workflows and interactions between heterogeneous entities in Cyber-Physical Production Systems (CPPS) call for the use of context-aware computing technology to operate effectively and meet the order requirements in a timely manner. In addition to the objective to meet the order due date, due to resource contention between production processes, CPPS may enter undesirable states. In undesirable states, all or part of the production activities are in waiting states or blocked situation due to improper allocation of resources. The capability to meet the order due date and prevent the system from entering an undesirable state poses challenges in the development of context-aware computing applications for CPPS. In this study, we formulate two situation awareness problems, including a Deadline Awareness Problem and a Future States Awareness Problem to address the above issues. In our previous study, we found that Discrete Timed Petri Nets provide an effective tool to model and analyze CPPS. In this paper, we present a relevant theory to support the operation of CPPS by extending the Discrete Timed Petri Nets to lay a foundation for developing context-aware applications of CPPS with deadline awareness and future states awareness capabilities. We illustrate the theory developed in this study by an example and conduct experiments to verify the computational feasibility of the proposed method.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.