We describe an algebraic technique for performing timing analysis on a restricted class of Petri nets with interval time delays spec-iied on the places of the net. The timing analysis we perform determines the extreme separation in time between speciied occurrences of pairs of transitions for all possible timed executions of the system. We present the details of the timing analysis algorithm an...

We describe an algebraic technique for performing timing analysis on a restricted class of Petri nets with interval time delays spec-iied on the places of the net. The timing analysis we perform determines the extreme separation in time between speciied occurrences of pairs of transitions for all possible timed executions of the system. We present the details of the timing analysis algorithm an...

We are concerned with causality semantics in the executions of Petri nets with range arcs. Range arcs combine (and subsume) the distinctive features of inhibitor and activator arcs, and each such arc provides a means of specifying a range (a finite or infinite interval of non-negative integers) for the number of tokens in a place which makes enabling of a given transition possible. We demonstra...

Model-Based Testing is an automated test approach used for automated test generation, execution, and evaluation. For this purposes, it uses a formal model of system behavior. In this paper, an advanced variant of Petri net is presented as a tool for description of the systems under test. Petri nets have been selected for their graphical and executable nature and for the ability to describe para...

The problem of finite completeness of categories of Petri nets is studied. Since Petri nets have finite products, the problem reduces to the issue of the existence of equalizers. We show that the categories of Petri nets with general and Winskel morphisms do not admit equalizers, and hence are not finitely complete. An important class of multiplicative Petri net morphisms is also identified. Th...

Petri nets are a powerful formalism for the specification and verification of concurrent and real-time systems. Real-time systems must be carefully verified because even a small failure in these systems can cause loss of human lives. For this purposes the time reachability analysis of Petri nets with incorporated time issue is more than suitable. The best known and probably the most used Petri ...

High-level Petri nets (evolutions of low-level Petri nets) are well suitable formalisms to represent complex data, which influence the behavior of distributed, concurrent systems. However, usual verification techniques such as model checking and testing remain an open challenge for both (i.e., low-level and high-level Petri nets) because of the state space explosion problem and test case select...