A model checking decision procedure for sequential recursive Petri nets

the silent closure issue (i.e. the diagnosis function does not look for what could have happened after the last observed event of σ), only unobservable events occurring before or

Moreover, one can compute the minimum and maximum elapsed time through every path of the graph which permits on- the-fly verification of timed reachability properties (e.g., is

We deal with the class of bounded nets restricted to disallow multiple enabledness of transitions, and present the method of reachability testing based on a translation into

To achieve these objectives we have built a benchmark in which 14 different algorithms for variable orderings have been implemented and compared on state space generation of the

The main idea in mapping BPEL basic activities to CPNs is: each primitive data is mapped to a place, each basic activity is mapped to a transition, and P re and P ost matrices

The user interface enables the insertion of IOPT Petri net model files, model visualization, automatic controller code generation, state space generation and visualization, query

TAPAAL [11], for instance, is an explicit-state model checker that combines Partial-Order Reduction techniques and structural reductions and can check property on Petri nets

This paper investigates the problem of pattern di- agnosis of systems modeled as bounded labeled Petri nets that extends the diagnosis problem on single fault events to more