theoretical computer science, probabilistic bisimulation is an extension of the concept of bisimulation for fully probabilistic transition systems first described...

In theoretical computer science a bisimulation is a binary relation between state transition systems, associating systems that behave in the same way in...

abbreviations are used: Equivalences: SB: Strong Bisimulation WB: Weak Bisimulation BB: Branching Bisimulation STE: Strong Trace Equivalence WTE: Weak Trace...

Attributed Type Signatures University of Toronto 2000 Jelle Gerbrandy Bisimulations on Planet Kripke University of Amsterdam Khalil Sima'an Learning Efficient...

Jagadeesan (De Paul University). “The metric analogue of weak bisimulation for probabilistic processes” was deemed one of the two most influential papers...

compare pairs of automata using a choice of equivalence (bisimulation, branching bisimulation, or decorated traces) Model checker: given a model of a system...

Segala & Nancy Lynch: "Probabilistic Simulations for Probabilistic Processes" (CONCUR 1994) Davide Sangiorgi: "A Theory of Bisimulation for the pi-Calculus"...

Several equivalence checking tools (minimization and comparisons modulo bisimulation relations), such as BCG_MIN and BISIMULATOR. Several model-checkers for...

Tracker). Selected works: Larsen, K. G.; Skou, A. (1991). "Bisimulation through probabilistic testing. Information and computation". Information and Computation...

chapter explores formal ways to compare transition systems, such as bisimulation; the eighth is about partial order reductions that aim to reduce the...

algorithm he and Paris Kanellakis developed for deciding Robin Milner's bisimulation. Smolka is a Fellow of the European Association for Theoretical Computer...