• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
National Research University Higher School of EconomicsStudent ThesesNested Petri nets verification based on net unfoldings.
Student
Title
Supervisor
Faculty
Educational Programme
Final Grade
Year of Graduation
Daniil Frumin
Nested Petri nets verification based on net unfoldings.
School of Software Engineering
Bachelor’s programme
10
2014
45 pages, 20 illustrations, 35 references. Keywords: verification,

Petri nets, nested Petri nets, concurrency, model checking, unfoldings

multiagent systems.

The topic of this study is the net unfoldings in application to the

verification of nested Petri nets. Nested Petri nets formalism is used

for modeling multiagency systems – systems consisting of autonomous

agents with their own autonomous behavior, communicating with each

other via the means of synchronization. Due to the independent

behavior of agents, multiagent systems are highly concurrent by their

nature.

One particular problem that is associated with the verification of

highly concurrent and distributed systems is the state space explosion

problem, when the number of reachable states of the system grows

exponentially with the addition of new parallel components. One of the

reasons for this is the immense amount of intermediate system states

arising due to consideration of all the sequential executions in the

system – interleavings. One of the solutions for this problem utilizes

the construction of (finite prefixes of) unfoldings.

Nets unfoldings are used for describing the behavior of the system in

the true concurrency semantics. In the case of highly concurrent

systems, the unfolding (or their finite prefixes, to be precise) is

smaller than the reachability graph, which allows to solve the problem

of the exponential blowup of the space of possible system states.

The main result of this work is the constructive definitions of the

branching processes and unfoldings for conservative nested Petri nets,

modeling systems with a fixed number of agents. Those definitions is

used for constructing an unfolding-based algorithm for verification of

important behavioural properties of conservative nested Petri nets.

The results of the research will be presented at the Verification and

Program Transformation workshop, co-located with the Computer Aided

Verification 2014 conference, which will be taking place in Viena in

July this year.

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