Mapping Petri nets to parallel programs in CC++

The low-code approach is an important area of research being developed to improve the rapid creation and performance of software applications. This approach allows developers and users to easily create software applications through an interactive interface. Existing research shows that the low-code approach accelerates the development process in innovative ways, saves effort and time, and reduces code complexity. This study analyses and compares automatic code generation and transformation techniques in low-code platforms. The study analyses the contributions of automatic code generation and transformation to software engineering processes and evaluates the impact of these techniques on software product quality and development speed. The importance of the Model-Based Development (MBD) approach in automated code generation processes is highlighted. It is stated that MBD provides benefits such as speeding up the software development process and reducing errors by enabling automatic code generation from high-level abstract models. In the study, various literature studies were evaluated to examine the impact of automatic code generation and transformation techniques on the application development process. These studies have shown how automatic code generation and transformation techniques are applied, what results are achieved and what contributions these techniques make to the software development process. The results of the study show that automatic code generation and transformation techniques have a great impact on the application development process. In particular, the acceleration of the software development process, the reduction of errors and the ability to produce more effective and efficient software products are important benefits of these techniques. In addition, it has been found that this approach increases the success of software projects by enabling software developers to produce fast and accurate solutions in complex systems. In this context, the importance of automatic code generation and transformation techniques plays an important role in software development processes.

Petri nets are known to be useful for modeling concurrent systems. Once modeled by a Petri net, the behavior of a concurrent system can be characterized by the set of all executable transition sequences, which in turn can be viewed as a language over an alphabet of symbols corresponding to the transitions of the underlying Petri net. In this paper, we study the language issue of Petri nets from a computational complexity viewpoint. We analyze the complexity of theregularity problem(i.e., the problem of determining whether a given Petri net defines an irregular language or not) for a variety of classes of Petri nets, includingconflict-free,trap-circuit,normal,sinkless,extended trap-circuit,BPP, andgeneralPetri nets. (Extended trap-circuit Petri nets are trap-circuit Petri nets augmented with a specific type ofcircuits.) As it turns out, the complexities for these Petri net classes range from NL (nondeterministic logspace), PTIME (polynomial time), and NP (nondeterministic polynomial time), to EXPSPACE (exponential space). In the process of deriving the complexity results, we develop adecomposition approachwhich, we feel, is interesting in its own right, and might have other applications to the analysis of Petri nets as well. As a by-product, an NP upper bound of the reachability problem for the class of extended trap-circuit Petri nets (which properly contains that of trap-circuit (and hence, conflict-free) and BPP-nets, and is incomparable with that of normal and sinkless Petri nets) is derived.

The aim of this work is the modeling and verification of concurrent systems subject to dynamic changes using extensions of Petri nets. We begin by introducing the notion of net rewriting system. In a net rewriting system, a system configuration is described as a Petri net and a change in configuration is described as a graph rewriting rule. We show that net rewriting systems are Turing powerful, that is, the basic decidable properties of Petri nets are lost and, thus, automatic verification in not possible for this class. A subclass of net rewriting systems are reconfigurable Petri nets. In a reconfigurable Petri net, a change in configuration amounts to the modification of the flow relations of the places in the domain of the involved rule according to this rule, independently of the context in which this rewriting applies. We show that reconfigurable Petri nets are formally equivalent to Petri nets. This equivalence ensures that all the fundamental properties of Petri nets are still decidable for reconfigurable Petri nets and this model is thus amenable to automatic verification tools. Therefore, the expressiveness of both models is the same, but, with reconfigurable Petri nets, we can easily and directly model systems that change their structure dynamically.

This article is devoted to the problem of verifying parallel programs that may contain special types of errors associated with the synchronization of parallel executed threads and access to shared memory. Such errors include deadlocks and data races. There is a division of parallel program verification methods into static and dynamic. The second ones require running the code and allow to check only the current implementation of the program for races, which, if there are a large number of branches, can lead to missing races. Among static methods, analytical methods (for example, based on deductive analysis) and model checking methods are most widely used. However, they are difficult to implement, and model checking still require a significant amount of manual work from the programmer to build such a model. In this regard, it is necessary to use models that can be built automatically. Previously, the authors developed a model based on an extension of Petri nets, which allows automatic creation based on sequential code and its conversion into parallel code. Automatic creation of a model of a parallel program introduces new, previously unused requirements related to the interaction of parallel threads. Thus, this article discusses the features of modeling using extended Petri nets with semantic relations of the main synchronization primitives implemented in most languages and parallel programming technologies for shared memory systems. In the future, these models will be used to search for data races and deadlocks in parallel programs.

Specification and properties of a cache coherence protocol model.- GAMERU: A language for the analysis and design of human communication pragmatics within organizational systems.- Recent results on the complexity of problems related to Petri nets.- Algebraic structure of flows of a regular coloured net.- On equivalent execution semantics of concurrent systems.- Mathematical methods for calculating invariants in Petri nets.- On Petri nets with deterministic and exponentially distributed firing times.- An accurate performance model of CSMA/CD bus LAN.- Petri net models for the ?-calculus.- Fair processes.- Operational Petri net semantics for CCSP.- Infinitary languages of Petri nets and logical sentences.- A strong part of concurrency.- Concurrency and continuity.- Parallel systems specifications with coloured Petri nets and algebraic specifications.- Bibliography of Petri nets.

Petri nets provide a well understood formal method for modeling concurrent systems, in all of their complexity. Petri nets, however, do not directly support the concepts of modularization, encapsulation, and information hiding that are essential to the successful abstraction of complexity provided by the OO methodology. The Petri net model of even a simple system can become overwhelmingly complex. The first goal of this paper was to survey a number of tools combining the OO technique with Petri nets, to pick one, and to use it in an implementation of an OO design. There was a great desire to utilize a tool having a graphical interface for the Petri net presentation. It was also highly desirable to utilize colored Petri nets. The design chosen was that of a bank ATM machine. The tool selected for use was SYROCO. This tool provides a means to define Cooperative objects (COO), which are translated into C++ classes. The COO language uses high level Petri nets to model the internal operation of objects, and provides a mechanism to connect together the Petri nets of distinct objects via the normal OO interface.

The PETRI NETS 2023 proceedings deal with the application and theory of petri nets, distributed and concurrency systems, etc.

Modelling and analysis of kanban-controlled (just-in-time) production systems under realistic assumptions presents a number of challenges, including the ability to conduct both qualitative and quantitative analysis, and the ability to model control policies. These challenges are due, in part, to station interdependence, blocking and starvation due to limited buffer spaces, and the necessity of modelling both material and kanban flows. Petri nets (PNs) have recently emerged as a promising approach for modelling manufacturing systems. PNs are a graphical and mathematical technique useful for modelling concurrent, asynchronous, distributed, parallel, non-deterministic and stochastic systems. PN models can be analysed to determine both their qualitative and quantitative properties. In this paper, we develop stochastic, coloured PN (SCPN) models of a JIT system utilizing two different kanban control policies: a traditional kanban system (TKS) policy and a flexible kanban system (FKS) policy. The resulting models can be used to represent JIT systems of arbitrary size, producing single or multiple types of products, with fixed order points 1. The models are shown to be live and bounded, and can be simulated to produce quantitative results. Sample simulation results are presented to illustrate the models' capabilities.

This paper presents a decentralized Petri net (PN) based wireless sensor node architecture (PN-WSNA) to construct a flexible and reconfigurable WSN for intelligent monitoring systems. PN is a graphic based discrete event dynamic system (DEDS) modeling approach, and it is advantageous for modeling the system with concurrent and asynchronous systems. Therefore, the PN is usually used to construct agent based intelligent monitoring systems. The PN-WSNA system consists of a PN-WSNA kernel program and a PN-WSNA management program. The PN-WSNA kernel program is developed as an agent that is installed in the sensor node, and it is responsible of receiving and decoding PN models, collecting sensor data from analog and digital channels, intercommunication between sensor nodes, PN model inference and decision. On the other hand, the PN-WSNA management program is executed on a remote host computer, and it is responsible of distance sensor node managements via routing tables. More specially, a user interface is provided for system managers to edit PN models in a graphic manner, and the PN models can be delivered to the corresponding sensor node online without physical visits. Therefore, the proposed PN-WSNA system not only performs a reconfigurable WSN architecture, but also provides an easy graphical PN edit environment for constructing intelligent agents. Such a system can be applied to the factory automation, intelligent diagnosis, climate monitoring, etc. Finally, a simple prototype system is constructed using the Zigbee BAT mote modules to verify the proposed PN-WSNA system.

The notions of fairness and conflicts in live, bounded, and strongly connected Petri nets (PNs) are formally related. The PN model of a resource-sharing concurrent system (RSCS) is conflict free when the firing of an enabled transition does not disable another transition in the net. Conflicts in the PN represent unresolved resource allocation conditions. The PN is fair when the firing of any transition more than a given number of times is a sufficient condition for all the transitions in the net to have fired. When the PN is fair, no process in the system can be starved; that is resources are allocated so that all tokens progress through the net. Although these concepts are not equivalent, it is shown that they are strongly related to each other when the PN model is live, bounded, and strongly connected. A computational method for finding conflicts is presented, and the concepts are illustrated with an example of buffer allocation in a sorting algorithm. >

This paper presents a symbolic approach for the analysis of bounded Petri nets. The structure and behavior of the Petri net is symbolically modeled by using Boolean functions, thus reducing reasoning about Petri nets to Boolean calculation. The set of reachable markings is calculated by symbolically firing the transitions in the Petri net. Highly concurrent systems suffer from the state explosion problem produced by an exponential increase of the number of reachable states. This state explosion is handled by using Binary Decision Diagrams (BDDs) which are capable of representing large sets of markings with small data structures. Petri nets have the ability to model a large variety of systems and the flexibility to describe causality, concurrency, and conditional relations. The manipulation of vast state spaces generated by Petri nets enables the efficient analysis of a wide range of problems, e.g., deadlock freeness, liveness, and concurrency. A number of examples are presented in order to show how large reachability sets can be generated, represented, and analyzed with moderate BDD sizes. By using this symbolic framework, properties requiring an exhaustive analysis of the reachability graph can be efficiently verified.

This paper shows how to use the Petri Net with Stacks (PNS-net) to express asynchronous concurrent distributed computing systems (DCS) which are based on the environment of loosely coupled computing systems, and puts forth method to detect types of DCS deadlocks such as Cycle Waiting, Hold and Wait, Exclusive access, etc. Then we can apply the algorithm that this paper narrates which actually changes PNS-net into production rules during the system-designing stages. By designing a diagnosis system for automatic detection of deadlocks in asynchronous concurrent distributed computing systems (ACDCS), the goal of this paper is to develop and approach for reducing the time and cost in the software development.

Real-time emulation of boost inverter using the Systems Modeling Language and Petri nets

We present an example of a construction of an embedded software system-a controller-from the formal specification to executable code. The CO-OPN (Concurrent Object Oriented Petri Net) formal specification language is used for modelling the controller and the associated hardware system with the inherent limitation of its physical components. CO-OPN formal language is based on coordinated algebraic Petri nets. The CO-OPN model can be used to verify some properties of the controller in the concrete physical environment. This is achieved by constrained animation of the valid prototype produced by automatic code generation. The possibility to incrementally refine the generated code can be used to obtain a more efficient implementation.

Programming with parallel skeletons is an attractive framework because it encourages programmers to develop efficient and portable parallel programs. However, extracting parallelism from sequential specifications and constructing efficient parallel programs using the skeletons are still difficult tasks. In this paper, we propose an analytical approach to transforming recursive functions on general recursive data structures into compositions of parallel skeletons. Using static slicing, we have defined a classification of subexpressions based on their data-parallelism. Then, skeleton-based parallel programs are generated from the classification. To extend the scope of parallelization, we have adopted more general parallel skeletons which do not require the associativity of argument functions. In this way, our analytical method can parallelize recursive functions with complex data flows.