dblp.uni-trier.dewww.uni-trier.de

Maria Rita Di Berardini

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
10EEFlavio Corradini, Maria Rita Di Berardini, Walter Vogler: Time and Fairness in a Process Algebra with Non-blocking Reading. SOFSEM 2009: 193-204
2008
9EEEzio Bartocci, Flavio Corradini, Maria Rita Di Berardini, Emilia Entcheva, Radu Grosu, Scott A. Smolka: Spatial Networks of Hybrid I/O Automata for Modeling Excitable Tissue. Electr. Notes Theor. Comput. Sci. 194(3): 51-67 (2008)
2006
8EEFlavio Corradini, Maria Rita Di Berardini, Walter Vogler: Checking a Mutex Algorithm in a Process Algebra with Fairness. CONCUR 2006: 142-157
7EEFlavio Corradini, Maria Rita Di Berardini, Walter Vogler: Fairness of Actions in System Computations. Acta Inf. 43(2): 73-130 (2006)
6EEFlavio Corradini, Maria Rita Di Berardini, Walter Vogler: Fairness of components in system computations. Theor. Comput. Sci. 356(3): 291-324 (2006)
2005
5EEFlavio Corradini, Rosario Culmone, Maria Rita Di Berardini, Emanuela Merelli: Integrating Ontologies in Mobile Agents. WOA 2005: 37-45
4EEFlavio Corradini, Maria Rita Di Berardini, Walter Vogler: Fairness of Components in System Computations. Electr. Notes Theor. Comput. Sci. 128(2): 35-52 (2005)
2004
3EEFlavio Corradini, Rosario Culmone, Maria Rita Di Berardini: Code Mobility for Pervasive Computing. WETICE 2004: 431-432
2003
2EEFlavio Corradini, Maria Rita Di Berardini, Walter Vogler: Relating Fairness and Timing in Process Algebras. CONCUR 2003: 438-452
2001
1EEFlavio Corradini, Maria Rita Di Berardini, Walter Vogler: PAFAS at Work: Comparing the Worst-Case Efficiency of Three Buffer Implementations. APAQS 2001: 231-240

Coauthor Index

1Ezio Bartocci [9]
2Flavio Corradini [1] [2] [3] [4] [5] [6] [7] [8] [9] [10]
3Rosario Culmone [3] [5]
4Emilia Entcheva [9]
5Radu Grosu [9]
6Emanuela Merelli [5]
7Scott A. Smolka [9]
8Walter Vogler [1] [2] [4] [6] [7] [8] [10]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)