Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Ingolfsdottir, Anna"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Axiomatizing weak simulation semantics over BCCSP
Luca Aceto
,
David de Frutos Escrig
,
Carlos Gregorio-RodrÃguez
,
Anna Ingolfsdottir
Theoretical Computer Science
537
, 2014, pp. 42-71
Rule formats for distributivity
Luca Aceto
,
Matteo Cimini
,
Anna Ingolfsdottir
,
MohammadReza Mousavi
,
Michel A. Reniers
Theoretical Computer Science
458
, 2012, pp. 1-28
On the axiomatizability of priority II
Luca Aceto
,
Taolue Chen
,
Anna Ingolfsdottir
,
Bas Luttik
,
Jaco van de Pol
Theoretical Computer Science
412
(28), 2011, pp. 3035-3044
SOS rule formats for zero and unit elements
Luca Aceto
,
Matteo Cimini
,
Anna Ingolfsdottir
,
MohammadReza Mousavi
,
Michel A. Reniers
Theoretical Computer Science
412
(28), 2011, pp. 3045-3071
Lifting non-finite axiomatizability results to extensions of process algebras
Luca Aceto
,
Wan Fokkink
,
Anna Ingolfsdottir
,
MohammadReza Mousavi
Acta Informatica
47
(3), 2011, pp. 147-177
Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
Luca Aceto
,
David de Frutos Escrig
,
Carlos Gregorio-RodrÃguez
,
Anna Ingolfsdottir
Information Processing Letters
111
(9), 2011, pp. 408-413
Resource bisimilarity and graded bisimilarity coincide
Luca Aceto
,
Anna Ingolfsdottir
,
Joshua Sack
Information Processing Letters
111
(2), 2010, pp. 68-76
The equational theory of prebisimilarity over basic CCS with divergence
Luca Aceto
,
Silvio Capobianco
,
Anna Ingolfsdottir
,
Bas Luttik
Information Processing Letters
108
(5), 2008, pp. 284-289
On the expressibility of priority
Luca Aceto
,
Anna Ingolfsdottir
Information Processing Letters
109
(1), 2008, pp. 83-85
On the axiomatizability of priority
Luca Aceto
,
Taolue Chen
,
Wan Fokkink
,
Anna Ingolfsdottir
Lecture Notes in Computer Science
4052
, 2006, pp. 480-491
A finite equational base for CCS with left merge and communication merge
Luca Aceto
,
Wan Fokkink
,
Anna Ingolfsdottir
,
Bas Luttik
Lecture Notes in Computer Science
4052
, 2006, pp. 492-503
Bisimilarity is not finitely based over BPA with interrupt
Luca Aceto
,
Wan Fokkink
,
Anna Ingolfsdottir
,
Sumit Nain
Theoretical Computer Science
366
(1-2), 2006, pp. 60-81