Skip to main content

3 Result(s)

within J. J. M. M. Rutten Remove this filter Computer Science Remove this filter Programming Techniques Remove this filter Theory of Computation Remove this filter

and

  1. 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)

  2. No Access

    Chapter and Conference Paper

    The failure of failures in a paradigm for asynchronous communication

    We develop a general framework for a variety of concurrent languages all based on asynchronous communication, like data flow, concurrent logic, concurrent constraint languages and CSP with asynchronous channel...

    F. S. de Boer, J. N. Kok, C. Palamidessi, J. J. M. M. Rutten in CONCUR '91 (1991)

  3. No Access

    Chapter and Conference Paper

    Contractions in comparing concurrency semantics

    We define for a simple concurrent imperative language both operational and denotational semantic models as fixed points of contractions on complete metric spaces. Next, we develop a general method for comparin...

    J. N. Kok, J. J. M. M. Rutten in Automata, Languages and Programming (1988)