July 3rd, 2009
Università degli Studi di Trieste
Aula Torretta
Polo Universitario di Gorizia,
Via Diaz Armando, 5, Gorizia, Italy
The workshop begins at 10:00am.
The notion of bisimulation is ubiquitous in Mathematics and Computer Science. It plays a central role in the semantics of modal logic and in automata theory. It has migrated into the theory of (hyper)sets and into coalgebra and category theory, while becoming, at the same time, a standard tool in specific applications. Bisimulation is used in Model Checking to shrink the models, while strongly preserving their semantics. On the one hand, in standard Model Checking, this reduction enables one to improve the efficiency of verification algorithms. On the other hand, in Model Checking over Hybrid Automata the bisimulation quotient allows one to map infinite structures over finite ones, thus providing in many interesting cases the decidability of the analysis. In Concurrency Theory the notion of bisimulation is used to establish process equivalence. In this sense, it has been exploited in the context of security for the definition of non-interference properties. This workshop aims at investigating bisimulations from three main viewpoints: coalgebraic, set-theoretic, and algorithmic. It is hoped that this event will stimulate the aggregation of a research community whose participants will contribute converging views on bisimulations from different angles.
Topics of interests include (but are not limited to):
Abstract submission deadline: June 3, 2009
Notification: June 13, 2009
Workshop: July 3, 2009
Abstract must be submitted via email to tab@dmi.units.it
Università degli studi di Trieste 
