Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456

Address: [go: Go Back, main page]
Remove Scripts Accept Cookies Show Images Show Referer Rotate13 Base64 Strip Meta Strip Title Session Cookies

Recent Papers by Luca Aceto and/or Anna Ingólfsdóttir

"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

BRICS Reports and Other Recent Papers

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

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.
Draft of a full version of this paper dated Fri Nov 8 11:45:21 MET 2002. Updates will be posted soon.

RS-02-40

Abstract, PostScript, PDF, DVI.
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 RECENT POSITION PAPER OF ANNA'S ON LINKAGE ANALYSIS

Daniel Gudbjartsson, Anna Ingólfsdóttir and Augustine Kong. A BDD-based implementation of the Allegro software, July 2002.

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).

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, 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.

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, Zoltán Ésik, and Anna Ingólfsdóttir. 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, 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)]
[Revised version to appear in Theoretical Computer Science dated Sun Sep 29 17:01:51 MEST 2002 (PDF files with hyper-references).]

RS-00-23

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

RS-00-20

Abstract, PostScript, PDF, DVI.
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)]

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, 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. To appear in Theoretical Computer Science.

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 Kutyowski, Pacholski and Wierzbicki, editors, Mathematical Foundations of Computer Science: 24th International Symposium, MFCS '99 Proceedings, LNCS 1672, 1999, pages 125-136.
Full version (.ps file) to appear in the Journal of Logic and Algebraic Programming.

RS-99-30

Abstract, PostScript, PDF, DVI.
Luca Aceto, Willem Jan Fokkink, and Chris Verhoef.
Structural Operational Semantics.
September 1999.
128 pp. To appear in Bergstra, Ponse and Smolka, editors, Handbook of Process Algebra, Elsevier. (Expected to be in print in 1999/2000.)

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, 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.

RS-98-50

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

RS-98-49

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

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 Ingólfsdóttir. 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 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.

RS-96-36

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

RS-96-23

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

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 Ingólfsdóttir. 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 Ingólfsdóttir. 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 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.

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 Ingólfsdóttir. 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 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.

RS-95-3

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

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 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.

A Selection of Other Recent Journal Papers

• Luca Aceto and David Murphy. Timing and Causality in Process Algebra. Acta Informatica, 33(4):317--350, June 1996. (Postscript) [AMS Review.]

• Luca Aceto. On "Axiomatising Finite Concurrent Processes". SIAM Journal on Computing, 23(4):852--863, August 1994. (DVI) [AMS Review.]

• Luca Aceto, Bard Bloom and Frits Willem Vaandrager. Turning SOS rules into equations. LICS'92 Special Issue of Information and Computation, 111(1):1-52, 1994. (Postscript)

• Luca Aceto. Relating Distributed, Temporal and Causal Observations of Simple Processes. Fundamenta Informaticae, 17(4):369--397, December 1992. (Postscript)

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