We propose an efficient algorithm that enacts the control-flow of BPMN, in particular the inclusive Or-join gateway. The original algorithm for enacting Or-joins in BPMN 2.0 needs, upon each token move in the diagram, linear time in the number of edges of the diagram to find out whether a given Or-join is enabled, whereas our proposal essentially needs only constant time to do so.

The generation and accumulation of waste of electrical and electronic equipment (WEEE) is growing fast, becoming one of the most complex waste streams the modern world faces. The effective and efficient management of this waste stream raises the interest of the global scientific and business community. The purpose of this paper is to analyze the flow in an e-waste management system, present the...

Abstract—The threat modeling process starts with the phases of identifying critical assets, creating an architecture overview, and decomposing to identify possible points of attack. Data flow diagrams and sequence diagrams are used in this process. This paper proposes an alternative flow-based methodology for building an architectural map for the system. It provides a high-level methodology for...

We present a tool for measuring the Function Point software metric from the specification of a software system expressed in the form of an Entity Relationship diagram plus a Data Flow Diagram (ER-DFD). First, the informal and general Function Point counting rules are translated into rigorous rules expressing properties of the ER-DFD. Then, the rigorous rules are ∗ Corresponding author: tel ++39...

Voronoi diagrams have recently received attention as data structures containing significant information about the spatial adjacency of map objects. Despite their theoretical efficiency, batch construction techniques require complete rebuilding after each modification. Incremental Voronoi creation methods use processes such as insert, delete and move for points, and from these derive insertion a...

We define the spatial constraints and objective function for weight-proportional partitioning of information spaces. We evaluate existing methods in light of these definitions and find that none performs as desired. We then formulate an alternative approach based on an adaptive version of the multiplicatively weighted Voronoi diagram; i.e., the diagram’s weights are computed based on a set of p...

This paper presents a CASE tool for the specification, design, implementation, testing, and maintenance of multimedia presentations. The proposed system is based on a Petri net machine to control event-based resource synchronization. Data flow diagrams and control flow diagrams are used as the specification of a multimedia presentation. The system then allows the specification to be stepwise re...