• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Educational Programme
Final Grade
Year of Graduation
Kirill Serebrennikov
Ensuring Petri Net Soundness with Transition Constraints
System and Software Engineering
(Master’s programme)
The subject of the present study is the problem of ensuring Petri net soundness

with transition constraints. In the thesis we propose an approach to implementation of

the algorithm for computing transition priorities for live Petri nets. Priorities are a

form of constraints, which can be imposed to ensure liveness and boundedness and,

thus, soundness of a Petri net model. The presence of these properties is highly

desirable in analysis of different types of systems, ranging from business processes

systems to embedded systems. The study covers the design considerations of the

implementation, including an approach to handling the high time complexity of the

algorithm and optimizations introduced into it. Analysis of design decisions is

provided. Based on the actual implementation an application for computing priorities

was developed. It can be used for further analysis of the algorithm applicability for

real-life cases.

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses