The University of Insubria.
The University of Insubria The University of Insubria The University of Insubria The University of Indubria
The University of Insubria The University of Insubria logo The University of Insubria image bar  
The University of Insubria
The Univsersity of Insubria

 
The University of Insubria CV
The University of Insubria CV
The University of Insubria CV The University of Insubria CV Nicoletta Sabadini
The University of Insubria CV
 

Contact data

Full Professor
Department of Computer Science and Communication
Via Carloni 78
22100 Como IT
Tel: 031 2386315
E-mail:nicoletta.sabadini@uninsubria.it

 

Biography

Born in Lecco, September 3, 1956. Married, two children.
Completed the degree in Physics at the University of Milan in 1980, with 110/110 cum laude.
Researcher in Computer Science since 1983.
Associate Professor since 1989.
Full Professor in Computer Science since 1994.
Member of the Organizing or Program Committees of national and international conferences.
Site leader of Italian MIUR projects COFIN 1997, 1999, 2001.

 

Qualifications and awards

Member of the Council of the Italian Chapter of EATCS, since 1999. 
 

Research interests

Research activity mainly in theoretical computer science, principally concerned with complexity theory, formal languages, automata and algebraic methods in concurrency. In complexity theory, worked on models of computation, both sequential and parallel (Counting and Alternating Turing Machines, Oracle Turing Machines, Random Access Machines with arithmetical primitive.) Worked on Mazurkiewicz trace languages, introducing and studying the fundamental classes of recognizable and unambiguous trace languages. Worked on Asynchronous Automata, introduced by Zielonka as distributed model of computation, extending the main result of Zielonka to the probabilistic case.

Current interest concerns formal models of complex systems composed of interacting parts (asynchronous circuits, hybrid systems) using distributive categories and bicategories with feedback.

The results of the research have been presented in published journal articles and international conference papers (more than 50 papers). Numerous invitations to lecture at Italian and foreign universities.
 

Teaching experience and appointments

Has given courses on Algebra, Formal Methods in Computer Science, Formal Languages and Compilers, Foundations of Computer Science, Algorithms and Data Structures, Theoretical Computer Science, Automata and Formal Languages.

Supervisor of more than 200 Degree Theses in Computer Sciencee and Mathematics, and two Ph.D. students.

Member of the Committee of Doctorate in Computer Science since 1995 (University of Milano, and Consortium Milano- Insubria).

President for the Degree in Mathematics, years 1999-2001.

President of the Degree Information Sciences and
Technologies, years 2002-2005.

Vice Director of Department, 2004-2005.

Delegate of the Rector for Computer Science, since 2004.
 

Representative  publications

A.Bertoni, G.Mauri, N.Sabadini, A characterization of the class of functions computable in polynomial time on Random Access Machines, Proc.13th ACM STOC, pp.168-176, Milwaukee, 1981

A.Bertoni, M.Brambilla, G.Mauri, N.Sabadini, An application of the theory of free partially commutative monoids: asymptotic densities of trace languages, Proc 10th Symp. MFCS, Lect. Notes Comp. Sci. 118 (J.Gruska, M.Chytil eds), pp.205-215, Springer-Verlag, Berlin, 1981

A.Bertoni, G.Mauri, N.Sabadini, Equivalence and membership problems for regular trace languages, Proc. 9th ICALP, Lect. Notes Comp. Sci. 140 (M.Nielsen, E.M. Schmidt eds), pp. 61-71, Springer-Verlag, Berlin, 1982

A.Bertoni, G.Mauri, N.Sabadini, Simulations among classes of random access machines and equivalence among numbers succintly represented, Annals of Discrete Mathematics 25, pp.65-90, 1985

A.Bertoni, G.Mauri, N.Sabadini, Membership problems for regular and context-free trace languages, Information and Computation, vol. 82, N.2, pp.135-150, 1989

A.Bertoni, M.Goldwurm, N. Sabadini, The complexity of computing the number of strings of given length in context-free languages, Theoretical Computer Science, 86, pp. 325-342, 1991

P.Bonizzoni, G.Mauri, G.Pighizzini, N.Sabadini, Recognizing sets of labelled acyciclc graph, in "Tree, Automata and Languages" , (M.Nivat, A.Podelski eds), pp.201-224, Elsevier Publ., North Holland, 1992

A. Bertoni, P.Massazza, N.Sabadini, Holonomic generating functions and context free languages, International Journal of Foundations of Computer Science, vol. 3, N.2, pp.181-191, 1992,

D. Bruschi, G.Pighizzini, N.Sabadini, On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages, Information and Computation, Vol.108, No.2, 1994 .

A.Bertoni, M.Goldwurm, G. Mauri, N. Sabadini, Counting techniques for Inclusion, Equivalence and Membership problems , in "The book of traces" (V.Diekert, G.Rozenberg ed's), World Scientific, 1995, pp. 131-164.

Bloom S., Sabadini N, Walters RFC, Matrices, machines and behaviors. Applied Categorical Structures, 4, 343-360, 1996

Sabadini N, Vigna S, Walters RFC, A note on recursive functions Mathematical Structures in Computer Science, 6, 127-139, 1996.

Katis P, Sabadini N, Walters RFC, Bicategories of processes. Journal of Pure and Applied Algebra, 115, 141-178, 1997.

Jesi S., Pighizzini G., Sabadini N., Probabilistic Asynchronous Automata, Mathematical System Theory, 1997

Katis P, Sabadini N, Walters RFC, Span(Graph): an algebra of transition systems, Proceedings AMAST '97, SLNCS 1349, 322-336, 1997

Rosebrugh R., Sabadini N, Walters RFC, Minimal realization in bicategories of automata, MSCS, vol 8 issue 2, 93-116, 1998

Katis P., Sabadini N., Walters R. F. C. (2000); A formalisation of the IWIM Model. in: Proc. COORDINATION 2000,(Eds.) Porto A., Roman G.-C., LNCS 1906, 267-283, Springer Verlag, 2000.

Katis P, Sabadini N, Walters RFC, On the algebra of systems with feedback & boundary, Rendiconti del Circolo Matematico di Palermo Serie II, Suppl. 63 (2000) pp123-156

Gadducci F., Montanari U., Katis P., Sabadini N., Walters R.F.C., Comparing Cospan-spans & Tiles via a Hoare-style process calculus, 152-171, ENTCS 62, TOSCA Udine November 2001.

Katis P, Sabadini N, Walters R.F.C., Feedback, trace and fixed-point semantics , Theoret. Informatics Appl. 36, 181-194 (2002)

Sabadini N., Walters, R.F.C., Categorical algebras of automata, Talk to special session on Semigroups Automata and Formal Languages, AMS-UMI meeting Pisa, 12-16 June 2002, Notices of the American Mathematical Society

Sabadini N., Walters R.F.C., Hierarchical automata and P systems, CATS ’03, ENTCS 78, 1-15, 2003.

Rosebrugh R., Sabadini N, Walters RFC, Minization and minimal realization in Span(Graph), MSCS, Volume 14, pp 685-714, 2004

Katis P, Sabadini N, Walters R.F.C., Compositional minimization in Span(Graph): Some examples, Proceedings of the Final Workshop of the COMETA Project on Computational Metamodels, Edited by M. Lenisa and M. Miculan, Electronic Notes in Theoretical Computer Science 104C, pp. 181-197, 2004.

Cherubini A., Sabadini N,. Walters R.F.C., Timing in the Cospan-Span Model, Proceedings of the Final Workshop of the COMETA Project on Computational Metamodels, Edited by M. Lenisa and M. Miculan, Electronic Notes in Theoretical Computer Science 104C, pp. 81-97, 2004.

Katis P, Sabadini N, Walters RFC, On partita doppia, to appear TAC

Rosebrugh R., Sabadini N, Walters RFC, Symmetric separable algebras in monoidal categories and Cospan(Graph), talk CT04, Vancouver 2004.

Rosebrugh R., Sabadini N, Walters RFC, Generic commutative separable algebras and cospans of graphs, Theory and Applications of Categories, Vol. 15, CT2004, No. 6, pp 164-177, 2005.

 
   
leftmenu univ of insubria
 
 
 
CV CV