Simulation and Bisimulation for Probabilistic Timed Automata

DOI10.1007/978-3-642-15297-9_17zbMath1290.68081MaRDI QIDQ3588096

Angelo Troina, Jeremy Sproston

Publication date: 10 September 2010

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

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

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Weak bisimulation for probabilistic timed automata, Unwinding biological systems