Timed substitutions for regular signal-event languages

DOI10.1007/S10703-007-0034-5zbMATH Open1129.68038OpenAlexW1980601361MaRDI QIDQ2385194FDOQ2385194

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

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

zbMATH Keywords

RefinementTimed automataAbstractionSubstitutionSignal-event word

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• A theory of timed automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Forward analysis of updatable timed automata
• Timed regular expressions
• Finite divergence
• Accepting zeno words: A way toward timed refinements
• A Kleene theorem for splitable signals
• Title not available (Why is that?)
• Intersection of Regular Signal-Event (Timed) Languages
• Refinements and Abstractions of Signal-Event (Timed) Languages

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)