scientific article; zbMATH DE number 1759410

MaRDI QIDQ4536359zbMATH OpenFDO

Authors Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, A. Petit

Publication date 4 November 2002

Mathematics Subject Classification ID

Formal languages and automata (68Q45) 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

• Updatable timed automata
• Forward analysis of updatable timed automata
• On the expressiveness of parametric timed automata
• Updatable Timed Automata with Additive and Diagonal Constraints
• On termination and boundedness of nested updatable timed automata
• Parametric updates in parametric timed automata
• On reachability analysis of updatable timed automata with one updatable clock
• scientific article; zbMATH DE number 5587265
• scientific article; zbMATH DE number 5228180
• A uniform framework for timed automata

Cited in

(9)

• On termination and boundedness of nested updatable timed automata
• scientific article; zbMATH DE number 1670795 (Why is no real title available?)
• Removing all silent transitions from timed automata
• Updatable timed automata
• Task automata: Schedulability, decidability and undecidability
• \(\varepsilon\)-transitions in concurrent timed automata
• Low dimensional hybrid systems -- decidable, undecidable, don't know
• Concurrency in timed automata
• Updatable Timed Automata with Additive and Diagonal Constraints

Describes a project that uses

Uses Software

• HyTech

This page was built for publication:

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