Reconfigurable Open Algebraic High-Level Systems

In this paper reconfigurable open algebraic high-level (AHL) systems are introduced as an extension of AHL systems [PER95]. In addition to the integration of data structures open places and communicating transitions allow modelling reactive behavior as communication with their environment. Reconfigurable open AHL systems are defined that comprise rules and transformations of these nets. Formally they are an instance of weak adhesive HLR systems [EP06] and so yield the same results. Moreover, a case study is presented that demonstrates the practical need for reconfigurable open AHL systems

Negative Application Conditions for Reconfigurable Algebraic High-Level Systems

This paper introduces negative application conditions for reconfigurable algebraic high-level systems. These are algebraic high-level systems, i.e. algebraic high-level nets with an initial marking, together with a set of rules for changing the system dynamically. Negative application conditions are a control structure for restricting the application of a rule if a certain structure is present. The use of negative application conditions is motivated in a short example. Subsequently, the underlying theory is sketched and the most significant results are presented. Finally, the example is resumed and the main results and their usefulness within the example are discussed

Special Session on Industry 4.0

No abstract available

Negative Application Conditions for Reconfigurable Place/Transition Systems

This paper introduces negative application conditions for reconfigurable place/transition nets. These are Petri nets together with a set of rules that allow changing the net and its marking dynamically. Negative application conditions are a control structure that prohibits the application of a rule if certain structures are already existent. We motivate the use of negative application conditions in a short example. Subsequently the underlying theory is sketched and the results – concerning parallelism, concurrency and confluence – are presented. Then we resume the example and explicitly discuss the main results and their usefulness within the example