Recent Publications by Luca Aceto and/or Anna Ingolfsdottir


"I love to do research, I want to do research, I have to do research, and I hate to sit down and begin to do research---I always try to put it off just as long as I can.
....Isn't there something I can (must?) do first? Shouldn't I sharpen my pencils perhaps?"

- --Paul Halmos, I Want to be a Mathematician
"When competition---that is, selfishness---no longer rules in science, when people associate with one another for study and not in order to send sealed packages to the Academies, they will be eager to publish even small results, as long as these are new, while adding, 'I do not know the rest.'"
- --Evariste Galois
If you keep proving stuff that others have done, getting confidence, increasing the complexities of your solutions - for the fun of it - then one day you'll turn around and discover that nobody actually did that one! And that's the way to become a computer scientist.
-- Richard Feynman, Feynman Lectures on Computation

BRICS Reports and Other Recent Papers/Edited Volumes

Note: An identifier of the form NS-??-?? or RS-??-?? associated with a paper is the number of the BRICS note or report, respectively.

EXPRESSIVENESS RESULTS FOR HS LOGIC OVER DISCRETE AND FINITE LINEAR ORDERS
Luca Aceto, Dario Della Monica, Anna Ingolfsdottir, Angelo Montanari and Guido Sciavicco. On the expressiveness of the interval logic of Allen's relations over finite and discrete linear orders.
Version dated 23 May 2014.
To appear in the Proceedings of the 14th European Conference on Logics in Artificial Intelligence, JELIA 2014, Lecture Notes in Artificial Intelligence 8761, pp. 267-281, Springer Verlag, 2014. A draft full version is available here.

EXPRESSIVENESS TAXONOMY FOR HS LOGIC
Luca Aceto, Dario Della Monica, Valentin Goranko, Anna Ingolfsdottir, Angelo Montanari and Guido Sciavicco. A Complete Classification of the Expressiveness of Interval Logics of Allen's Relations: The General and the Dense Cases.
Version dated 10 February 2014.
Submitted for publication.

RULE FORMAT FOR IDEMPOTENT UNARY OPERATORS (JOURNAL VERSION of SOFSEM 2013 PAPER)
Luca Aceto, Eugen-Ioan Goriac and Anna Ingolfsdottir. SOS Rule Formats for Idempotent Terms and Idempotent Unary Operators.. Journal of Logic and Algebraic Programming 83(1):64-80, Elsevier, 2014.
Version dated 6 August 2013. The official journal version is here.

ENUMERATING MAXIMAL MODELS OF HORN THEORIES
Luca Aceto, Dario Della Monica, Anna Ingolfsdottir, Angelo Montanari and Guido Sciavicco. An Algorithm for Enumerating Maximal Models of Horn Theories with an Application to Modal Logics.
Version dated 8 August 2013. In the Proceedings of LPAR-19, Logic for Programming, Artificial Intelligence and Reasoning (Kenneth L. McMillan, Aart Middeldorp, Andrei Voronkov eds.), Stellenbosch, South Africa, 15-19 December 2013, Lecture Notes in Computer Science 8312, pp. 1-17, Springer Verlag, December 2013.

AXIOMATIZING STATELESS BISIMILARITY OVER LINDA
Luca Aceto, Eugen-Ioan Goriac and Anna Ingolfsdottir. A Ground-Complete Axiomatization of Stateless Bisimilarity over Linda. To appear in Information Processing Letters, Elsevier. See here for the "official" journal version. (Please note access to the full text of this article on the journal's web site will depend on your personal or institutional entitlements.)
Version dated 16 May 2014.
Previous version dated 21 June 2013.

META SOS TOOL PAPER
Luca Aceto, Eugen-Ioan Goriac and Anna Ingolfsdottir. Meta SOS - A Maude Based SOS Meta-Theory Framework. Proceedings Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics, EPTCS 120:93-107, 2013.
The framework is downloadable from here.

EXPRESSIVENESS CLASSIFICATION OF HS OVER DENSE LINEAR ORDERS
Luca Aceto, Dario Della Monica, Anna Ingolfsdottir, Angelo Montanari and Guido Sciavicco. A complete classification of the expressiveness of interval logics of Allen's relations over dense linear orders.
Version dated 10 May 2013.
In the Proceedings of TIME 2013: 20th International Symposium on Temporal Representation and Reasoning, pp. 65-72, IEEE Press, 2013. ISBN 978-0-7695-5112-8. ISSN 1550-1311.

OPTIMIZING MECHANIZED AXIOMATIZATIONS
Luca Aceto, Eugen-Ioan Goriac, Anna Ingolfsdottir, MohammadReza Mousavi and Michel Reniers. Exploiting Algebraic Laws to Improve Mechanized Axiomatizations.
An extended abstract of this paper appears in the Proceedings of the 5th Conference on Algebra and Coalgebra in Computer Science, Warsaw, Poland, 3-6 September 2013. Lecture Notes in Computer Science 8089, pp. 36-50, Springer-Verlag, 2013.

SPECIAL ISSUE OF INFORMATION AND COMPUTATION DEVOTED TO ICALP 2011
Luca Aceto, Monika Henzinger and Jiri Sgall. 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), Information and Computation 222, pages 1-306, January 2013.

COMPOSITIONAL REASONING FOR EPISTEMIC LOGICS
Luca Aceto, Anna Ingolfsdottir, Cristian Prisacariu and Joshua Sack. Compositional Reasoning for Multi-modal Logics.. Proceedings of LFCS 2013, Symposium on Logical Foundations of Computer Science, January 6-8, 2013, San Diego, California, U.S.A. Lecture Notes in Computer Science 7734, pp. 1-15, Springer Verlag, 2013.
Full paper entitled Compositional Reasoning for Epistemic Logics..
Version dated 10 September 2012.
Technical Report 419, Department of Informatics, University of Oslo, Oslo, Norway, September 2012.

RULE FORMAT FOR IDEMPOTENT UNARY OPERATORS
Luca Aceto, Eugen-Ioan Goriac and Anna Ingolfsdottir. SOS Rule Formats for Idempotent Terms and Idempotent Unary Operators.. Proceedings of SOFSEM 2013: The 39th International Conference on Current Trends in Theory and Practice of Computing, Lecture Notes in Computer Science 7741, pp. 108-120, Springer-Verlag, 2013.
Version dated 23 June 2012.

ALGEBRAIC SYNCHRONIZATION TREES AND PROCESSES
Luca Aceto, Arnaud Carayol, Zoltan Esik and Anna Ingolfsdottir. Algebraic Synchronization Trees and Processes. Proceedings of ICALP 2012, Lecture Notes in Computer Science, Springer, July 2012. To appear.
The latest version of the full version of the paper is available here.

THE ACADEMIC'S ART OF WORK
Luca Aceto. Unveiling the Ivory Tower: The academic's art of work.
Version dated 6 March 2012. This is a piece for the general public that will appear in the 2012 edition of the Reykjavik University Magazine.

CHARACTERISTIC FORMULAE FOR RELATION DEFINED USING NESTED FIXED POINTS
Luca Aceto and Anna Ingolfsdottir. Characteristic formulae for relations with nested fixed points. In the Proceedings of FICS 2012, Workshop on Fixed Points in Computer Science (Z. Esik and D. Miller eds.), Electronic Proceedings in Theoretical Computer Science 77, pp. 15-22, 2012.

MODELLING AND SIMULATION IN TIMED REBECA (FULL VERSION)
Luca Aceto, Matteo Cimini, Anna Ingolfsdotti, Ali Jafari, Arni Hermann Reynisson, Steinar Hugi Sigurdarson and Marjan Sirjani. Modelling and Simulation of Real-Time Systems using Timed Rebeca. Submitted for journal publication. (Version dated 31 January 2012.)

COMPARING THREE MODAL SPECIFICATION FORMALISMS
Luca Aceto, Ignacio Fabregas, David de Frutos Escrig, Anna Ingolfsdottir and Miguel Palomino.
On the specification of modal systems: A comparison of three frameworks.
Version dated 1 December 2011.
Submitted for publication.
This is a full and revised version of an extended abstract that will appear in the Proceedings of FSEN 2011.

PROCEEDINGS OF PACO 2011
Luca Aceto and MohammadReza Mousavi. Proceedings of the First International Workshop on Process Algebra and Coordination (PACO 2011), volume 60 of Electronic Proceedings in Theoretical Computer Science, 6 August 2011.

AXIOMATIZING WEAK COMPLETE SIMULATION SEMANTICS
Luca Aceto, David de Frutos Escrig, Carlos Gregorio-Rodriguez and Anna Ingolfsdottir.
The Equational Theory of Weak Complete Simulation Semantics over BCCSP.
Version dated 26 June 2011.
To appear in the Proceedings of the 38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2012) (M. Bieliková et al. (Eds.)), Lecture Notes in Computer Science 7147, pages 141-152, Springer-Verlag, 2012.

MODAL REFINEMENT VS GRAPHICAL SPECIFICATIONS MODULO CC-SIMULATION
Luca Aceto, Ignacio Fabregas, David de Frutos Escrig, Anna Ingolfsdottir and Miguel Palomino.
Graphical representation of covariant-contravariant modal formulas.
Proceedings of EXPRESS 2011, the 18th International Workshop on Expressiveness in Concurrency, Electronic Notes in Theoretical Computer Science 64, pp. 1-15, 2011.

ICTAC 2011 PAPER
Luca Aceto, David de Frutos Escrig, Carlos Gregorio-Rodriguez and Anna Ingolfsdottir.
Axiomatizing Weak Ready Simulation Semantics over BCCSP.
Version dated 3 June 2011.
Proceedings of the 8th International Colloquium on Theoretical Aspects of Computing, ICTAC 2011, Lecture Notes in Computer Science 6919, pp. 7-24, Springer-Verlag, 2011.

PREG AXIOMATIZER: TOOL PAPER
Luca Aceto, Georgiana Caltais, Eugen-Ioan Goriac and Anna Ingolfsdottir. PREG Axiomatizer - A Ground Bisimilarity Checker for GSOS with Predicates..
Version dated 17 May 2011.
To appear in the Proceedings of CALCO 2011 as a contribution to CALCO Tools, Lecture Notes in Computer Science 6859, pp. 378-385, Springer Verlag, 2011.
The associated PREG Axiomatizer tool is available here. PREG Axiomatizer is a tool for automatically deriving ground-complete axiomatizaitons of the bisimilarity over GSOS systems (extended with predicates).

SIGMA ALGEBRAS IN PDEL
Luca Aceto, Wiebe van der Hoek, Anna Ingolfsdottir and Joshua Sack. Sigma Algebras in Probabilistic Epistemic Dynamics.
Proceedings of Thirteenth Conference on Theoretical Aspects of Rationality and Knowledge, TARK XIII (K. Apt editor), pp. 191-199, ACM, 2011.

TIMED REBECA
Luca Aceto, Matteo Cimini, Anna Ingolfsdotti, Arni Hermann Reynisson, Steinar Hugi Sigurdarson and Marjan Sirjani. Modelling and Simulation of Real-Time Systems using Timed Rebeca.
Proceedings of FOCLASA 2011, Electronic Proceedings in Theoretical Computer Science 58, pp. 1-19, 2011.
The translator from Timed Rebeca to Erlang and a more detailed description of the principles behind the translation are available here.
A full version of this paper, dated 31 January 2012, has been submitted for publication.

AXIOMATIZING GSOS WITH PREDICATES
Luca Aceto, Georgiana Caltais, Eugen-Ioan Goriac and Anna Ingolfsdottir. Axiomatizing GSOS with Predicates.
Proceedings of the Eight Workshop on Structural Operational Semantics (SOS 2011), Electronic Proceedings in Theoretical Computer Science 62, pp. 1-16, 2011.
Draft full paper dated 25 May 2011.
The associated PREG Axiomatizer tool is available here. PREG Axiomatizer is a tool for automatically deriving ground-complete axiomatizations of the bisimilarity over GSOS systems (extended with predicates).

SOS RULE FORMATS FOR DISTRIBUTIVITY
Luca Aceto, Matteo Cimini, Anna Ingolfsdottir, MohammadReza Mousavi and Michel Reniers. Rule Formats for Distributivity.
Version dated 23 December 2010.
Proceedings of LATA 2011, Lecture Notes in Computer Science 6638, pp. 80-91, Springer Verlag, 2011. The official version from Springer is here.
Full version to appear in Theoretical Computer Science, Elsevier.

AXIOMATIZING WEAK SIMULATION SEMANTICS
Luca Aceto, David de Frutos Escrig, Carlos Gregorio-Rodriguez and Anna Ingolfsdottir.
Axiomatizing Weak Simulation Semantics over BCCSP.
Version dated 11 January 2011.
Version dated 27 June 2012. Theoretical Computer Science 537:42-71, Elsevier, 5 June 2014.
The published journal paper is here.

MODAL REFINEMENT VS NOTIONS OF SIMULATION
Luca Aceto, Ignacio Fabregas, David de Frutos Escrig, Anna Ingolfsdottir and Miguel Palomino.
Relating modal refinements, covariant-contravariant simulations and partial bisimulations.
Version dated 10 November 2010.
To appear in the Proceedings of IPM International Conference on Fundamentals of Software Engineering (FSEN 2011), Tehran, Iran, April 20-22, 2011. Lecture Notes in Computer Science, Springer-Verlag.

COMPLETE/READY SIMILARITY OVER BCCSP WITH A SINGLETON ALPHABET
Luca Aceto, David de Frutos Escrig, Carlos Gregorio-Rodriguez and Anna Ingolfsdottir.
Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet.
Version dated 22 January 2011.
To appear in Information Processing Letters, Elsevier, 2011.

RULE-MATCHING BISIMULATION: JOURNAL VERSION
Luca Aceto, Matteo Cimini and Anna Ingolfsdottir.
Proving the validity of equations in GSOS languages using rule-matching bisimilarity.
Version dated 18 October 2010.
Mathematical Structures in Computer Science 22(2):291--331, Cambridge University Press, 2012.

BOOK CHAPTER ON THE ALGORITHMICS OF BISIMILARITY
Luca Aceto, Anna Ingolfsdottir and Jiri Srba. The Algorithmics of Bisimilarity.
To appear as a chapter in a book on bisimulation and coinduction edited by Jan Rutten and Davide Sangiorgi and to be published by Cambridge University Press.

AXIOMATIZING PRIORITY II
Luca Aceto, Taolue Chen, Anna Ingolfsdottir, Bas Luttik and Jaco van de Pol. On the Axiomatizability of Priority II.
Version dated 26 August 2010.
Theoretical Computer Science 412(28):3035-3044, 2011. The official journal paper is here.

SOS RULE FORMATS FOR ZERO AND UNIT ELEMENTS
Luca Aceto, Matteo Cimini, Anna Ingolfsdottir, MohammadReza Mousavi and Michel Reniers. SOS Rule Formats for Zero and Unit Elements.
Version dated 9 January 2011.
Theoretical Computer Science 412(28):3045-3071, 2011. The official journal paper is here

SOS 2010 PROCEEDINGS
Luca Aceto and Pawel Sobocinski. Proceedings of the Seventh Workshop on Structural Operational Semantics, volume 32 of Electronic Proceedings in Theoretical Computer Science, 11th August 2010.

RESOURCE AND G-BISIMILARITY COINCIDE
Luca Aceto, Anna Ingolfsdottir and Joshua Sack.
Resource bisimilarity and graded bisimilarity coincide.
New version dated 27 October 2010.
Information Processing Letters 111(2):68--76, Elsevier, 31 December 2010. The official journal version is here.

RULE FORMATS FOR DETERMINISM AND IDEMPOTENCE (JOURNAL VERSION)
Luca Aceto, Arnar Birgisson, Anna Ingolfsdottir, MohammadReza Mousavi and Michel Reniers. Rule Formats for Determinism and Idempotence.
Journal version to appear in a Special Issue of Science of Computer Programming devoted to FSEN 2009 (Farhad Arbab and Marjan Sirjani guest editors).
Version dated 31 March 2010.
The official journal version is here.

RULE FORMATS FOR ZERO AND UNIT ELEMENTS
Luca Aceto, Matteo Cimini, Anna Ingolfsdottir, MohammadReza Mousavi and Michel Reniers. On Rule Formats for Zero and Unit Elements.
Version dated 12 February 2010.
Proceedings of the Twenty-Sixth Conference on the Mathematical Foundations of Programming Semantics, University of Ottawa Thursday May 6 - Monday May 10, 2010. Electronic Notes in Theoretical Computer Science 256, pp. 145-160, Elsevier.
Official ENTCS version dated 6 September 2010.
Full version dated 12 February 2010.

CHARACTERISTIC FORMULAE: A GENERAL APPROACH (FULL PAPER)
Luca Aceto, Anna Ingolfsdottir, Paul Blain Levy and Joshua Sack.
Characteristic Formulae for Fixed-Point Semantics: A General Framework.
Version dated 18 August 2010.
Mathematical Structures in Computer Science 22(2):125--173, Cambridge University Press, 2012.

COMPOSITIONALITY FOR HML WITH PAST MODALITIES
Luca Aceto, Arnar Birgisson, Anna Ingolfsdottir, MohammadReza Mousavi. Decompositional Reasoning about the History of Parallel Processes.
Version dated 9 October 2009.
To appear in the Proceedings of IPM International Conference on Fundamentals of Software Engineering (FSEN 2011), Tehran, Iran, April 20-22, 2011. Lecture Notes in Computer Science, Springer-Verlag.

RULE FORMATS FOR ALGEBRAIC PROPERTIES
Luca Aceto, Anna Ingolfsdottir, MohammadReza Mousavi and Michel Reniers. Algebraic Properties for Free!.
Version dated 16 September 2009.
In the Concurrency Column, Bulletin of the EATCS, volume 99, pp. 81-104, October 2009.

FOREWORD FOR THE MSCS SPECIAL ISSUE IN MEMORY OF NADIA BUSI
Luca Aceto and Anna Ingolfsdottir. Foreword.
Special issue of Mathematical Structures in Computer Science in memory of Nadia Busi. To appear.

RULE FORMAT FOR UNIT ELEMENTS
Luca Aceto, Anna Ingolfsdottir, MohammadReza Mousavi and Michel Reniers. A Rule Format for Unit Elements.
Version dated Monday, 29 June 2009.
Proceedings of SOFSEM 2010: The 36th International Conference on Current Trends in Theory and Practice of Computing, Lecture Notes in Computer Science 5901, pp. 141-152, Springer-Verlag, 2010.
Official Springer version.

CHARACTERISTIC FORMULAE: A GENERAL APPROACH
Luca Aceto, Anna Ingolfsdottir and Joshua Sack.
Characteristic Formulae for Fixed-Point Semantics: A General Framework.
Version dated 14 June 2009.
To appear in the Proceedings of EXPRESS'09, 16th International Workshop on Expressiveness in Concurrency, Saturday, September 5th, 2009 Bologna (Italy).

RULE-MATCHING BISIMULATION
Luca Aceto, Matteo Cimini and Anna Ingolfsdottir.
A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages.
Proceedings of Structural Operational Semantics 2009, August 31, 2009, Bologna (Italy), EPTCS 18, 2010, pp. 1-16.
Full version accepted for Mathematical Structures in Computer Science.

PAPER ON TEACHING CONCURRENCY
Luca Aceto, Anna Ingolfsdottir, Kim G. Larsen and Jiri Srba.
Teaching Concurrency: Theory in Practice.
Version dated 19 May 2009.
Proceedings of TFM2009, 2nd Int. FME Conference on Teaching Formal Methods, "Widening Access to Formal Methods" (J. Gibbons and J. N. Oliveira, eds.), Friday, November 6th 2009, Eindhoven (The Netherlands), Lecture Notes in Computer Science 5846, pp. 158-175, Springer-Verlag, 2009.

RULE FORMATS FOR DETERMINISM AND IDEMPOTENCE
Luca Aceto, Arnar Birgisson, Anna Ingolfsdottir, MohammadReza Mousavi and Michel Reniers. Rule Formats for Determinism and Idempotence.
Version for the conference proceedings.
To appear in the Proceedings of Third FSEN: IPM International Conference on Fundamentals of Software Engineering (FSEN09), Iran, April 15-17 2009. Lecture Notes in Computer Science, Springer-Verlag, 2009.

NOTE ON THE EXPRESSIBILITY OF PRIORITY
Luca Aceto and Anna Ingolfsdottir. On the Expressibility of Priority. August 2008.
Information Processing Letter 109(1):83-85, 2008.

EQUATIONAL THEORY OF PREBISIMILARITY OVER BASIC CCS WITH DIVERGENCE
Luca Aceto, Silvio Capobianco, Anna Ingolfsdottir and Bas Luttik. The Equational Theory of Prebisimilarity over Basic CCS with Divergence. March 2008.
Information Processing Letters 108(5):255-338 (15 November 2008).

EQUATIONAL BASES FOR RESTRICTION AND RELABELLING
Luca Aceto, Anna Ingolfsdottir, Bas Luttik and Paul van Tilburg. Finite Equational Bases for Fragments of CCS with Restriction and Relabelling. Technical Report CSR-08-08, TU/Eindhoven, February 2008.
Extended abstract.
An extended abstract of this paper appears in the Proceedings of TCS 2008, 5th IFIP International Conference on Theoretical Computer Science, pp. 317-332, Springer-Verlag, September 2008.

LIFTING NON-FINITE AXIOMATIZABILITY RESULTS
Luca Aceto, Wan Fokkink, Anna Ingolfsdottir and MohammadReza Mousavi. Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras.
Technical Report CSR-08-05, TU/Eindhoven, February 2008.
An extended abstract of this paper appears in the Proceedings of TCS 2008, 5th IFIP International Conference on Theoretical Computer Science, pp. 301-316, Springer-Verlag, September 2008.
Journal version in Acta Informatica 47(3):147--177, May 2010.

AN ESSAY FOR THE GENERAL PUBLIC ON THE RELEVANCE OF COMPUTER SCIENCE
Luca Aceto and Anna Ingolfsdottir. Computer Scientist: 21st Century Renaissance Man.
Version dated 15 December 2007.

A CANCELLATION THEOREM FOR BCCSP
Luca Aceto, Wan Fokkink, and Anna Ingolfsdottir. A Cancellation Theorem for BCCSP.
Fundamenta Informaticae 88(1-2): 1-21 (2008). [EE]

APPLYING CONCURRENCY RESEARCH IN INDUSTRY
Luca Aceto, Jos Baeten, Wan Fokkink, Anna Ingolfsdottir and Uwe Nestmann. Applying Concurrency Research in Industry: Report on a Strategic Workshop.
Bulletin of the European Association for Theoretical Computer Science 94:113-129, February 2008.

RS-07-11
Abstract, PostScript, PDF, DVI.
Luca Aceto and Anna Ingolfsdottir.
The Saga of the Axiomatization of Parallel Composition.
June 2007.
15 pp. In the Proceedings of CONCUR 2007, the 18th International Conference on Concurrency Theory (Lisbon, Portugal, September 4-7, 2007), Lecture Notes in Computer Science 4703, pp. 2-16, Springer-Verlag, 2007. ISBN 978-3-540-74406-1.

RS-07-5
Abstract, PostScript, PDF, DVI.
Luca Aceto, Silvio Capobianco, and Anna Ingolfsdottir.
On the Existence of a Finite Base for Complete Trace Equivalence over BPA with Interrupt.
28 February 2007.
26 pp.
A slightly abridged version of this paper appears as a technical contribution to the Bulletin of the European Association for Theoretical Computer Science 95:220--240, June 2008.

IMPOSSIBILITY RESULTS FOR THE EQUATIONAL THEORY OF TIMED CCS
Luca Aceto, Anna Ingolfsdottir, and MohammadReza Mousavi.
Impossibility Results for the Equational Theory of Timed CCS.
Version of 16 February 2007.
In the Proceedings of the 2nd Conference on Algebra and Coalgebra in Computer Science (CALCO'07), Bergen, Norway, Lecture Notes in Computer Science 4624, pp. 80-95, Springer-Verlag, August 2007.

RS-07-3
Abstract, PostScript, PDF.
Luca Aceto, Wan Fokkink and Anna Ingolfsdottir.
Ready To Preorder: Get Your BCCSP Axiomatization for Free!
14 February 2007.
37 pp.
An extended abstract appears in the Proceedings of the 2nd Conference on Algebra and Coalgebra in Computer Science (CALCO'07), Bergen, Norway, Lecture Notes in Computer Science 4624, pp. 65-79, Springer-Verlag, August 2007.

RS-07-2
Abstract, PostScript, PDF, DVI.
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 .

BOOK ON REACTIVE SYSTEMS
Luca Aceto, Anna Ingolfsdottir, Kim G. Larsen and Jiri Srba.
Reactive Systems: Modelling, Specification and Verification.
Cambridge University Press, to appear in the spring 2007.
[Preface and Table of Contents]
The web page for the book at CUP is here. [Endorsements]
You can now purchase the book with a 20% discount using this discount flyer. Hurry up, the discount is valid only until 1 October 2007!
You can also buy the book from Amazon.co.uk or Amazon.com.

REPORT ON NWPT06
Luca Aceto and Anna Ingolfsdottir.
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
Luca Aceto.
Report on BICI (Bertinoro International Center for Informatics).
October 2006.
2 pp.
In the Bulletin of the EATCS, October 2006.

REPORT ON THE SECOND ICE-TCS SYMPOSIUM
Luca Aceto, Magnus M. Halldorsson and Anna Ingólfsdóttir.
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.

FOSSACS 2006 PROCEEDINGS
Luca Aceto and Anna Ingólfsdóttir, editors.
Foundations of Software Science and Computation Structure 2006, Proceedings, LNCS 3921, Springer-Verlag.
March 2006.

RS-06-6
Abstract, PostScript, PDF, DVI.
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.
ACM Transactions on Computational Logic Volume 10, Number 1, January 2009. [Link to the paper]
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.

ABSTRACT FOR THE INVITED TALK AT LMCS06
Luca Aceto.
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.

FINITE BASE FOR CCS (EXTENDED ABSTRACT)
Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, and Bas Luttik.
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.

RS-06-1
Abstract, PostScript, PDF, DVI.
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.
A full version of this paper appears in Mathematical Structures in Computer Science 18(1):5--28, February 2008. Special issue devoted to LMCS 2006 (Flavio Corradini and Carlo Toffalori eds.).

RS-05-33
Abstract, PostScript, PDF, DVI.
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.

ANNA'S PAPER IN TRANSACTIONS OF COMPUTATIONAL SYSTEMS BIOLOGY
Anna Ingolfsdottir and Daniel F. Gudbjartsson.
Genetic Linkage Analysis: Algorithms and their Implementation, Transactions on Computational Systems Biology III, LNBI 3737. To appear.

ANNA'S PAPER IN NATURE GENETICS
Daniel F Gudbjartsson, Thorvaldur Thorvaldsson, Augustine Kong, Gunnar Gunnarsson and Anna Ingolfsdottir, Allegro version 2, Nature Genetics Volume 37, No. 10, October 2005.
[Software (Free download)]

REPORT ON APC25
Luca Aceto.
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.

NS-05-3
Abstract, PDF
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 ICE-TCS: OPENING AND INAUGURAL SYMPOSIUM
Luca Aceto, Magnus M. Halldorsson and Anna Ingólfsdóttir.
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.

NS-05-2
Abstract, PostScript, PDF, DVI.
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.

Proceedings of the Workshop on Structural Operational Semantics (SOS 2004)
Luca Aceto, Willem Jan Fokkink, and Irek Ulidowski, editors.
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).

RS-05-19
Abstract, PostScript, PDF.
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

NS-05-1
PDF,
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.

TCS SPECIAL ISSUE DEVOTED TO THE WORKSHOP ON PROCESS ALGEBRA HELD IN BERTINORO IN 2003

Luca Aceto, Zoltán Ésik, Willem Jan Fokkink, and Anna Ingólfsdóttir, guest editors. Theoretical Computer Science Vol. 335/2-3 pp. 127-129, 23 May 2005. Our foreword to the volume is available from Science Direct following this link.
Link to the whole volume.

RS-04-24
Abstract, PostScript, PDF, DVI.
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.)

JLAP SPECIAL ISSUE ON STRUCTURAL OPERATIONAL SEMANTICS

Luca Aceto and Willem Jan Fokkink editors. Journal of Logic and Algebraic Programming, Volumes 60-61, Pages 1-463 (July - December 2004), Special issue on Structural Operational Semantics. [Editorial]

ABSTRACT OF INVITED TALK FOR EXPRESS'03

Luca Aceto, Willem Jan Fokkink, Rob J. van Glabbeek, and Anna Ingólfsdóttir. Nested Semantics over Finite Trees are Equationally Hard (Invited Talk). In the Proceedings of EXPRESS'03, Electronic Notes in Theoretical Computer Science 96:5--6, Elsevier, 2004.

NS-04-1
Abstract, PDF.
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.

RS-04-1
Abstract, PostScript, PDF, DVI.
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.

EUROCAST 2003 PAPER
Daniel Gudbjartsson, Jens A. Hansen, Anna Ingólfsdóttir, Jacob Johnsen, John Knudsen. Single Point Algorithms in Genetic Linkage Analysis. EUROCAST 2003: 372-383.

RAIRO SPECIAL ISSUE DEVOTED TO FICS 2002
Zoltán Ésik, Anna Ingólfsdóttir: Foreword. ITA 37(4): 272 (2003)

RS-03-34
Abstract, PostScript, PDF, DVI.
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.

NS-03-3
Abstract, PDF.
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.

NS-03-2
Abstract, PostScript, PDF, DVI.
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.

RS-03-27
Abstract, PostScript, PDF, DVI.
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.)

MSCS SPECIAL ISSUE

Luca Aceto, Giuseppe Longo and Björn Victor editors. Mathematical Structures in Computer Science, 13(4) (2003), Special issue devoted to "The Difference between Concurrent and Sequential Computation" and to selected papers from EXPRESS'00: 7th International Workshop on Expressiveness in Concurrency. [Foreword]

RS-03-17
Abstract, PostScript, PDF.
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.

RS-03-15
Abstract, PostScript, PDF, DVI.
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.

RS-02-42
Abstract, PostScript, PDF.
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.

RS-02-40
Abstract, PostScript, PDF, DVI.
Luca Aceto, Willem Jan Fokkink, and Anna Ingolfsdottir.
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.]

NS-02-4
Abstract, PostScript, PDF.
Daniel Gudbjartsson, Anna Ingólfsdóttir, and Augustin Kong.
An BDD-Based Implementation of the Allegro Software.
August 2002.
2 pp.

SELECTED PAPERS OF THE EIGHTH INTERNATIONAL WORKSHOP ON EXPRESSIVENESS IN CONCURRENCY (EXPRESS'01), AUGUST 20, 2001
Luca Aceto and Prakash Panangaden editors. Nordic Journal of Computing, Volume 9(2), (Summer 2002).

NS-02-2
Abstract, PDF.
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.

RS-02-7
Abstract, PostScript, PDF.
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.

RS-02-6
Abstract, PostScript, PDF, DVI.
Luca Aceto, Zoltan Esik, 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.

PROCEEDINGS of the 8th INTERNATIONAL WORKSHOP on EXPRESSIVENESS in CONCURRENCY, EXPRESS '01, (Aalborg, Denmark, August 20, 2001), August 2001.

Luca Aceto and Prakash Panangaden, editors. Electronic Notes in Theoretical Computer Science, 52(1) (January 2002)

IPL SPECIAL ISSUE ON PROCESS ALGEBRA

Luca Aceto and Willem Jan Fokkink editors. Information Processing Letters, 80(1):1 (October 2001), Special issue on process algebra. [Preface]

INVITED PAPER FOR THE WORKSHOP ON MAX-PLUS ALGEBRAS

Luca Aceto, Zoltan Esik, and Anna Ingolfsdottir. Nonfinitely Based Tropical Semirings. In the Proceedings of the WORKSHOP ON MAX-PLUS ALGEBRAS and Their Applications to Discrete-event Systems, Theoretical Computer Science, and Optimization, 27-29 August, 2001, Prague, (S. Gaubert and J. J. Loiseau editors), IFAC (International Federation of Automatic Control) Publications, Elsevier Science.

NS-01-6
Abstract, PDF.
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.

RS-01-28
Abstract, PostScript, PDF, DVI.
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]

RS-01-21
Abstract, PostScript, PDF, DVI.
Luca Aceto, Zoltan Esik, and Anna Ingolfsdottir.
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.]

RS-00-23
Abstract, PostScript, PDF, DVI.
Luca Aceto, Anna Ingolfsdottir, 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) .

RS-00-20
Abstract, PostScript, PDF, DVI.
Luca Aceto, Willem Jan Fokkink, and Anna Ingolfsdottir.
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)]

NS-00-2
Abstract, PostScript, PDF.
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.

RS-99-33
Abstract, PostScript, PDF, DVI.
Luca Aceto, Zoltan Esik, and Anna Ingolfsdottir.
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.

RS-99-32
Abstract, PostScript, PDF.
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\lowski, Pacholski and Wierzbicki, editors, Mathematical Foundations of Computer Science: 24th International Symposium, MFCS '99 Proceedings, LNCS 1672, 1999, pages 125-136.
Full version appears in the Journal of Logic and Algebraic Programming, Volumes 52-53, July-August 2002, Pages 7-51.

RS-99-30
Abstract, PostScript, PDF, DVI.
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.

RS-99-24
Abstract, PostScript, PDF, DVI.
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.

RS-99-22
Abstract, PostScript, PDF, DVI.
Luca Aceto, Zoltan Esik, and Anna Ingolfsdottir.
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.

RS-98-50
Abstract, PostScript, PDF, DVI.
Luca Aceto and Anna Ingolfsdottir. 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.

RS-98-49
Abstract, PostScript, PDF, DVI.
Luca Aceto, Willem Jan Fokkink, and Anna Ingolfsdottir. 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.

RS-98-48
Abstract, PostScript, PDF, DVI.
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.

RS-97-29
Abstract, PostScript, PDF.
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.

RS-97-26
Abstract, PostScript, PDF, DVI.
Luca Aceto and Anna Ingolfsdottir. A Characterization of Finitary Bisimulation. October 1997. 9 pp. Information Processing Letters 64(3):127-134, 14 November 1997.

RS-96-43
Abstract, PostScript, PDF, DVI.
Anna Ingolfsdottir. 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.

RS-96-36
Abstract, PostScript, PDF, DVI.
Luca Aceto, Willem J. Fokkink, and Anna Ingolfsdottir. 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.]

RS-96-23
Abstract, PostScript, DVI.
Luca Aceto, Willem J. Fokkink, and Anna Ingolfsdottir. 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.]

RS-96-22
Abstract, PostScript, DVI.
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.]

RS-95-59
Abstract, PostScript, DVI.
Luca Aceto and Anna Ingolfsdottir. On the Finitary Bisimulation. November 1995. 29 pp.

RS-95-56
Abstract, PostScript, DVI.
Luca Aceto, Willem J. Fokkink, Rob J. van Glabbeek, and Anna Ingolfsdottir. Axiomatizing Prefix Iteration with Silent Steps. November 1995. 25 pp. Information and Computation 127(1):26-40. [AMS Review.]

RS-95-40
Abstract, PostScript, DVI.
Anna Ingolfsdottir 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.

RS-95-28
Abstract, PostScript, DVI.
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.

RS-95-22
Abstract, PostScript, DVI .
Anna Ingolfsdottir. A Semantic Theory for Value--Passing Processes, Late Approach, Part II: A Behavioural Semantics and Full Abstractness. April 1995. 33 pp.

RS-95-5
Abstract, PostScript, DVI.
Luca Aceto and Anna Ingolfsdottir. 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.

RS-95-3
Abstract, PostScript, DVI.
Anna Ingolfsdottir. A Semantic Theory for Value--Passing Processes, Late Approach, Part I: A Denotational Model and Its Complete Axiomatization. January 1995. 37 pp.

RS-94-43
Abstract, PostScript, DVI.
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.]

RS-94-40
Abstract, PostScript, DVI.
Luca Aceto and Anna Ingolfsdottir. 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.

A Selection of Other Old Papers



THESIS: Never let ideology or ``good taste'' stop you from proving a good theorem. (Saharon Shelah in The Future of Set Theory)