On the determinization of timed systems

DOI10.1007/978-3-319-65765-3_2MaRDI QIDQ1683431zbMATH OpenOpenAlexFDO

Authors Patricia Bouyer, Samy Jaziri, Nicolas Markey

Publication date 1 December 2017

Full work available at URL https://doi.org/10.1007/978-3-319-65765-3_2

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Determinization of timed Petri nets behaviors
• A proof system for timed automata
• Formal Modeling and Analysis of Timed Systems
• Verification of continuous dynamical systems by timed automata
• Bounded model checking for timed systems
• A proof-based method for modelling timed systems
• Determinisability of register and timed automata
• Reachability in timed counter systems
• On specifications and proofs of timed circuits

Cited in

(13)

• Bounded determinization of timed automata with silent transitions
• Failure detection and localization for timed event graphs in (,+)-algebra
• Bounded determinization of timed automata with silent transitions
• A game approach to determinize timed automata
• Determinization of timed Petri nets behaviors
• When Are Timed Automata Determinizable?
• Synthesis of Non-Interferent Timed Systems
• scientific article; zbMATH DE number 2064461 (Why is no real title available?)
• On the construction of live timed systems
• scientific article; zbMATH DE number 2104628 (Why is no real title available?)
• Robust undecidability of timed and hybrid systems
• New time hierarchy results for deterministic TMS
• The Unmet Challenge of Timed Systems

This page was built for publication: On the determinization of timed systems

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