Timed substitutions for regular signal-event languages

DOI10.1007/S10703-007-0034-5MaRDI QIDQ2385194zbMATH OpenOpenAlexFDO

Authors Paul Gastin, A. Petit, Béatrice Bérard

Publication date 11 October 2007

Published in Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10703-007-0034-5

zbMATH Keywords

AbstractionRefinementSignal-event wordSubstitutionTimed automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Refinements and Abstractions of Signal-Event (Timed) Languages
• Intersection of Regular Signal-Event (Timed) Languages
• Timed regular expressions
• A Kleene theorem for splitable signals
• On timed regular languages defined by inverse monoid morphisms

Cites work

• A Kleene theorem for splitable signals
• A theory of timed automata
• Accepting zeno words: A way toward timed refinements
• Finite divergence
• Forward analysis of updatable timed automata
• scientific article; zbMATH DE number 177824 (Why is no real title available?)
• scientific article; zbMATH DE number 1337733 (Why is no real title available?)
• scientific article; zbMATH DE number 1500522 (Why is no real title available?)
• scientific article; zbMATH DE number 2206109 (Why is no real title available?)
• Intersection of Regular Signal-Event (Timed) Languages
• Refinements and Abstractions of Signal-Event (Timed) Languages
• Timed regular expressions

Cited in

(2)

• Intersection of Regular Signal-Event (Timed) Languages
• Refinements and Abstractions of Signal-Event (Timed) Languages

This page was built for publication: Timed substitutions for regular signal-event languages

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