A new linear constraint transformation approach for Petri nets with uncontrollable transitions

This work focuses on the problem of providing a linear algebraic characterization of the admissible marking set relative to a Petri net with uncontrollable transitions, subject to a linear constraint. More specifically, given a linear constraint that limits the number of tokens in one place, an algo...

Full description

Saved in:
Bibliographic Details
Published in2016 13th International Workshop on Discrete Event Systems (WODES) pp. 258 - 263
Main Authors Dan You, ShouGuang Wang, Seatzu, Carla
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2016
Subjects
Discrete event systems
equivalent transformation
Fires
Firing
Iterative methods
Law
linear constraints
Monitoring
Petri nets
Online AccessGet full text

Cover

More Information
Summary:This work focuses on the problem of providing a linear algebraic characterization of the admissible marking set relative to a Petri net with uncontrollable transitions, subject to a linear constraint. More specifically, given a linear constraint that limits the number of tokens in one place, an algorithm is proposed to provide an approximation of the admissible marking set in terms of a disjunction of transformed linear constraints. The optimality of the solution is guaranteed provided that certain conditions are satisfied during the intermediate steps of the iterative approach.
DOI:10.1109/WODES.2016.7497857