Search

This paper presents a formal security analysis of the ISA100.11a standard protocol using the Colored Petri Net (CPN) modeling approach. Firstly, we establish a security threat model for the ISA100.11a protocol and provide a detailed description and analysis of the identified security threats. Secondly, we use the CPN tool to model the protocol formally and conduct model checking and security analysis. Finally, we analyze and discuss the results of the model checking, which demonstrate that the ISA100.11a standard protocol may have vulnerabilities when certain security threats exist, and provide some suggestions to enhance the security of the protocol. This research provides a certain level of security assurance for the ISA100.11a standard protocol and serves as a reference for similar security research on protocols. [ABSTRACT FROM AUTHOR]

This paper presents a formal security analysis of the ISA100.11a standard protocol using the Colored Petri Net (CPN) modeling approach. Firstly, we establish a security threat model for the ISA100.11a protocol and provide a detailed description and analysis of the identified security threats. Secondly, we use the CPN tool to model the protocol formally and conduct model checking and security analysis. Finally, we analyze and discuss the results of the model checking, which demonstrate that the ISA100.11a standard protocol may have vulnerabilities when certain security threats exist, and provide some suggestions to enhance the security of the protocol. This research provides a certain level of security assurance for the ISA100.11a standard protocol and serves as a reference for similar security research on protocols.

Machine-to-machine (M2M) communication is one of the critical technologies of the industrial Internet of Things (IoT), which consists of sensors, actuators at the edge, and servers. In order to solve the security and availability problems regarding communication between edge devices with constrained resources and servers in M2M communication, in this study we proposed an authentication and session establishment protocol based on physical unclonable functions (PUFs). The scheme does not require clock synchronization among the devices, and it circumvents the situation where the authentication phase has to use a high computational overhead fuzzy extractor due to PUF noise. The protocol contains two message interactions, which provide strong security and availability while being lightweight. The security modelling is based on CPN Tools, which verifies security attributes and attack resistance in the authentication phase. After considering the design of the fuzzy extractor and scalability, the proposed scheme significantly reduces the computational overhead by more than 93.83% in the authentication phase compared with other schemes using PUFs. Meanwhile, under the guarantee of availability, the communication overhead is maintained at a balanced and reasonable level, at least 19.67% lower than the solution using XOR, hashing, or an elliptic curve. [ABSTRACT FROM AUTHOR]

The toll road service is planned and built to fund road construction and management of traffic operations. Although the toll service has several benefits, it also has challenges by creating a queue in the event of high traffic. Queues at a toll service in addition to pollution and waiting time costs also expose drivers to road traffic accidents and affect the economy of the country. Queuing problems at highway gates and exits due to toll service have become the main concern for transport managers and planners because of the randomness of inter-arrival and service time. The critical point in the management of toll road services is finding the optimal number of servers. This paper aims to analyze the queue feature to optimize the toll service using analytical and simulation models by considering the Addis-Adama expressway toll service in Ethiopia. The paper used a mathematical model and a simulation model using the CPN tools to investigate the queuing parameters. Then the model results helped us to get the optimum output by using economic analysis and identifying the minimum waiting time and operating cost without expense. The performance of the toll service highly depends on the number of servers, the number of vehicles in the system and queue, waiting time in the queue, service time, and inter-arrival time.

To solve the problem regarding the lack of a lightweight and secure authentication and key agreement protocol in the Constrained Application Protocol of the Internet of Things environment, we explore the security flaws and applicability problems in the current related research. Then, we propose a new lightweight authentication and key agreement protocol based on the CoAP framework. The scheme adopts shared secret and elliptic curve public key technology, which ensures the anonymity of the communicators and provides strong security and anti-attack capacity. In terms of security analysis, the Dolev–Yao Adversary model and a security model checking analysis method based on CPN Tools are improved, in order to verify the correctness and security of the proposed scheme. Compared with other schemes, regarding communication overhead, computational cost, and security, the proposed scheme provides a robust and comprehensive security guarantee, although it is not the lightest. [ABSTRACT FROM AUTHOR]

With the rapid development of the Internet of Vehicles, the increase in vehicle functional requirements has led to the continuous increase in complex electronic systems, and the in-vehicle network is extremely vulnerable to network attacks. The controller area network (CAN) bus is the most representative in-vehicle bus technology in intra-vehicular networks (IVNs) for its flexibility. Although the current framework to protect the safety of CAN has been proposed, the safety communication mechanism between electronic control units (ECUs) in the vehicle network is still weak. A large number of communication protocols focus on the addition of safety mechanisms, and there is a lack of general protocol formal modeling and security assessment. In addition, many protocols are designed without considering key updates and transmission, ECUs maintenance, etc. In this work, we propose an efficient in-vehicle authentication and key transmission scheme. This scheme is a certificateless framework based on identity cryptography, which can not only ensure the security of the in-vehicle network but also meet the real-time requirements between ECUs. Moreover, this scheme can reduce the complexity of key management for centralized key generators. To evaluate the security of this scheme, we adopt a protocol model detection method based on the combination of the colored Petri net (CPN) and the Dolev–Yao attack model to formally evaluate the proposed protocol. The evaluation results show that the proposed scheme can effectively prevent three types of man-in-the-middle attacks.

To solve the problem regarding the lack of a lightweight and secure authentication and key agreement protocol in the Constrained Application Protocol of the Internet of Things environment, we explore the security flaws and applicability problems in the current related research. Then, we propose a new lightweight authentication and key agreement protocol based on the CoAP framework. The scheme adopts shared secret and elliptic curve public key technology, which ensures the anonymity of the communicators and provides strong security and anti-attack capacity. In terms of security analysis, the Dolev–Yao Adversary model and a security model checking analysis method based on CPN Tools are improved, in order to verify the correctness and security of the proposed scheme. Compared with other schemes, regarding communication overhead, computational cost, and security, the proposed scheme provides a robust and comprehensive security guarantee, although it is not the lightest.

In this paper we are considering the implementation of support for modeling of the input flow of differently typed requests in the model of the payment card processing system server in form of a hierarchical coloured Petri net. Also, the validation of the extended model was performed using data from a real processing system. Based on its results, we made a conclusion on the acceptability of using the model in further research and in practical application. [ABSTRACT FROM AUTHOR]

The verification and analysis of distributed systems is a task of utmost importance, especially in today’s world where many critical services are completely supported by different computer systems. Among the solutions for system modelling and verification, it is particularly useful to combine the usage of different analysis techniques. This also allows the application of the best formalism or technique to different components of a system. The combination of Colored Petri Nets (CPNs) and Automata Theory has proved to be a successful formal technique in the modelling and verification of different distributed systems. In this context, this paper presents Prosega/CPN ( Protocol Sequence Generator and Analyzer ), an extension of CPN Tools for supporting automata-based analysis and verification. The tool implements several operations such as the generation of a minimized deterministic finite-state automaton (FSA) from a CPN’s occurrence graph, language generation, and FSA comparison. The solution is supported by the Simulator Extensions feature whose development has been driven by the need of integrating CPN with other formal methods. Prosega/CPN is intended to support a formal verification methodology of communication protocols; however, it may be used in the verification of other systems whose analysis involves the comparison of models at different levels of abstraction. For example, business strategy and business processes. An insightful use case is provided where Prosega/CPN has been used to analyze part of the IEEE 802.16 MAC connection management service specification.

Video games are complex systems that combine technical and artistic processes. The specification of this type of system is not a trivial task, making it necessary to use diagrams and charts to visually specify sets of requirements. Therefore, the underlying proposal of this work is to present an approach based on the formalism of Petri nets for aiding in the design process of video games. The activities of the game are represented by a specific type of Petri net called Work-Flow net. The definition of a topological map can be represented by state graphs. Using Colored Petri nets, it is possible to define formal communication mechanisms between the model of activity and the model of the map. The simulation of the timed models allows then to produce an estimated time that corresponds to the effective duration a player will need to complete a level of a game. Furthermore, a kind of Soundness property related to gameplay in a game Quest can be verified through state space analysis. For a better understanding of the approach, the video game Silent Hill II is used. [ABSTRACT FROM AUTHOR]

Розроблено структуру автоматизованої системи опрацювання параметрів пасажиропотоку громадського транспорту "розумного" міста. Структура базується на використанні одноплатного комп'ютера Raspberry Pi в ролі головного контролера, IP відеокамер, USB фотокамери, GPS і GSM модулів та інших периферійних пристроїв для збору даних про пасажиропотік у транспортному засобі громадського користування та передачі їх на оброблення сервером. Основою структури є клієнт-серверна взаємодія. Представлено покроковий алгоритм, що відображає загальні принципи функціонування системи та етапи опрацювання параметрів пасажиропотоку. На основі розроблених структури та алгоритму функціонування побудовано та досліджено модель автоматизованої системи опрацювання параметрів пасажиропотоку громадського транспорту на основі кольорових мереж Петрі. Модель реалізовано засобами програмного пакету CPN Tools, призначеного для побудови моделей за допомогою розширених класів теорії мереж Петрі. Результати дослідження кольорової мережі Петрі дають змогу стверджувати, що пропоновані структура та алгоритм системи цілком задовольняють технічне завдання. Згідно з проведеним аналізу мережа Петрі є живою, усі стани системи досяжні, а "мертві" переходи та тупики відсутні.

UML sequence diagrams are used to graphically describe the message interactions between the objects participating in a certain scenario. Combined fragments extend the basic functionality of UML sequence diagrams with control structures, such as sequences, alternatives, iterations, or parallels. In this paper, we present a UML profile to annotate sequence diagrams with combined fragments to model timed Web services with distributed resources under the publish/subscribe paradigm. This profile is exploited to automatically obtain a representation of the system based on Colored Petri nets using a novel model-to-model (M2M) transformation. This M2M transformation has been specified using QVT and has been integrated in a new add-on extending a state-of-the-art UML modeling tool. Generated Petri nets can be immediately used in well-known Petri net software, such as CPN Tools, to analyze the system behavior. Hence, our model-to-model transformation tool allows for simulating the system and finding design errors in early stages of system development, which enables us to fix them at these early phases and thus potentially saving development costs. [ABSTRACT FROM AUTHOR]

Queueing theory is a mathematical tool which can be applied for capacity planning and optimisation of production, manufacturing or logistics systems. One of the possible applications of queueing theory is service capacity optimisation. Let us consider that an engineering company operates m homogeneous machines. We assume that the machines are successively operating and down and times between failures and times to repair are exponentially distributed. The broken-down machines are repaired by n repairmen; we assume that n < m. In the article a mathematical model of the problem is presented; the model can be used for optimisation of the number of the repairmen with respect to costs of the system. Results obtained by the mathematical model are compared with simulation results; a simulation model of the problem is based on coloured Petri nets. [ABSTRACT FROM AUTHOR]

The paper presents a case study of petri nets applications in modeling and simulation of manufacturing process. For this purpose the CPN TOOLS program is used. By using the timed colored petri nets within this program, it can be model and simulate the manufacturing process for a certain period of time. Transitions used in the model are mainly associated with assembly operations and positions are associated with workstations. In order for the simulation to be faithful to the manufacturing process it is necessary to know precisely the operating times for each operation. In the paper it's analyze the functioning of the manufacturing process over a duration of 8 hours, making several simulations. [ABSTRACT FROM AUTHOR]

In this paper, we present a new approach to server consolidation in heterogeneous computer clusters using Colored Petri Nets (CPNs). Server consolidation aims to reduce energy costs and improve resource utilization by reducing the number of servers necessary to run the existing virtual machines in the cluster. It exploits the emerging technology of live migration which allows migrating virtual machines between servers without stopping their provided services. Server consolidation approaches attempt to find migration plans that aim to minimize the necessary size of the cluster. Our approach finds plans which not only minimize the overall number of used servers, but also minimize the total data migration overhead. The latter objective is not taken into consideration by other approaches and heuristics. We explore the use of CPN Tools in analyzing the state spaces of the CPNs. Since the state space of the CPN model can grow exponentially with the size of the cluster, we examine different techniques to generate and analyze the state space in order to find good plans to server consolidation within acceptable time and computing power.

Microservices are a popular contemporary method to build scalable distributed systems (e.g. websites). It is hard to predict executable operations reliability of the future system due to the vast number of components and their nonlinear relations. In this paper we consider the operation executed by multiple microservices as a single atomic transaction. The transaction matters only if it is completed successfully. In case of an error during an execution, or due to the necessity to discard the results, the transaction must be reversed or compensated. To analyze the reliability of the execution of such an operation we introduce a dedicated software solution based on Coloured Petri-Net, CPN, Tools. Accordingly, the interactive microservices system has to be described using Coloured Petri-net terms, and the operation must comply with certain rules of business process modelling, e.g. to have an input/output point. The software solution consists of several interconnecting units which include the CPN Tools, ACCESS/CPN and PostgreSQL. These programs are controlled by an application server through the web-interface. The software solution allows the analysis to be performed simultaneously by multiple examiners due to the implication of web technologies. [ABSTRACT FROM AUTHOR]

The existing management systems for networks and communication services do not fully meet the demands of users in next-generation infocommunication services that are dictated by the business processes of companies. Open digital architecture (ODA) is able to dramatically simplify and automate main business processes using the logic of distributed computing and management, which allows implementing services on a set of network nodes. The performance of a distributed operational management system depends on the quality of solving several tasks as follows: the distribution of program components among processor modules; the prioritization of business processes with parallel execution; the elimination of dead states and interlocks during execution; and the reduction of system cost to integrate separate components of business processes. The program components can be distributed among processor modules by an iterative algorithm that calculates the frequency of resource conflicts; this algorithm yields a rational distribution in a finite number of iterations. The interlocks of parallel business processes can be eliminated using the classic file sharing example with two processes and also the methodology of colored Petri nets. The system cost of integration processes in a distributed management system is reduced through partitioning the network into segments with several controllers that interact with each other and manage the network in a coordinated way. This paper develops a model of a distributed operational management system for next-generation infocommunication networks that assesses the efficiency of operational activities for a communication company.

To further resolve the problems that were brought by the existing research tools of complex system brittleness theory, such as system state describe difficulties or too critical constraint conditions about system boundary, this paper introduced colored Petri nets into the research on complex system brittleness measurement. The colored Petri nets,its simulation tool CPN Tools and the existing advanced state space tools were helpful to reduce the system complexity in modeling and quantification. This paper brought forward complex system brittleness measurement index,and gave the programming workflow. Lastly a numerical example illustrates that the node brittleness propagation process and its influence range in state space can reflect the system brittleness. [ABSTRACT FROM AUTHOR]

Today, cyber attacks to computer networks have turned into a real challenge for network administrators. A wide range of methods have been used for attack modeling and security quantification. The most important drawback of the existing methods is that they are not based on real security-related information of networks. Our aim has been to overcome this drawback by using high-level modeling techniques and real security relevant information of systems. In this paper, we use coloured Petri nets (CPNs) for attack modeling. One of the objectives of this paper is to show the power and flexibility of CPNs for high-level attack modeling. In our work, the important elements of networks involved in cyber attacks, such as hosts, attackers, intrusion detection and prevention systems, servers and firewalls are modeled as reusable CPN sub-models. In other words, with the help of hierarchy and the abstraction provided by CPNs, we have proposed a framework for modeling and evaluation of the impacts of cyber attacks on networks. Through an illustrative example, we have modeled a sample network and some attack scenarios by using the security-relevant information extracted from open source vulnerability database (OSVDB). Finally, we have evaluated some security measures of a sample network.

This paper is devoted to modelling and simulation of an E2/E2/1/m queueing system with a server subject to breakdowns. The paper introduces a mathematical model of the studied system and a simulation model created by using software CPN Tools, which is intended for modelling and a simulation of coloured Petri nets. At the end of the paper the outcomes which were reached by both approaches are statistically evaluated.

The contract net protocol is a task allocation protocol that facilitates negotiation between bidders and an auctioneer in a multi-agent system to form a contract. The contract net protocol-extension (CNP-ext) allows the bidders to interact with more than one auctioneer concurrently, and to update their bids until a bid is granted. This introduces flexibility and ensures better selection of a bid. In earlier work, we modelled the CNP-ext with coloured petri nets and showed that it terminates correctly. We also analysed the terminal states and proved that the agents have consistent beliefs at the end of negotiations. Lastly, we showed how the number of terminal states and channel bounds are related to the number of bidders. However, due to state space explosion, our results were restricted to five bidders. As all bidders are considered identical, symmetries exist in the state space. Hence, we decided to tackle this problem using equivalence classes. In this paper, after first presenting an introduction to the CNP-ext, we present a substantial revision to our CNP-ext model and an intentionally didactic description of its operation. Then, we use equivalence classes to analyse the protocol and, importantly, present a proof that our equivalence specification is consistent. Using this technique, we are able to extend the verification results to twenty-four bidders. [ABSTRACT FROM AUTHOR]

Focus on the real-time scheduling problem of a single-point full-sensitive control traffic lights signal system, we construct a dynamic timed control model of traffic lights by using the hierarchical colored Petri net (HCPN). First of all. traffic flow data are classified based on the fuzzy control theory. Secondly, utilizing the collected traffic information as the control parameters, we establish a basic traffic signal outline model based on the hierarchical color Petri net theory, and then stratified model refinement and stepwise refinement are made in accordance with the key features. In addition, a counter instead of time delay is added to the system model. The switching relationship between traffic light cycle time and traffic flows is reflected in a simple and direct way. Performance indicators are evaluated and compared through this method. Finally, the system model is implemented and validated using the CPN Tools and a simple performance optimization analysis is made. [ABSTRACT FROM AUTHOR]

Nowadays Process Mining and Simulation are recognized like innovative alternatives for business process analysis and improvement. Traditional techniques of process analysis need generally long processing times and are supported on analysts expertise, with the corresponding risk of human error; however, process mining techniques are able to extract knowledge from event logs commonly available in today's information systems through less expensive methods in time and resources. Whereas traditional simulation approaches rely on hand-made models, we advocate the use of process mining techniques for creating more reliable simulation models based on real event data. The present paper shows the results obtained with process mining and simulation on Petri Nets and ARENA in the same process, in order to compare the results obtained by each of them and determine if there are significant differences between them. [ABSTRACT FROM AUTHOR]