Retrieved from ""

Temporal logic and bisimulation


2011-02-02, Dept. of Computer Science, University of Hamburg

Temporal logic and bisimulation

This talk was held in the course Formal foundations of informatics 3. By explaining some simple examples, we showcased trace equivalence and bisimulation in transition systems. Afterwards, we introduced several temporal logics, examined how their respective term equivalence relates to trace equivalence and/or bisimulation and finally proved the relations.



Please DO NOT enter anything into the next three fields, they are used as bait for automated entries. If any of the following fields is not left empty, the comment will not be saved!

End of protection - from here on, you can safely enter data.

Comments may be formatted using Markdown.

emphasis *emphasis* or _emphasis_
strong emphasis **strong emphasis** or __strong emphasis__
new paragraph insert an empty line


> quote
  • unordered
  • list
* unordered
* list
  1. ordered
  2. list
1. ordered
2. list
weblink [weblink](
Note: You can only post weblinks if you are authenticated via OpenID.
More and longer examples are available at Daring Fireball.
No comments yet.