ANNA LABELLA

Full professor

email: anna.labella@uniroma1.it
phone: 0649255159
building: G viale Regina Elena, 295
room: G 39

Personal data

Degree in Mathematics july, 25 -1970 by University of Rome.
Degree in Philosophy june, 19 -1989 by Gregoriana University.

Assistant Professor in Algebra from 1973
Associated Professor in Foundations of Mathematics from 1980
Full Professor in Computer Science from 2000
From june 2001 to october 2004 Director of Studies in Computer Science
always by the Faculty of Sciences of the "Sapienza" University of Rome, now Facoltà di Ingegneria dell'Informazione, Informatica e Statistica.


From 1992 to 1995 invited teacher of Logics at the Philosophy Faculty of Gregoriana University.
In different times from 1975 to 2000 teacher of Foundations of Mathematics and Mathematical logic in the curricula of Mathematics and Computer Science.
Teacher of Mathematical logic for the PhD in Mathematics, Model Theory for the PhD in Computer Science in La Sapienza and di Logic and Computer Science in the university of Siena.
Presently teacher of Mathematical methods in Computer Science
and Formal Methods in Software Specification and Verification for Computer Science curricula at "Sapienza" University of Rome.

From 1981 to 1987 scientific assistant of "Istituto di Analisi dei Sistemi e Informatica - C.N.R".
Teacher at Banach School in Warsaw (Poland).
Visiting professor at IRISA in Rennes (France) and at University of Szeged (Hungary).
Responsible for European Community project HCM EXPRESS 1994-97, site of Rome.
Reviewer of Mathematical Reviews and Zentralblatt
Chair of the workshop FICS'01.
Chair of Didamatica congress in april 2010 in Rome.

Main interests: Category theory, concurrency, algebraic semantics, language theory.
I cultivated also an interest in foundations of mathematics and teaching.

Selected Papers

JOURNALS
Labella, A. and Pettorossi, A.: Categories for modelling communicating processes.
Comp. and Art. Intell., 6 , (1987) 279-296.

Kasangian,S., Labella,A.: Enriched Categorical Semantics for Distributed Calculi.
J. of Pure and Applied Algebra, 83, (1992) 295-321.

Esik,Z., Labella,A.: Equational Properties of Iteration in Algebraically Complete Categories.
Th. Comp. Science, 195, (1998) 61-89

Bottoni,P., Labella,A., Paun,G.: Chomsky Hierarchies of Pattern Languages.
Ann. of the Bucharest University. Math.-Inform. Series, 47, (1998) 27-34.

Bottoni,P., Labella,A., Mussio,P., Paun,G.: Pattern Control on Derivation in Context-Free Rewriting.
J. of Automata, Languages and Combinatorics, 3, (1998) 3-28.

Kasangian,S., Labella,A.: Observational trees as models for concurrency.
Math. Struct in Comp. Science, 9, (1999) 687-718.

Corradini,F., De Nicola,R., Labella,A.:Models of nondeterministic regular expressions.
J. of Comp. Sys. Science, 59, (1999) 412-449.

Corradini,F., De Nicola, R., Labella,A.: A finite axiomatization of nondeterministic regular expressions,
Theor. Informatics and Appl. 33 (1999) 447-465.

Bloom,S.L., Ésik,Z., Labella,A., Manes,E.G.: Iteration 2-theories,
Applied Categorical Structures 9 (2001), 173-216.

Kelly,M., Labella,A., Schmitt,V., Street,R.: Categories enriched on two sides.
J. Pure Appl. Algebra, 168 (1) (2002), 53-98.

Corradini,F., De Nicola,R., Labella,A.: An Equational Axiomatization of Bisimulation over Regular Expressions.
J. of Logic and Computation, 12 (2) (2002), 301-20

Labella,A.: Categories with sums and right distributive tensor product.
J. Pure Appl. Algebra, 178 (3), (2003) 273-296.

De Nicola,R., Labella,A.: Nondeterministic regular expressions as solutions of equational systems
Theor. Comp. Science, 302, (2003) 179-189.

Bottoni, P., Labella,A., Manca,V., Mitrana,V.: Superposition Based on Watson-Crick-like Complementarity
Theory Comput. Systems, 39 (4) (2006) 503 – 524.

Bottoni,P., Labella,A.: Pointed pictures.
J. of Visual Languages and Computing, 18 (5) (2007) 523-536.

Kasangian,S., Labella ,A.: Conduché property and Tree-based categories.
J. Pure Appl. Algebra, 214, (2010), 221-235.

De Nicola,R., Gorla,D., Labella,A.: Tree-Functors, Determinacy and Bisimulations, Math. Struct in Comp. Science, 20, (2010) 319-358.

Bottoni,P., Labella,A., Manea,F., Mitrana.V., Petre,I. and Sempere,J. M.: Complexity-preserving simulations among three variants of accepting networks of evolutionary processors.
Natural Computing, 10 (1), (2011) 429-445.

Bordihn, H., Bottoni, P., Labella, A., Mitrana, V.:
Networks of Picture Processors as Problem Solvers, Soft Computing, (), 1-13, DOI: 10.1007/s00500-016-2206-y Soft Comput (2017) 21: 5529-5541

Bottoni, P., Labella, A., Mitrana, V.:
Networks of Polarized Multiset Processors, JCSS, Available online 23 November 2016
http://dx.doi.org/10.1016/j.jcss.2016.11.006
J. Comput. Syst. Sci. (2017) 85: 93-103

Bottoni, P., Labella, A., Mitrana, V.:
Prefix-Suffix Square Reduction, TCS, (2017) 682: 49-56
DOI: 10.1016/j.tcs.2016.12.005

Bottoni, P., Gorla, D., Kasangian, S., Labella, A.: A doctrinal approach to modal/temporal Heyting logic and non-determinism in processes, Math. Struct. in Comp. Science (2018) 28: 508-532

Bottoni, P., Labella, A., G. Rozenberg:
Networks of reaction systems, on Victor Mitrana's 60th birthday, International Journal of Foundations of Computer Science, 2018, in press.

Bottoni, P., Labella, A., G. Rozenberg:
Reaction systems with influence on environment, 2018, submitted to Membrane computing, accepted

PROCEEDINGS OF INTERNATIONAL CONFERENCES


Kasangian,S., Labella,A.: On continuous time agents.
MFPS, LNCS 598, Springer,1992, 403-425.

De Nicola,R., Labella,A.: A completeness theorem for nondeterministic Kleene Algebras.
MFCS'94, LNCS 841, Springer,1994, 536-545.

Corradini,F., De Nicola,R., Labella,A.: Fully Abstract Models for Nondeterministic Regular Expressions.
CONCUR ‘95, LNCS 962, Springer,1995, 130-144.

Ésik,Z., Labella,A.: Equational Properties of Iteration in Algebraically Complete Categories.
MFCS'96, LNCS 1113, Springer, Berlin,1996, 336-347.

Bloom,S.L., Ésik,Z., Labella,A., Manes,E.G.: Iteration 2-theories.
AMAST 97, LNCS 1349, Springer,1997, 30-44.

De Nicola,R., Labella,A.: Tree Morphisms and Bisimulations.
MFCS'98 Workshop on Concurrency, El. Notes of Th. Comp. Science, 18, (1998).

Labella,A.: Kleene's (unary) star in nondeterministic context.
FICS 2002, 67-68. (invited talk)

Bottoni, P., Labella, A., Mitrana, V., Sempere, J.M.: Filter position in Networks of Evolutionary Processors Does Not Matter: a direct proof
DNA 15, LNCS 5877, Springer, 2009, 1-11.

Bottoni,P., Gramatovici,R., Labella,A., Manea,F., Mitrana,V.: Context Insertions,
G. Paun Festschrift, LNCS 6610, Springer, 2011, 24-34.


Research products

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma