Symbolic Unfoldings for Networks of Timed Automata. Cassez, F., Chatain, T., & Jard, C. In Graf, S. & Zhang, W., editors, Automated Technology for Verification and Analysis, 4th International Symposium, ATVA 2006, Beijing, China, October 23-26, 2006., volume 4218, of Lecture Notes in Computer Science, pages 307–321, 2006. Springer.
Symbolic Unfoldings for Networks of Timed Automata [pdf]Paper  Symbolic Unfoldings for Networks of Timed Automata [pdf]Slides  Symbolic Unfoldings for Networks of Timed Automata [link]Link  doi  abstract   bibtex   
In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Symbolic nets are standard occurrence nets extended with read arcs and symbolic constraints on places and transitions. We prove that there is a complete finite prefix for any NTA that contains at least the information of the simulation graph of the NTA but keep explicit the notions of concurrency and causality of the network.
@inproceedings{DBLP:conf/atva/CassezCJ06,
  author    = {Franck Cassez and
               Thomas Chatain and
               Claude Jard},
  editor    = {Susanne Graf and
               Wenhui Zhang},
  title     = {Symbolic Unfoldings for Networks of Timed Automata},
  booktitle = {Automated Technology for Verification and Analysis, 4th International
               Symposium, {ATVA} 2006, Beijing, China, October 23-26, 2006.},
  pages     = {307--321},
  year      = {2006},
          Type = {B - International Conferences},

  series    = {Lecture Notes in Computer Science},
  volume    = {4218},
  publisher = {Springer},
  urlpaper = {papers/unfolding-rr-06.pdf},
  urlslides = {papers/slides-atva-06.pdf},
  url_link       = {http://dx.doi.org/10.1007/11901914_24},
  doi       = {10.1007/11901914_24},
  abstract = {In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Symbolic nets are standard occurrence nets extended with read arcs and symbolic constraints on places and transitions. We prove that there is a complete finite prefix for any NTA that contains at least the information of the simulation graph of the NTA but keep explicit the notions of concurrency and causality of the network.},
  keywords = {unfoldings, timed automata},
}


%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% 2005
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Downloads: 0