B O S T O N   U N I V E R S I T Y
                      Computer Science Department
                          C O L L O Q U I U M
				
                   Wednesday, Wednesday, October 25, 3:00pm
                        Seminar Room / MCS 135


                         Dr. Alin Stefanescu
	    Department for Computer and Information Science 
		   University of Konstanz, Germany
               

               Synthesis of Distributed Transition Systems

Abstract:

In this talk we present a methodology to construct distributed implementations from global specifications. Here the distributed implementations are modeled as synchronous products of transition systems, respectively asynchronous automata, and the global specification as a classical transition system. As correctness criteria for implementation w.r.t. the specification, we consider graph-isomorphism, trace-equivalence, respectively bisimilarity. This presentation will cover: (a) preliminaries and characterizations for the above class of distributed systems, (b) distributability tests for the global specifications and heuristics for obtaining smaller distributed implementations, together with (c) an exemplification  of the synthesis procedure in the area of distributed algorithms.

Short Biography:

Alin Stefanescu received BS and MS degrees in Computer Science from the University of Bucharest, Romania. He got his PhD from the University of Stuttgart in 2005. During his PhD work, he also spent time at the Technical University of Munich and at the University of Edinburgh. He is currently a postdoctoral researcher at the University of Konstanz. 

 
Hosts: Calin Belta (MFG/ENG)
       Azer Bestavros (CS/CAS)