244 search results - page 1 / 49 » Towards Coalgebraic Behaviourism |
ENTCS
2002
13 years 4 months ago
2002
In this paper we show that it is possible to model observable behaviour of coalgebras independently from their internal dynamics, but within the general framework of representing ...
IANDC
2010
13 years 3 months ago
2010
The semantics of name-passing calculi is often defined employing coalgebraic models over presheaf categories. This elegant theory lacks finiteness properties, hence it is not ap...
MFCS
1997
Springer
13 years 8 months ago
1997
Springer
The aim of this paper is an integration of graph grammars with different kinds of behavioural constraints, in particular with temporal logic constraints. Since the usual algebraic ...
CALCO
2009
Springer
13 years 11 months ago
2009
Springer
The operational semantics of interactive systems is usually described by labeled transition systems. Abstract semantics (that is defined in terms of bisimilarity) is characterized...
ENTCS
2002
13 years 4 months ago
2002
In previous work [14] I introduced a generalised notion of coalgebra that is capable of modelling binary methods as they occur in object-oriented programming. An important problem...