A uniform framework for timed automata

DOI10.4230/LIPICS.CONCUR.2016.26MaRDI QIDQ4608678zbMATH OpenOpenAlexFDO

Authors Tomasz Brengos, Marco Peressotti

Publication date 21 March 2018

Full work available at URL https://doi.org/10.4230/LIPIcs.CONCUR.2016.26

zbMATH Keywords

coalgebraslax functorsgeneral saturationtimed behavioural equivalencetimed language equivalence

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Categories of machines, automata (18B20)

Recommendations

• Behavioural equivalences for timed systems
• A categorical view of timed behaviours
• Unifying behavioral equivalences of timed transition systems
• scientific article; zbMATH DE number 1231625
• Axiomatising timed automata

Cited in

(10)

• scientific article; zbMATH DE number 1759410 (Why is no real title available?)
• A coalgebraic take on regular and \(\omega\)-regular behaviour for systems with internal moves
• On a simplified untiming procedure for supervisory control of timed automata when the time increases strictly monotonically
• Behavioural equivalences for timed systems
• Three Approaches to Timed External Choice in UTP
• Unambiguity in Timed Regular Languages: Automata and Logics
• Languages and models for hybrid automata: a coalgebraic perspective
• scientific article; zbMATH DE number 7471684 (Why is no real title available?)
• Timed semantics of message sequence charts based on timed automata
• The temporal logic of coalgebras via Galois algebras

This page was built for publication: A uniform framework for timed automata

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