Top of this page

Skip navigation, go straight to the content

Eindhoven University of Technology
# Department of Mathematics & Computer Science

This page contains a list of my papers, published or unpublished.

For papers and other writings produced during my Bachelor and Master education, please refer to the publication list on my personal homepage.

**Finite Equational Bases for Fragments of CCS with Restriction and Relabelling**

(with Luca Aceto, Anna Ingólfsdóttir and Bas Luttik)

In: Ausiello, G., Karhumäki, J., Mauri, G. and Ong, L. (eds.)*Proceedings of the Fifth IFIP Conference on Theoretical Computer Science*(TCS’08, track B), Milan, Italy. No. 273 in IFIP International Federation for Information Processing, pp. 317—332. Springer-Verlag Boston, July 2008.

[PDF, SpringerLink, BibTeX]**A Context-Free Process as a Pushdown Automaton**

(with Jos Baeten and Pieter Cuijpers)

In: Breugel, F. van and Chechik, M. (eds.)*Proceedings of the 19th International Conference on Concurrency Theory*(CONCUR’08), Toronto, Canada. Lecture Notes in Computer Science, vol. 5201, pp. 98—113. Springer Berlin/Heidelberg, August 2008.

[PDF, SpringerLink, BibTeX]**A Basic Parallel Process as a Parallel Pushdown Automaton**

(with Jos Baeten and Pieter Cuijpers)

In: Hildebrandt, T., Gorla, D. (eds.)*Proceedings of the 15th International Workshop on Expressiveness in Concurrency*(EXPRESS’08), Toronto, Canada. Electronic Notes in Computer Science, vol. 242(1), pp. 35–48. Elsevier, July 2009.

[PDF, ScienceDirect, BibTeX]**A Process-Theoretic Look at Automata**

(with Jos Baeten, Pieter Cuijpers and Bas Luttik)

In: Arbab, F. and Sirjani, M. (eds.)*Proceedings of the 3rd International Conference on Fundamentals of Software Engineering*(FSEN’09), Kish Island, Iran. Lecture Notes in Computer Science, vol. 5961, pp. 1—33. Springer Berlin/Heidelberg, January 2010.

[PDF, SpringerLink, BibTeX]**Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition**

(with Bas Luttik and Tim Muller)

In: Fröschle, S. B. and Valencia, F. D. (eds.)*Proceedings of the 17th International Workshop on Expressiveness in Concurrency*(EXPRESS 2010), Paris, France. Electronic Proceedings in Theoretical Computer Science, vol. 41, pp. 1-15. Open Publishing Association Australia, November 2010.

[PDF, PDF – full version, arXiv, BibTeX]**Computations and Interaction**

(with Jos Baeten and Bas Luttik)

In: Natarajan, R. and Ojo, A. (eds).*Proceedings of the 7th International Conference on Distributed Computing and Internet Technology*(ICDCIT 2011), Bhubaneswar, India. Lecture Notes in Computer Science, vol. 6536, pp. 35—54. Springer Berlin/Heidelberg, 2011.

[PDF, SpringerLink, BibTeX]**Reactive Turing Machines**

(with Jos Baeten and Bas Luttik)

In: Owe, O. and Steffen, M. and Telle, J. (eds).*Proceedings of the 18th International Symposium on Fundamentals of Computation Theory*(FCT 2011), Oslo, Norway. Lecture Notes in Computer Science, vol. 6914, pp. 348–359. Springer Berlin/Heidelberg, 2011.

[PDF, SpringerLink, BibTex]

**Finite Equational Bases for Fragments of CCS with Restriction and Relabelling**

(with Luca Aceto, Anna Ingólfsdóttir and Bas Luttik)

CS-Report 08-08, Eindhoven University of Technology, February 2008.

[PDF, BibTeX]**Queue Merge: a Binary Operator for Modeling Queueing Behavior**

(with Pieter Cuijpers, Frank Koenders, Mark Pustjens, Bram Senders and Pieter Verduijn)

CS-Report 09-02, Eindhoven University of Technology, March 2009.

[PDF, BibTeX]**Reactive Turing Machines**

(with Jos Baeten and Bas Luttik)

arXiv 1104.1738 [cs.LO], Cornell University Library, February 2012.

[PDF, arXiv, BibTex]

**Models of Computation: Automata and Processes**

(with Jos Baeten, Pieter Cuijpers and Bas Luttik)

In:*Proceedings of the 1st Young Researchers Workshop on Concurrency Theory*(YR-CONCUR’09), Bologna, Italy. September 2009.

[PDF]**Reactive Turing Machines and ACPτ**

In:*Proceedings of the 2nd Young Researchers Workshop on Concurrency Theory*(YR-CONCUR 2010), Paris, France. September, 2010.

[PDF]

**Finite Equational Bases for CCS with Restriction**

Master’s Thesis. Department of Mathematics and Computer Science, Eindhoven University of Technology, June 2007.

[PDF, BibTeX]**From Computability to Executability — A process-theoretic view on automata theory**

Ph.D. Thesis. Department of Mathematics and Computer Science, Eindhoven University of Technology, October 2011.

[see this page]

**Models of Computation: Automata and Processes**

at the IPA Fall Days, Deurne, November 28, 2007.

[slides]**Finite Equational Bases for Fragments of CCS with Restriction and Relabelling**

at ProSe, Eindhoven University of Technology, March 27, 2008.

[slides]**A Context-Free Process as a Pushdown Automaton**

at ProSe, Eindhoven University of Technology, June 12, 2008.

[slides**A Context-Free Process as a Pushdown Automaton**(also discusses the basic parallel processes as a parallel pushdown automaton)

at TCS seminar, Vrije Universiteit, Amsterdam, June 20, 2008

[slides]**A Context-Free Process as a Pushdown Automaton**

at CONCUR 2008, Toronto, Canada, August 19, 2008.

[slides]**A Basic Parallel Process as a Parallel Pushdown Automaton**

at EXPRESS 2008, Toronto, Canada, August 23, 2008.

[slides]**Finite Equational Bases for Fragments of CCS with Restriction and Relabelling**

at WCC/TCS 2008, Milan, Italy, September 8, 2008.

[slides]**Formal Languages, Automata and Processes – Finished and Future Work**

at the IPA Fall Days, Nunspeet, November 27, 2008.

[slides]**Models of Computation: Automata and Processes – An Overview**

at the ICE-TCS Theory Day 2009, Reykjavík University, Reykjavík, June 19, 2009.

[slides]**Models of Computation: Automata and Processes**

at YR-CONCUR 2009, Bologna, Italy, September 5, 2009.

[slides]**Decidability of Bisimulation for Sequential and Basic Parallel Processes with 0 and 1**

at ProSe, Eindhoven University of Technology, February 25, 2010.

[slides]**Reactive Turing Machines and ACPτ**

at YR-CONCUR 2010, Paris, France. September 4, 2010.

[slides]