Timed Unfoldings for Networks of Timed Automata

DOI10.1007/11901914_23zbMath1161.68614OpenAlexW1506579115MaRDI QIDQ3522916

Serge Haddad, Pierre-Alain Reynier, Patricia Bouyer

Publication date: 4 September 2008

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://basepub.dauphine.fr/handle/123456789/5084

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

Semantic domains of timed event structures ⋮ Regular set of representatives for time-constrained MSC graphs ⋮ Distributed Timed Automata with Independently Evolving Clocks ⋮ Event clock message passing automata: a logical characterization and an emptiness checking algorithm ⋮ Symbolic unfolding of parametric stopwatch Petri nets ⋮ Timed Petri nets and timed automata: On the discriminating power of Zeno sequences ⋮ Unifying behavioral equivalences of timed transition systems ⋮ Checking conformance for time-constrained scenario-based specifications

This page was built for publication: Timed Unfoldings for Networks of Timed Automata