Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9657819 | Theoretical Computer Science | 2005 | 38 Pages |
Abstract
We also link the coalgebraic semantics with a slightly improved version of history dependent (HD) automata, a model developed for verification purposes, where states have local names and transitions are decorated with names and name relations. HD-automata associated with agents with a bounded number of threads in their derivatives are finite and can be actually minimized. We show that the bisimulation relation in the coalgebraic context corresponds to the minimal HD-automaton.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ugo Montanari, Marco Pistore,