An ontological and hierarchical approach for supply chain event aggregation

Time Petri Nets (TPN) have been applied to model the basic event patterns that arise commonly in supply chains. Additionally these TPN-specified patterns can be aggregated to create more complicated supply chain event systems. In our previous work, meanwhile, we introduced SCOPE (Situation Calculus Ontology for PEtri nets), which semantically describes Petri Nets using the Situation Calculus. In this paper, we show that TESCOPE, which extends SCOPE to incorporate the concept of time, can be naturally applied for supply chain event aggregation. That is, we show that supply-chain event patterns can be easily represented as TESCOPE-based Golog procedures, where Golog is a logic language built on top of the Situation Calculus; We further demonstrate by examples that these basic Golog procedures can be aggregated semantically and hierarchically into complex ones.