From Timed Graphs to Hybrid Automata (Abstract)

Costas Courcoubetis. From Timed Graphs to Hybrid Automata (Abstract). In Bengt Jonsson, Joachim Parrow, editors, CONCUR 94, Concurrency Theory, 5th International Conference, Uppsala, Sweden, August 22-25, 1994, Proceedings. Volume 836 of Lecture Notes in Computer Science, pages 160, Springer, 1994.

@inproceedings{Courcoubetis94,
  title = {From Timed Graphs to Hybrid Automata (Abstract)},
  author = {Costas Courcoubetis},
  year = {1994},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Courcoubetis94},
  cites = {0},
  citedby = {0},
  pages = {160},
  booktitle = {CONCUR  94, Concurrency Theory, 5th International Conference, Uppsala, Sweden, August 22-25, 1994, Proceedings},
  editor = {Bengt Jonsson and Joachim Parrow},
  volume = {836},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-58329-7},
}