| 2009 |
|---|
| 93 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
A finite equational base for CCS with left merge and communication merge.
ACM Trans. Comput. Log. 10(1): (2009) |
| 2008 |
|---|
| 92 | | Luca Aceto,
Ivan Damgård,
Leslie Ann Goldberg,
Magnús M. Halldórsson,
Anna Ingólfsdóttir,
Igor Walukiewicz:
Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games
Springer 2008 |
| 91 | | Luca Aceto,
Ivan Damgård,
Leslie Ann Goldberg,
Magnús M. Halldórsson,
Anna Ingólfsdóttir,
Igor Walukiewicz:
Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations
Springer 2008 |
| 90 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Mohammad Reza Mousavi:
Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras.
IFIP TCS 2008: 301-316 |
| 89 | EE | Luca Aceto,
Anna Ingólfsdóttir,
Bas Luttik,
Paul van Tilburg:
Finite Equational Bases for Fragments of CCS with Restriction and Relabelling.
IFIP TCS 2008: 317-332 |
| 88 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
A Cancellation Theorem for BCCSP.
Fundam. Inform. 88(1-2): 1-21 (2008) |
| 87 | EE | Luca Aceto,
Silvio Capobianco,
Anna Ingólfsdóttir,
Bas Luttik:
The equational theory of prebisimilarity over basic CCS with divergence.
Inf. Process. Lett. 108(5): 284-289 (2008) |
| 86 | EE | Luca Aceto,
Anna Ingólfsdóttir:
On the expressibility of priority.
Inf. Process. Lett. 109(1): 83-85 (2008) |
| 85 | EE | Luca Aceto,
Mario Bravetti,
Wan Fokkink,
Andrew D. Gordon:
Guest Editors' Foreword.
J. Log. Algebr. Program. 75(1): 1-2 (2008) |
| 84 | EE | Luca Aceto,
Anna Ingólfsdóttir:
Guest Editors' Foreword.
J. Log. Algebr. Program. 77(1-2): (2008) |
| 83 | EE | Luca Aceto,
Taolue Chen,
Wan Fokkink,
Anna Ingólfsdóttir:
On the axiomatisability of priority.
Mathematical Structures in Computer Science 18(1): 5-28 (2008) |
| 2007 |
|---|
| 82 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
Ready to Preorder: Get Your BCCSP Axiomatization for Free!
CALCO 2007: 65-79 |
| 81 | EE | Luca Aceto,
Anna Ingólfsdóttir,
Mohammad Reza Mousavi:
Impossibility Results for the Equational Theory of Timed CCS.
CALCO 2007: 80-95 |
| 80 | EE | Luca Aceto,
Anna Ingólfsdóttir:
The Saga of the Axiomatization of Parallel Composition.
CONCUR 2007: 2-16 |
| 79 | EE | Luca Aceto:
Impossibility Results in the Equational Logic of Processes.
Electr. Notes Theor. Comput. Sci. 169: 3-6 (2007) |
| 78 | EE | Luca Aceto,
Mario Bravetti,
Wan Fokkink,
Andrew D. Gordon:
Guest Editors' Foreword.
J. Log. Algebr. Program. 70(2): 119-120 (2007) |
| 77 | EE | Luca Aceto,
Mario Bravetti,
Wan Fokkink,
Andrew D. Gordon:
Guest Editors' Foreword.
J. Log. Algebr. Program. 72(1): 1-2 (2007) |
| 76 | EE | Luca Aceto,
Anna Ingólfsdóttir:
Guest Editors' Foreword.
J. Log. Algebr. Program. 73(1-2): 1 (2007) |
| 2006 |
|---|
| 75 | | Luca Aceto,
Anna Ingólfsdóttir:
Foundations of Software Science and Computation Structures, 9th International Conference, FOSSACS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006, Proceedings
Springer 2006 |
| 74 | EE | Luca Aceto,
Taolue Chen,
Wan Fokkink,
Anna Ingólfsdóttir:
On the Axiomatizability of Priority.
ICALP (2) 2006: 480-491 |
| 73 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
A Finite Equational Base for CCS with Left Merge and Communication Merge.
ICALP (2) 2006: 492-503 |
| 72 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
A Finite Equational Base for CCS with Left Merge and Communication Merge
CoRR abs/cs/0608001: (2006) |
| 71 | EE | Luca Aceto,
Andrew D. Gordon:
Preface.
Electr. Notes Theor. Comput. Sci. 162: 1-2 (2006) |
| 70 | EE | Luca Aceto,
Wan Fokkink:
The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems.
Electr. Notes Theor. Comput. Sci. 162: 43-48 (2006) |
| 69 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Sumit Nain:
Bisimilarity is not finitely based over BPA with interrupt.
Theor. Comput. Sci. 366(1-2): 60-81 (2006) |
| 2005 |
|---|
| 68 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Sumit Nain:
Bisimilarity Is Not Finitely Based over BPA with Interrupt.
CALCO 2005: 52-66 |
| 67 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
Finite Equational Bases in Process Algebra: Results and Open Questions.
Processes, Terms and Cycles 2005: 338-367 |
| 66 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge
CoRR abs/cs/0501040: (2005) |
| 65 | EE | Luca Aceto,
Wan Fokkink,
Irek Ulidowski:
Preface.
Electr. Notes Theor. Comput. Sci. 128(1): 1- (2005) |
| 64 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge.
Logical Methods in Computer Science 1(1): (2005) |
| 63 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
CCS with Hennessy's merge has no finite-equational axiomatization.
Theor. Comput. Sci. 330(3): 377-405 (2005) |
| 62 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Zoltán Ésik:
Guest editors' foreword: Process Algebra.
Theor. Comput. Sci. 335(2-3): 127-129 (2005) |
| 2004 |
|---|
| 61 | EE | Luca Aceto:
Nested Semantics over Finite Trees are Equationally Hard: Invited Talk.
Electr. Notes Theor. Comput. Sci. 96: 5-6 (2004) |
| 60 | EE | Luca Aceto,
Wan Fokkink,
Rob J. van Glabbeek,
Anna Ingólfsdóttir:
Nested semantics over finite trees are equationally hard.
Inf. Comput. 191(2): 203-232 (2004) |
| 59 | EE | Luca Aceto,
Jens A. Hansen,
Anna Ingólfsdóttir,
Jacob Johnsen,
John Knudsen:
The Complexity of Checking Consistency of Pedigree Information and Related Problems.
J. Comput. Sci. Technol. 19(1): 42-59 (2004) |
| 58 | EE | Luca Aceto,
Wan Fokkink:
Guesteditors'introduction: Special issue on Structural Operational Semantics.
J. Log. Algebr. Program. 60-61: 1-2 (2004) |
| 2003 |
|---|
| 57 | EE | Luca Aceto,
Jens A. Hansen,
Anna Ingólfsdóttir,
Jacob Johnsen,
John Knudsen:
The Complexity of Checking Consistency of Pedigree Information and Related Problems.
ICTCS 2003: 174-187 |
| 56 | | Luca Aceto:
Some of My Favourite Results in Classic Process Algebra.
Bulletin of the EATCS 81: 90-108 (2003) |
| 55 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
A note on an expressiveness hierarchy for multi-exit iteration.
Inf. Process. Lett. 87(1): 17-23 (2003) |
| 54 | | Luca Aceto,
Giuseppe Longo,
Björn Victor:
Foreword To Special Issue: The Difference Between Concurrent And Sequential Computation.
Mathematical Structures in Computer Science 13(4): 481-484 (2003) |
| 53 | EE | Luca Aceto,
Zoltán Ésik,
Anna Ingólfsdóttir:
Equational theories of tropical semirings.
Theor. Comput. Sci. 3(298): 417-469 (2003) |
| 52 | EE | Luca Aceto,
Patricia Bouyer,
Augusto Burgueño,
Kim Guldstrand Larsen:
The power of reachability testing for timed automata.
Theor. Comput. Sci. 300(1-3): 411-475 (2003) |
| 2002 |
|---|
| 51 | EE | Luca Aceto,
Zoltán Ésik,
Anna Ingólfsdóttir:
Equational Axioms for Probabilistic Bisimilarity.
AMAST 2002: 239-253 |
| 50 | | Luca Aceto:
Kleene through the process algebraic glass.
FICS 2002: 20-21 |
| 49 | EE | Luca Aceto,
Zoltán Ésik,
Anna Ingólfsdóttir:
A Fully Equational Proof of Parikh's Theorem.
ITA 36(2): 129-153 (2002) |
| 48 | EE | Luca Aceto,
François Laroussinie:
Is your model checker on time? On the complexity of model checking for timed modal logics.
J. Log. Algebr. Program. 52-53: 7-51 (2002) |
| 47 | | Luca Aceto,
Prakash Panangaden:
Guest Editors' Foreword.
Nord. J. Comput. 9(1): 69 (2002) |
| 2001 |
|---|
| 46 | EE | Luca Aceto,
Zoltán Ésik,
Anna Ingólfsdóttir:
Axiomatizing Tropical Semirings.
FoSSaCS 2001: 42-56 |
| 45 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
2-Nested Simulation Is Not Finitely Equationally Axiomatizable.
STACS 2001: 39-50 |
| 44 | | Luca Aceto,
Wan Fokkink,
Chris Verhoef:
Conservative Extension in Structural Operational Semantics.
Current Trends in Theoretical Computer Science 2001: 504-524 |
| 43 | EE | Luca Aceto,
Prakash Panangaden:
Preface.
Electr. Notes Theor. Comput. Sci. 52(1): (2001) |
| 42 | EE | Samson Abramsky,
Luca Aceto,
Anna Ingólfsdóttir:
Corrigendum: A Domain Equation for Bisimulation: Volume 92 Number 2 (1991), pages 161-218.
Inf. Comput. 165(2): 119-122 (2001) |
| 41 | EE | Luca Aceto,
Wan Fokkink:
Preface: Process Algebra.
Inf. Process. Lett. 80(1): 1 (2001) |
| 2000 |
|---|
| 40 | EE | Luca Aceto,
Zoltán Ésik,
Anna Ingólfsdóttir:
On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers.
STACS 2000: 267-278 |
| 39 | EE | Luca Aceto,
Anna Ingólfsdóttir,
Mikkel Lykke Pedersen,
Jan Poulsen:
Characteristic formulae for timed automata.
ITA 34(6): 565-584 (2000) |
| 1999 |
|---|
| 38 | | Luca Aceto,
Anna Ingólfsdóttir:
Testing Hennessy-Milner Logic with Recursion.
FoSSaCS 1999: 41-55 |
| 37 | | Luca Aceto,
François Laroussinie:
Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics.
MFCS 1999: 125-136 |
| 36 | | Luca Aceto,
Wan Fokkink,
Chris Verhoef:
Conservative Extension in Structural Operational Semantics.
Bulletin of the EATCS 69: 110-132 (1999) |
| 35 | EE | Luca Aceto,
Jan Friso Groote:
A Complete Equational Axiomatization for MPA with String Iteration.
Theor. Comput. Sci. 211(1-2): 339-374 (1999) |
| 1998 |
|---|
| 34 | | Luca Aceto,
Patricia Bouyer,
Augusto Burgueño,
Kim Guldstrand Larsen:
The Power of Reachability Testing for Timed Automata.
FSTTCS 1998: 245-256 |
| 33 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
A Cook's Tour of Equational Axiomatizations for Prefix Iteration.
FoSSaCS 1998: 20-34 |
| 32 | EE | Luca Aceto,
Augusto Burgueño,
Kim Guldstrand Larsen:
Model Checking via Reachability Testing for Timed Automata.
TACAS 1998: 263-280 |
| 31 | | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
A Menagerie of NonFfinitely Based Process Semantics over BPA* - From Ready Simulation to Completed Traces.
Mathematical Structures in Computer Science 8(3): 193-230 (1998) |
| 30 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
On a Question of A. Salomaa: The Equational Theory of Regular Expressions Over a Singleton Alphabet is not Finitely Based.
Theor. Comput. Sci. 209(1-2): 163-178 (1998) |
| 1997 |
|---|
| 29 | EE | Luca Aceto,
Hans Hüttel,
Anna Ingólfsdóttir,
Josva Kleist:
Relating semantic models for the object calculus.
Electr. Notes Theor. Comput. Sci. 7: (1997) |
| 28 | | Luca Aceto,
Wan Fokkink:
An Equational Axiomatization for Multi-Exit Iteration.
Inf. Comput. 137(2): 121-158 (1997) |
| 27 | EE | Luca Aceto,
Anna Ingólfsdóttir:
A Characterization of Finitary Bisimulation.
Inf. Process. Lett. 64(3): 127-134 (1997) |
| 1996 |
|---|
| 26 | | Luca Aceto,
Anna Ingólfsdóttir:
An Equational Axiomatization of Observation Congruence for Prefix Iteration.
AMAST 1996: 195-209 |
| 25 | | Luca Aceto,
David Murphy:
Timing and Causality in Process Algebra.
Acta Inf. 33(4): 317-350 (1996) |
| 24 | | Luca Aceto,
Rob J. van Glabbeek,
Wan Fokkink,
Anna Ingólfsdóttir:
Axiomatizing Prefix Iteration with Silent Steps.
Inf. Comput. 127(1): 26-40 (1996) |
| 23 | | Luca Aceto,
Anna Ingólfsdóttir:
CPO Models for Compact GSOS Languages.
Inf. Comput. 129(2): 107-141 (1996) |
| 1995 |
|---|
| 22 | | Luca Aceto,
Anna Ingólfsdóttir:
CPO Models for a Class of GSOS Languages.
TAPSOFT 1995: 439-453 |
| 21 | EE | Luca Aceto,
Alan Jeffrey:
A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours.
Theor. Comput. Sci. 152(2): 251-268 (1995) |
| 1994 |
|---|
| 20 | | Luca Aceto:
Deriving Complete Inference Systems for a Class of GSOS Languages Generation Regular Behaviours.
CONCUR 1994: 449-464 |
| 19 | | Luca Aceto:
A Static View of Localities.
Formal Asp. Comput. 6(2): 201-222 (1994) |
| 18 | | Luca Aceto,
Bard Bloom,
Frits W. Vaandrager:
Turning SOS Rules into Equations
Inf. Comput. 111(1): 1-52 (1994) |
| 17 | | Luca Aceto,
Matthew Hennessy:
Adding Action Refinement to a Finite Process Algebra
Inf. Comput. 115(2): 179-247 (1994) |
| 16 | | Luca Aceto:
On "Axiomatising Finite Concurrent Processes".
SIAM J. Comput. 23(4): 852-863 (1994) |
| 15 | | Luca Aceto:
GSOS and Finite Labelled Transition Systems.
Theor. Comput. Sci. 131(1): 181-195 (1994) |
| 1993 |
|---|
| 14 | | Luca Aceto,
David Murphy:
On the Ill-Timed but Well-Caused.
CONCUR 1993: 97-111 |
| 13 | | Luca Aceto,
Matthew Hennessy:
Towards Action-Refinement in Process Algebras
Inf. Comput. 103(2): 204-269 (1993) |
| 1992 |
|---|
| 12 | | Luca Aceto,
Bard Bloom,
Frits W. Vaandrager:
Turning SOS Rules into Equations
LICS 1992: 113-124 |
| 11 | | Luca Aceto:
History preserving, causal and mixed-ordering equivalence over stable event structures.
Fundam. Inform. 17(4): 319-331 (1992) |
| 10 | | Luca Aceto:
Relating distributed, temporal and causal observations of simple processes.
Fundam. Inform. 17(4): 369-397 (1992) |
| 9 | EE | Luca Aceto,
Matthew Hennessy:
Termination, Deadlock, and Divergence.
J. ACM 39(1): 147-187 (1992) |
| 1991 |
|---|
| 8 | | Luca Aceto,
Anna Ingólfsdóttir:
A Theory of Testing for ACP.
CONCUR 1991: 78-95 |
| 7 | | Luca Aceto,
Uffe Engberg:
Failures Semantics for a Simple Process Language with Refinement.
FSTTCS 1991: 89-108 |
| 6 | | Luca Aceto,
Matthew Hennessy:
Adding Action Refinement to a Finite Process Algebra.
ICALP 1991: 506-519 |
| 5 | | Luca Aceto:
On Relating Concurency and Nondeterminism.
MFPS 1991: 376-402 |
| 4 | | Luca Aceto:
Full Abstraction for Series-Parallel Pomsets.
TAPSOFT, Vol.1 1991: 1-25 |
| 1989 |
|---|
| 3 | | Luca Aceto,
Matthew Hennessy:
Towards Action-Refinement in Process Algebras
LICS 1989: 138-145 |
| 2 | | Luca Aceto,
Matthew Hennessy:
Termination, Deadlock and Divergence.
Mathematical Foundations of Programming Semantics 1989: 301-318 |
| 1986 |
|---|
| 1 | | Luca Aceto,
Rocco De Nicola,
Alessandro Fantechi:
Testing Equivalences for Event Structures.
Mathematical Models for the Semantics of Parallelism 1986: 1-20 |
