Accepting zeno words: A way toward timed refinements

DOI10.1007/S002360050003zbMATH Open0957.68053OpenAlexW2053941852MaRDI QIDQ1581898FDOQ1581898

Authors: Béatrice Bérard, Claudine Picaronny 

Publication date: 10 October 2000

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050003

Recommendations

• scientific article; zbMATH DE number 1361474
• Coarse abstractions make Zeno behaviours difficult to detect
• Coarse abstractions make Zeno behaviours difficult to detect
• Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences
• Refinement of time

zbMATH Keywords

real-time systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (4)

• Title not available (Why is that?)
• A Kleene theorem for splitable signals
• Timed substitutions for regular signal-event languages
• Quantitative temporal logics over the reals: PSpace and below

This page was built for publication: Accepting zeno words: A way toward timed refinements

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