Petri Nets with Time and Cost ( Tutorial )

@inproceedings{Atig2013PetriNW,
  title={Petri Nets with Time and Cost ( Tutorial )},
  author={Mohamed Faouzi Atig and Parosh Aziz Abdulla},
  year={2013}
}
Petri nets [13, 12] are a widely used model for the study and analysis of concurrent systems. Many different formalisms have been proposed which extend Petri nets with clocks and real-time constraints, leading to various definitions of Timed Petri nets (TPNs) (see [10, 6] for surveys). In parallel, there have been several works on extending the model of timed automata [4] with prices (weights) (see e.g., [5, 11, 8]). Weighted timed automata are suitable models for embedded systems, where we… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Computing Optimal Coverability Costs in Priced Timed Petri Nets

2011 IEEE 26th Annual Symposium on Logic in Computer Science • 2011
View 5 Excerpts

The reachability problem for Vector Addition Systems with one zerotest

T. Brihaye P. Bouyer, V. Bruyère, J. Raskin
2011

Reachability in Petri Nets with Inhibitor Arcs

Electr. Notes Theor. Comput. Sci. • 2008

Comparison of Different Semantics for Time Petri Nets

F. Cassez B. Bérard, S. Haddad, O. Roux
2005

Similar Papers

Loading similar papers…