Computation of enabled transition instances is a key but difficult problem of animation of colored Petri nets. To address it in our colored Petri net tool, we give an algorithm for computing enabled transition instances. This algorithm is based on pattern matching. So it first tries to bind tokens to variables covered by patterns. If some variables are not covered by any pattern, the algorithm ...

Testing requirements in the earlier stages of system design is a necessary step in system development. Mobile TV system has been in the spotlight due to widespread use of smart devices. Nowadays, most people in public transportation watch TV programs on their smartphones. However, this activity consumes a lot of smartphone battery power. The solution to this problem can be a cloud-based mobile ...

Responsive space launch is currently developing rapidly and has application cases in many fields, with advantages such as fast response speed flexible networking. Aiming at the efficiency evaluation of responsive system, this article first summarizes typical process launch, then gives a hierarchical model system based on timed colored Petri nets, including top-level model, demand command decisi...

The integrated management of business processes and master data is being increasingly considered as a fundamental problem, by both the academia and the industry. In this position paper, we focus on the foundations of the problem, arguing that contemporary approaches struggle to find a suitable equilibrium between dataand process-related aspects. We then propose db-nets, a new formal model that ...

CAR is a declarative language which can be used to map between different schemas in general and which allows the integration of ontologies in special. CAR provides mapping operators whose expressivity exceeds the possibilities of simple equivalence mappings by far. Due to the declarative nature of this approach, CAR which we implemented in a graphical mapping framework, offers a very user-frien...

We investigate data-enriched models, like Petri nets with data, where executability of a transition is conditioned by a relation between data values involved. Decidability status of various decision problems in such models may depend on the structure of data domain. According to the WQO Dichotomy Conjecture, if a data domain is homogeneous then it either exhibits a well quasi-order (in which ca...

We present a formal specification of an executor of Extended Simple Colored Petri Nets (ESCP-nets), meant to be externally supervised. The execution of an ESCP-net proceeds through discrete steps, each performed in response to a call from an external supervisor, in charge of indicating which controlled transitions are allowed to fire and which tokens can be assigned to their controlled variable...