A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA

DOI10.1142/S0129054106004133zbMath1098.68074MaRDI QIDQ5484905

Akio Nakata, Teruo Higashino, Suguru Sasaki, Tadaaki Tanimoto

Publication date: 21 August 2006

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

abstractionequivalence checkingparametric timed automatareal-time communicating systemstimed failure equivalence

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• A brief history of Timed CSP
• Symbolic bisimulations
• Parametric timing analysis for real-time systems
• The timed failures -- Stability model for CSP
• Testing equivalences for processes
• An operational semantics for timed CSP
• A process algebra for timed systems

This page was built for publication: A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA