Skip to main content

3 Result(s)

within J. J. M. M. Rutten Remove this filter Computer Science Remove this filter Computer Communication Networks Remove this filter Programming Techniques Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Automata and coinduction (an exercise in coalgebra)

    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) coalgebra. This leads to a transparent...

    J. J. M. M. Rutten in CONCUR'98 Concurrency Theory (1998)

  2. No Access

    Chapter and Conference Paper

    Bisimulation for probabilistic transition systems: A coalgebraic approach

    The notion of bisimulation as proposed by Larsen and Skou for discrete probabilistic transition systems is shown to coincide with a coalgebraic definition in the sense of Aczel and Mendier in terms of a set fu...

    E. P. de Vink, J. J. M. M. Rutten in Automata, Languages and Programming (1997)

  3. No Access

    Chapter and Conference Paper

    Correctness and full abstraction of metric semantics for concurrency

    Four different semantic models are given for a simple uniform programming language, containing constructs for parallel composition, global nondeterminism and communication: linear semantics, failure semantics,...

    J. J. M. M. Rutten in Linear Time, Branching Time and Partial Or… (1989)