Timed bisimulation and open maps
| Autor: | Thomas Hune, Mogens Nielsen |
|---|---|
| Rok vydání: | 1998 |
| Předmět: |
Algebra
Bisimulation Range (mathematics) TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Computer science TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Computer Science::Logic in Computer Science Concurrency Computer Science::Programming Languages Automata theory Algorithm Computer Science::Formal Languages and Automata Theory Decidability |
| Zdroj: | Mathematical Foundations of Computer Science 1998 ISBN: 9783540648277 MFCS |
| DOI: | 10.1007/bfb0055787 |
| Popis: | Open maps have been used for defining bisimulations for a range of models, but none of these have modelled real-time. We define a category of timed transition systems, and use the general framework of open maps to obtain a notion of bisimulation. We show this to be equivalent to the standard notion of timed bisimulation. Thus the abstract results from the theory of open maps apply, e.g. the existence of canonical models and characteristic logics. Here, we provide an alternative proof of decidability of bisimulation for finite timed transition systems in terms of open maps, and illustrate the use of open maps in presenting bisimulations. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|