58 search results - page 4 / 12 » Relating Coalgebraic Notions of Bisimulation |
CONCUR
1998
Springer
13 years 11 months ago
1998
Springer
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of universal coalgebr...
STACS
2001
Springer
13 years 11 months ago
2001
Springer
Coalgebras for a functor on the category of sets subsume many formulations of the notion of transition system, including labelled transition systems, Kripke models, Kripke frames a...
BIRTHDAY
2003
Springer
14 years 18 days ago
2003
Springer
Equivalence between designs is a fundamental notion in verification. The linear and branching approaches to verification induce different notions of equivalence. When the designs...
IANDC
2006
13 years 7 months ago
2006
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
QEST
2005
IEEE
14 years 28 days ago
2005
IEEE
We consider bisimulation and weak bisimulation relations in the context of the Labeled Markov Chains of Hansson and Jonsson, the Concurrent Labeled Markov Chains of Philippou, Lee...