Timed Unfoldings for Networks of Timed Automata

DOI10.1007/11901914_23MaRDI QIDQ3522916zbMATH OpenOpenAlexFDO

Authors Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier

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)

Recommendations

• Symbolic Unfoldings for Networks of Timed Automata
• Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
• scientific article; zbMATH DE number 1361125
• scientific article; zbMATH DE number 1361136
• Symbolic unfolding of parametric stopwatch Petri nets

Cited in

(13)

• Unifying behavioral equivalences of timed transition systems
• Event clock message passing automata: a logical characterization and an emptiness checking algorithm
• Symbolic unfolding of parametric stopwatch Petri nets
• Checking conformance for time-constrained scenario-based specifications
• Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
• Adding Invariants to Event Zone Automata
• Symbolic Unfoldings for Networks of Timed Automata
• Distributed Timed Automata with Independently Evolving Clocks
• Regular set of representatives for time-constrained MSC graphs
• Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata
• A local-time semantics for negotiations
• Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
• Semantic domains of timed event structures

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522916)