Symbolic unfoldings for networks of timed automata

Franck Cassez*, Thomas Chatain, Claude Jard

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

13 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationAutomated Technology for Verification and Analysis - 4th International Symposium, ATVA 2006
Subtitle of host publicationproceedings
EditorsSusanne Graf, Wenhui Zhang
Place of PublicationHeidelberg, Germany
PublisherSpringer, Springer Nature
Pages307-321
Number of pages15
Volume4218 LNCS
ISBN (Print)3540472371, 9783540472377
Publication statusPublished - 2006
Externally publishedYes
Event4th International Symposium on Automated Technology for Verification and Analysis, ATVA 2006 - Beijing, China
Duration: 23 Oct 200626 Oct 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4218 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Symposium on Automated Technology for Verification and Analysis, ATVA 2006
CountryChina
CityBeijing
Period23/10/0626/10/06

Fingerprint

Dive into the research topics of 'Symbolic unfoldings for networks of timed automata'. Together they form a unique fingerprint.

Cite this