39 search results - page 4 / 8 » A Categorical Axiomatics for Bisimulation |
LICS
2000
IEEE
15 years 1 months ago
2000
IEEE
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined, embodying the equational properties of iteration theories. We p...
106
Voted
TLCA
1997
Springer
15 years 1 months ago
1997
Springer
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
SEFM
2006
IEEE
15 years 3 months ago
2006
IEEE
We define a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is defin...
MFCS
1991
Springer
15 years 1 months ago
1991
Springer
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...