Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Lehrstuhl Informatik 2 Zeit: Dienstag, 26. Jan. 2010, 10:00 Uhr

Summary: Lehrstuhl Informatik 2
Zeit: Dienstag, 26. Jan. 2010, 10:00 Uhr
Ort: Raum 5056, Ahornstr. 55
Referent: Prof. Dr. Franck van Breugel,
York University, Toronto
Titel: Behavioural Pseudometrics
Concurrent systems are often modelled by means of labelled transition systems. A labelled transition
system is similar to a nondeterministic finite automaton. In contrast to a finite automaton, the set of
states and the set of actions of a labelled transitions may be infinite. Furthermore, a labelled transition
system does usually not have an initial state or final states.
A behavioural equivalence is an equivalence relation on the states of a labelled transition system.
Such a relation captures which states behave the same. Many different behavioural equivalences
have been proposed. Bisimilarity is considered to be one of the key behavioural equivalences for la-
belled transition systems.
To model concurrent systems in which quantitative data, such as probabilities and time, play a crucial
role, several variations on labelled transition systems have been put forward. Notions of behavioural
equivalence like bisimilarity have been adapted to these systems. However, such discrete Boolean-
valued notions (states are either behaviourally equivalent or they are not) sit uneasily with systems


Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)


Collections: Computer Technologies and Information Sciences