Symbolic Simulation-Checking of Dense-Time Automata

DOI10.1007/978-3-540-75454-1_25zbMath1141.68441OpenAlexW1501354277MaRDI QIDQ3510852

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

verificationequivalencesimulationtimed automatamodel-checkingbisimulationimplementationrefinementreal-timeeventsbisimilarityembeddeddense-time

Mathematics Subject Classification ID

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

Related Items (2)

Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format ⋮ Symbolic Branching Bisimulation-Checking of Dense-Time Systems in an Environment

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