Symbolic Branching Bisimulation-Checking of Dense-Time Systems in an Environment

DOI10.1007/978-3-642-00602-9_40zbMath1237.68127OpenAlexW1543600830MaRDI QIDQ3624601

Farn Wang

Publication date: 30 April 2009

Published in: Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00602-9_40

zbMATH Keywords

algorithmstimed automataexperimentsmodel-checkingbranching bisimulationTCTL

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Equivalence checking 40 years after: a review of bisimulation tools

Uses Software

• Kronos

Cites Work

• Unnamed Item
• Characterizing finite Kripke structures in propositional temporal logic
• Kronos: A verification tool for real-time systems
• Symbolic Simulation-Checking of Dense-Time Automata
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Symbolic Branching Bisimulation-Checking of Dense-Time Systems in an Environment