@inproceedings{987e37f02439409693934266f8f76e09,
title = "Symbolic unfoldings for networks of timed automata",
abstract = "In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Extended 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.",
author = "Franck Cassez and Thomas Chatain and Claude Jard",
year = "2006",
language = "English",
isbn = "3540472371",
volume = "4218 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer, Springer Nature",
pages = "307--321",
editor = "Susanne Graf and Wenhui Zhang",
booktitle = "Automated Technology for Verification and Analysis - 4th International Symposium, ATVA 2006",
address = "United States",
note = "4th International Symposium on Automated Technology for Verification and Analysis, ATVA 2006 ; Conference date: 23-10-2006 Through 26-10-2006",
}