spn_traps.h File Reference

All minimal traps of a stochastic Petri net (Murata 1989, sec. More...

#include <cstddef>
#include <vector>
#include "line/api/spn/spn_net.h"

Include dependency graph for spn_traps.h:

Go to the source code of this file.

Classes
struct	line::spn::SpnTraps

Namespaces
namespace	line
	Conservation laws of a layered queueing network, enumerated from its structure.
namespace	line::spn

Functions
template<class T>
SpnTraps	line::spn::spn_traps (const qn::NetworkStruct< T > &sn, const std::vector< double > &init=std::vector< double >())

Detailed Description

All minimal traps of a stochastic Petri net (Murata 1989, sec.

VI-A). A trap Q has Q* contained in *Q: once marked it stays marked. Traps are the siphons of the reverse net, so the enumeration and its worst-case exponential cost are those of spn_siphons with Pre and Post swapped. marked(i) is true when trap i holds a token at m0. The check is structural: inhibitor arcs, priorities and the timed/immediate split are ignored. MATLAB twin: matlab/src/api/spn/spn_traps.m.

Definition in file spn_traps.h.