Symbolic Simulation-Checking of Dense-Time Automata

DOI10.1007/978-3-540-75454-1_25MaRDI QIDQ3510852zbMATH OpenOpenAlexFDO

Authors Farn Wang

Publication date 3 July 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75454-1_25

zbMATH Keywords

bisimilaritybisimulationdense-timeembeddedequivalenceeventsimplementationmodel-checkingreal-timerefinementsimulationtimed automataverification

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Theoretical Aspects of Computing – ICTAC 2005
• Symbolic Branching Bisimulation-Checking of Dense-Time Systems in an Environment
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Symbolic verification and analysis of discrete timed systems
• Symbolic model checking for probabilistic timed automata
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Improvements for the Symbolic Verification of Timed Automata
• scientific article; zbMATH DE number 1324667
• Symbolic model checking for real-time systems

Cited in

(6)

• Time-Progress Evaluation for Dense-Time Automata with Concave Path Conditions
• Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format
• Symbolic Branching Bisimulation-Checking of Dense-Time Systems in an Environment
• scientific article; zbMATH DE number 1324667 (Why is no real title available?)
• An automatic technique for checking the simulation of timed systems
• Theoretical Aspects of Computing – ICTAC 2005

This page was built for publication: Symbolic Simulation-Checking of Dense-Time Automata

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