Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets

@inproceedings{Srba2008ComparingTE,
  title={Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets},
  author={Jir{\'i} Srba},
  booktitle={FORMATS},
  year={2008}
}
Time dependant models have been intensively studied for many reasons, among others because of their applications in software verification and due to the development of embedded platforms where reliability and safety depend to a large extent on the time features. Many of the time dependant models were suggested as real-time extensions of several well-known untimed models. The most studied formalisms include Networks of Timed Automata which extend the model of communicating finite-state machines… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 30 extracted citations

References

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

Uppaal in a nutshell

International Journal on Software Tools for Technology Transfer • 1997
View 8 Excerpts
Highly Influenced

Romeo: A tool for time Petri net analysis

Ch. Seidner, G. Gardey, D. Lime, M. Magnin, O. Roux
2008
View 3 Excerpts
Highly Influenced

Timed Petri Nets and BQOs

View 5 Excerpts
Highly Influenced

A Theory of Timed Automata

Theor. Comput. Sci. • 1994
View 9 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…