We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finite-state specification can be reduced to a model...
Abstract. We answer an open question related to bisimilarity checking on labelled transition systems generated by prefix rewrite rules on words. Stirling (1996, 1998) proved the de...
Based on the conceptual representation of objects in space and time as introduced in Temporal Concept Analysis first steps are done into the direction of a conceptual theory of ...
We demonstrate a simple artificial chemistry environment in which two small evolutionary transitions from the simplest self-replicators to larger ones are observed. The replicator...
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
Krishnendu Chatterjee, Laurent Doyen, Herbert Edel...