Luca Aceto, Silvio Capobianco, and Anna Ingólfsdóttir.
On the Existence of a Finite Base for Complete Trace Equivalence over BPA with Interrupt.
28 February 2007.
26 pp.
Impossibility Results for the Equational Theory of Timed CCS.
Version of 16 February 2007.
To appear in the Proceedings of the 2nd Conference on Algebra and Coalgebra in Computer Science (CALCO'07), Bergen, Norway, Lecture Notes in Computer Science, Springer-Verlag, August 2007.
Luca Aceto, Wan Fokkink and Anna Ingolfsdottir.
Ready To Preorder: Get Your BCCSP Axiomatization for Free!
14 February 2007.
37 pp.
To appear in the Proceedings of the 2nd Conference on Algebra and Coalgebra in Computer Science (CALCO'07), Bergen, Norway, Lecture Notes in Computer Science, Springer-Verlag, August 2007.
Luca Aceto and Anna Ingolfsdottir.
Characteristic Formulae: From Automata to Logic.
January 2007.
18 pp.
In the Bulletin of the EATCS, volume 91, pp. 58-75, February 2007.
The Bulletin version of this piece, including the editorial foreword, is available here .
Reactive Systems: Modelling, Specification and Verification.
Cambridge University Press, to appear in the spring 2007.
[Preface and Table of Contents]
Report on the 18th Nordic Workshop on Programming Theory.
October 2006.
3 pp.
To appear in the Bulletin of the EATCS, February 2007.
Report on BICI (Bertinoro International Center for Informatics).
October 2006.
2 pp.
In the Bulletin of the EATCS, October 2006.
Icelandic Centre of Excellence in Theoretical Computer Science (ICE-TCS): Second Symposium on Theoretical Computer Science and Public Lecture by Moshe Vardi.
October 2006.
3 pp.
In the Bulletin of the EATCS, October 2006.
Foundations of Software Science and Computation Structure 2006, Proceedings, LNCS 3921, Springer-Verlag.
March 2006.
Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, and Bas Luttik.
A Finite Equational Base for CCS with Left Merge and Communication Merge.
March 2006.
22 pp.
An extended abstract of this paper appears in the Proceedings of ICALP 2006, the 33rd International Colloquium on Automata, Languages and Programming, July 9-16, 2006, S. Servolo, Venice, Italy, Lecture Notes in Computer Science 4052, pp. 492-503, Springer-Verlag, July 2006.
Impossibility Results in the Equational Logic of Processes (PDF).
February 2006.
4 pp.
This is the abstract of an invited talk to be delivered at Workshop on LOGIC, MODELS AND COMPUTER SCIENCE (LMCS06), Camerino (Italy), April 20-22, 2006. It will be part of a volume in the ENTCS series devoted to that event.
A Finite Equational Base for CCS with Left Merge and Communication Merge (PDF).
February 2006.
13 pp.
This is an extended abstract of a paper whose full version will be posted on this page soon.
Luca Aceto, Taolue Chen, Wan Fokkink, and Anna Ingólfsdóttir.
On the Axiomatizability of Priority.
January 2006.
25 pp.
An extended abstract of this paper appears in the Proceedings of ICALP 2006, the 33rd International Colloquium on Automata, Languages and Programming, July 9-16, 2006, S. Servolo, Venice, Italy, Lecture Notes in Computer Science 4052, pp. 480-491, Springer-Verlag, July 2006.
Luca Aceto, Willem Jan Fokkink, Anna Ingólfsdóttir, and Sumit Nain.
Bisimilarity is not Finitely Based over BPA with Interrupt.
October 2005.
33 pp. This paper supersedes BRICS Report RS-04-24. An extended abstract of this paper appeared in Algebra and Coalgebra in Computer Science, 1st Conference, CALCO 2005, Swansea, Wales, 3-6 September 2005, Lecture Notes in Computer Science 3629, pp. 54-68, Springer-Verlag, 2005.
Theoretical Computer Science 366(1-2):60-81, 16 November 2006.
Genetic Linkage Analysis: Algorithms and their Implementation, Transactions on Computational Systems Biology III, LNBI 3737. To appear.
[Software (Free download)]
Report on the Workshop Algebraic Process Calculi: The First Twenty Five Years and Beyond, August 1-5, 2005, University of Bologna Residential Center Bertinoro (Forlì), Italy.
October 2005.
4 pp.
In the Bulletin of the EATCS, Number 87, October 2005. To appear.
Luca Aceto and Andrew D. Gordon editors.
Essays on Algebraic Process Calculi.
June 2005.
244 pp. This volume contains short contributions for the the workshop Algebraic Process Calculi: The First Twenty Five Years and Beyond, August 1-5, 2005, University of Bologna Residential Center Bertinoro (Forlì), Italy.
Report on the Icelandic Centre of Excellence in Theoretical Computer Science (ICE-TCS): Opening and Inaugural Symposium.
May 2005.
3 pp.
In the Bulletin of the EATCS, Number 86, pp. 262-263, June 2005.
Luca Aceto and Willem Jan Fokkink.
The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems.
May 2005.
7 pp. To appear in a volume of the BRICS Notes Series devoted to the workshop Algebraic Process Calculi: The First Twenty Five Years and Beyond, August 1-5, 2005, University of Bologna Residential Center Bertinoro (Forlì), Italy.
Editors' Preface. Electronic Notes in Theoretical Computer Science, Volume 128, Issue 1, 4 May 2005, Page 1, Proceedings of the Workshop on Structural Operational Semantics (SOS 2004).
Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, and Bas Luttik.
Finite Equational Bases in Process Algebra: Results and Open Questions.
June 2005.
28 pp.
A revised version of this paper appears at pages 338-367 in Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday (Aart Middeldorp, Vincent van Oostrom, Femke Raamsdonk, Roel Vrijer editors), LNCS 3838, Springer-Verlag, December 2005. ISBN: 3-540-30911-X DOI: 10.1007/11601548 Chapter: pp. 338 - 367 DOI: 10.1007/11601548_18
Luca Aceto and Anna Ingólfsdóttir.
What is Theoretical Computer Science? (Preliminary Version).
April 2005.
13 pp.
Note! This is a preliminary version of an article whose final, complete version will be co-authored with Magnus Mar Halldorsson.
Link to the whole volume.
Luca Aceto, Willem Jan Fokkink, Anna Ingólfsdóttir, and Sumit Nain.
Bisimilarity is not Finitely Based over BPA with Interrupt.
October 2004.
30 pp.
An extended abstract of this work appears in the Proceedings of Conference on Algebra and Coalgebra in Computer Science (CALCO), Swansea, Wales, 3--6 September 2005, Lecture Notes in Computer Science 3629, pp. 54-68, Springer-Verlag, 2005. [Link to the electronic edition]
Revised version for journal submission of Mon Nov 7 14:17:50 GMT 2005. (The present version of the paper sharpens the main result in that it now applies to any non-empty set of actions. Moreover, the last section in the current paper is new.)
Luca Aceto, Willem Jan Fokkink, and Irek Ulidowski, editors.
Preliminary Proceedings of the Workshop on Structural Operational Semantics, SOS '04, (London, United Kingdom, August 30, 2004), August 2004.
vi+56.
The official ENTCS proceedings are available as Volume 128, Issue 1, Pages 1-122 (4 May 2005) Proceedings of the Workshop on Structural Operational Semantics (SOS 2004) 30 August 2004 Edited by L. Aceto; W. Fokkink; I. Ulidowski.
Luca Aceto, Willem Jan Fokkink, Anna Ingólfsdóttir, and Bas Luttik.
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge.
January 2004.
16 pp.
Logical Methods in Computer Science, volume 1, issue 1, paper 3, 9 March 2005. The journal version of the paper is available as Computer Science abstract cs.LO/0501040 at the ArXiv.
Luca Aceto, Willem Jan Fokkink, Anna Ingólfsdóttir, and Bas Luttik.
CCS with Hennessy's Merge has no Finite Equational Axiomatization.
November 2003.
37 pp.
Theoretical Computer Science, Volume 330, Issue 3, 9 February 2005, Pages 377-405 . Available from Science Direct following this link.
Luca Aceto, Zoltán Ésik, Willem Jan Fokkink, and Anna Ingólfsdóttir, editors.
Slide Reprints from the Workshop on Process Algebra: Open Problems and Future Directions, PA '03, (Bologna, Italy, 21-25 July, 2003), November 2003.
vi+138.
Luca Aceto.
Some of My Favourite Results in Classic Process Algebra.
September 2003.
21 pp. In the Bulletin of the EATCS, volume 81, pp. 89-108, October 2003.
Luca Aceto, Willem Jan Fokkink, Rob J. van Glabbeek, and Anna Ingólfsdóttir.
Nested Semantics over Finite Trees are Equationally Hard.
August 2003.
31 pp.
Information and Computation Vol. 191(2), pp. 203-232, 15 June 2004. (The article is now available online via ScienceDirect in the "Articles in Press" section.)
Luca Aceto, Jens Alsted Hansen, Anna Ingólfsdóttir, Jacob Johnsen, and John Knudsen.
The Complexity of Checking Consistency of Pedigree Information and Related Problems.
March 2003.
31 pp. This paper supersedes BRICS Report RS-02-42.
An extended abstract of this paper will appear in the Proceedings of the Eighth Italian Conference on Theoretical Computer Science (ICTCS'03), University Center Bertinoro, Italy, 13-15 October 2003, Lecture Notes in Computer Science 2841, pp. 174-187, 2003.
Full version appears in a special issue devoted to bioinformatics (Paola Bonizzoni, Gianluca Della Vedova and Tao Jiang guest editors) of Journal of Computer Science and Technology 19(1):42-59, 2004.
Anna Ingólfsdóttir.
A Semantic Theory for Value-Passing Processes Based on the Late Approach.
March 2003.
48 pp.
Appears in Information and Computation, Volume 184, Issue 1, 10 July 2003, Pages 1-44.
Luca Aceto, Jens A. Hansen, Ingólfsdóttir Anna, Jacob Johnsen, and John Knudsen.
Checking Consistency of Pedigree Information is NP-complete (Preliminary Report).
October 2002.
16 pp. A full version of this paper is available as BRICS report RS-03-17.
Luca Aceto, Willem Jan Fokkink, and Anna Ingólfsdóttir.
A Note on an Expressiveness Hierarchy for Multi-exit Iteration.
September 2002.
8 pp.
[A revised version appears in Information Processing Letters 87(1):17-23, July 2003.]
Daniel Gudbjartsson, Anna Ingólfsdóttir, and Augustin Kong.
An BDD-Based Implementation of the Allegro Software.
August 2002.
2 pp.
Zoltán Ésik and Anna Ingólfsdóttir, editors.
Preliminary Proceedings of the Workshop on Fixed Points in Computer Science, FICS '02, (Copenhagen, Denmark, July 20 and 21, 2002), June 2002.
iv+81 pp.
Anna Ingólfsdóttir, Anders Lyhne Christensen, Jens Alsted Hansen, Jacob Johnsen, John Knudsen, and Jacob Illum Rasmussen.
A Formalization of Linkage Analysis.
February 2002.
vi+109 pp.
Luca Aceto, Zoltán Ésik, and Anna Ingólfsdóttir.
Equational Axioms for Probabilistic Bisimilarity (Preliminary Report).
February 2002.
22 pp.
In the Proceedings of the 9th International Conference on Algebraic Methodology And Software Technology, AMAST '2002, September 9-13, 2002, St. Gilles les Bains, Reunion Island, France. Lecture Notes in Computer Science 2422, pp. 239-253, 2002.
Luca Aceto and Prakash Panangaden, editors.
Preliminary Proceedings of the 8th International Workshop on Expressiveness in Concurrency, EXPRESS '01, (Aalborg, Denmark, August 20, 2001), August 2001.
vi+139 pp.
Luca Aceto, Zoltán Ésik, and Anna Ingólfsdóttir.
A Fully Equational Proof of Parikh's Theorem.
June 2001.
Appears in RAIRO, Theoretical Informatics and Applications 36, 129-153 (2002).
28 pp. [Slides (PostScript file). Courtesy of Zoltán Ésik]
Luca Aceto, Zoltán Ésik, and Anna Ingólfsdóttir.
Equational Theories of Tropical Semirings.
2001.
52 pp. Extended abstracts of parts of this paper have appeared in Honsell and Miculan, editors, Foundations of Software Science and Computation Structures, FoSSaCS '01 Proceedings, LNCS 2030, 2001, pages 42-56 and in Gaubert and Loiseau, editors, Workshop on Max-plus Algebras and their Applications to Discrete-event Systems, Theoretical Computer Science, and Optimization, MAX-PLUS '01 Proceedings, IFAC (International Federation of Automatic Control) IFAC Publications, 2001.
[Slides for the FoSSaCS '01 talk (PostScript file)]
[Slides for a seminar talk based on this paper (PostScript file)]
[A revised version appears in Theoretical Computer Science, Volume 298, Issue 3, 11 April 2003, Pages 417-469.]
Luca Aceto, Anna Ingólfsdóttir, Mikkel Lykke Pedersen, and Jan Poulsen.
Characteristic Formulae for Timed Automata.
September 2000.
23 pp. RAIRO, Theoretical Informatics and Applications 34(6):565-584 (November/December 2000) .
Luca Aceto, Willem Jan Fokkink, and Anna Ingólfsdóttir.
2-Nested Simulation is not Finitely Equationally Axiomatizable.
August 2000.
13 pp. In the Proceedings of the 18th International Symposium on Theoretical Aspects of Computer Science (STACS 2001), LNCS 2010, pp. 39-50,Springer-Verlag, February 2001. [Slides (PostScript file)]
Luca Aceto and Björn Victor, editors.
Preliminary Proceedings of the 7th International Workshop on Expressiveness in Concurrency, EXPRESS '00, (State College, USA, August 21, 2000), August 2000.
vi+130 pp.
Luca Aceto, Zoltán Ésik, and Anna Ingólfsdóttir.
The Max-Plus Algebra of the Natural Numbers has no Finite Equational Basis.
October 1999.
25 pp.
A revised version of this paper appears in Theoretical Computer Science 293(1):169--188, 3 February 2003.
Luca Aceto and François Laroussinie.
Is your Model Checker on Time? -- On the Complexity of Model Checking for Timed Modal Logics.
October 1999.
11 pp. Appears in Kuty
Full version appears in the Journal of Logic and Algebraic Programming, Volumes 52-53, July-August 2002, Pages 7-51.
Luca Aceto, Willem Jan Fokkink, and Chris Verhoef.
Structural Operational Semantics.
September 1999.
128 pp. Appears in Bergstra, Ponse and Smolka, editors, Handbook of Process Algebra, Elsevier.
Luca Aceto, Willem Jan Fokkink, and Chris Verhoef.
Conservative Extension in Structural Operational Semantics.
September 1999.
23 pp. Appears in the Bulletin of the EATCS.
Luca Aceto, Zoltán Ésik, and Anna Ingólfsdóttir.
On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers.
August 1999.
22 pp. Appears in the Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science (STACS 2000), LNCS 1770, pp. 267-278, Springer-Verlag, February 2000.
Luca Aceto and Anna Ingólfsdóttir. Testing Hennessy-Milner Logic with Recursion. December 1998. 15 pp. Appears in W. Thomas, editor, Foundations of Software Science and Computation Structures: Second International Conference, FoSSaCS '99 Proceedings, LNCS 1578, 1998, pages 41-55.
Luca Aceto, Willem Jan Fokkink, and Anna Ingólfsdóttir. A Cook's Tour of Equational Axiomatizations for Prefix Iteration. December 1998. 14 pp. Appears in Nivat, editor, Foundations of Software Science and Computation Structures: First International Conference, FoSSaCS '98 Proceedings, LNCS 1378, 1998, pages 20-34.
Luca Aceto, Patricia Bouyer, Augusto Burgueño, and Kim G. Larsen. The Power of Reachability Testing for Timed Automata. December 1998. 12 pp. Appears in Arvind and Ramanujam, editors, Foundations of Software Technology and Theoretical Computer Science: 18th Conference, FST&TCS '98 Proceedings, LNCS 1530, 1998, pages 245-256.
Full version (.ps file) to appear in Theoretical Computer Science.
Luca Aceto, Augusto Burgueño, and Kim G. Larsen. Model Checking via Reachability Testing for Timed Automata. November 1997. 29 pp. In the Proceedings of TACAS'98, Lecture Notes in Computer Science 1384, pp. 263-280, Springer-Verlag, March/April 1998.
Luca Aceto and Anna Ingólfsdóttir. A Characterization of Finitary Bisimulation. October 1997. 9 pp. Information Processing Letters 64(3):127-134, 14 November 1997.
Anna Ingólfsdóttir. Weak Semantics Based on Lighted Button Pressing Experiments: An Alternative Characterization of the Readiness Semantics. November 1996. 36 pp. Extended abstract presented at the 10th Annual International Conference of the European Association for Computer Science Logic, CSL '96.
Luca Aceto, Willem J. Fokkink, and Anna Ingólfsdóttir. On a Question of A. Salomaa: The Equational Theory of Regular Expressions over a Singleton Alphabet is not Finitely Based. October 1996. 16 pp. Theoretical Computer Science 209(1-2):163-178, 6 December 1998. [AMS Review.]
Luca Aceto, Willem J. Fokkink, and Anna Ingólfsdóttir. A Menagerie of Non-Finitely Based Process Semantics over BPA*: From Ready Simulation Semantics to Completed Tracs. July 1996. 38 pp. Mathematical Structures in Computer Science 8(3):193-230, June 1998. [AMS Review.]
Luca Aceto and Willem J. Fokkink. An Equational Axiomatization for Multi-Exit Iteration. June 1996. 30 pp. Information and Computation 137(2):121-158, 15 September 1997. [AMS Review.]
Luca Aceto and Anna Ingólfsdóttir. On the Finitary Bisimulation. November 1995. 29 pp.
Luca Aceto, Willem J. Fokkink, Rob J. van Glabbeek, and Anna Ingólfsdóttir. Axiomatizing Prefix Iteration with Silent Steps. November 1995. 25 pp. Information and Computation 127(1):26-40. [AMS Review.]
Anna Ingólfsdóttir and Andrea Schalk. A Fully Abstract Denotational Model for Observational Congruence. August 1995. Full version of a paper presented at CSL 95, 29 pp. To appear in Theoretical Computer Science.
Luca Aceto and Jan Friso Groote. A Complete Equational Axiomatization for MPA with String Iteration. May 1995. 39 pp. Theoretical Computer Science 211(1--2):339--374, 28 January 1999.
Anna Ingólfsdóttir. A Semantic Theory for Value--Passing Processes, Late Approach, Part II: A Behavioural Semantics and Full Abstractness. April 1995. 33 pp.
Luca Aceto and Anna Ingólfsdóttir. A Complete Equational Axiomatization for Prefix Iteration with Silent Steps. January 1995. 27 pp. In the Proceedings of AMAST '96, LNCS 1101, pp. 195--209, Springer-Verlag, July 1996.
Anna Ingólfsdóttir. A Semantic Theory for Value--Passing Processes, Late Approach, Part I: A Denotational Model and Its Complete Axiomatization. January 1995. 37 pp.
Luca Aceto and Alan S. A. Jeffrey. A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours (Revised Version). December 1994. 18 pp. Published in Theoretical Computer Science 152(2):251--268, December 1995. [AMS Review.]
Luca Aceto and Anna Ingólfsdóttir. CPO Models for GSOS Languages --- Part I: Compact GSOS Languages. December 1994. 70 pp. Information and Computation 129(2):107--141. An extended abstract of the paper appears in: Proceedings of CAAP '95, LNCS 915, 1995, pages 439--453.