Select Publications
Journal articles
2007, 'Remarks on Testing Probabilistic Processes', Electronic Notes in Theoretical Computer Science, 172, pp. 359 - 397, http://dx.doi.org/10.1016/j.entcs.2007.02.013
,2006, 'Erratum to "On the expressiveness of higher dimensional automata". [Theoret. Comput. Sci. 356 (2006) 265-290] (DOI:10.1016/j.tcs.2006.02.012)', Theoretical Computer Science, 368, pp. 168 - 194, http://dx.doi.org/10.1016/j.tcs.2006.06.024
,2006, 'Divide and congruence: From decomposition of modalities to preservation of branching bisimulation', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4111 LNCS, pp. 195 - 218, http://dx.doi.org/10.1007/11804192_10
,2006, 'Compositionality of Hennessy-Milner logic by structural operational semantics', Theoretical Computer Science, 354, pp. 421 - 440
,2006, 'On Specifying Timeouts', Electronic Notes in Theoretical Computer Science, 162, pp. 173 - 175, http://dx.doi.org/10.1016/j.entcs.2005.12.083
,2006, 'On the expressiveness of higher dimensional automata', Theoretical Computer Science, 356, pp. 265 - 290, http://dx.doi.org/10.1016/j.tcs.2006.02.012
,2006, 'On the expressiveness of higher dimensional automata (vol 356, pg 265, 2006)', Theoretical Computer Science, 368, pp. 168 - 194
,2005, 'On cool congruence formats for weak bisimulations', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3722 LNCS, pp. 318 - 333, http://dx.doi.org/10.1007/11560647_21
,2005, 'Proof nets for unit-free multiplicative additive linear logic', ACM Transactions on Computational Logic, 6 (4), pp. 784 - 842
,2004, 'Nested semantics over finite trees are equationally hard', Information and Computation, 191, pp. 203 - 232, http://dx.doi.org/10.1016/j.ic.2004.02.001
,2004, 'Well-behaved flow event structures for parallel composition and action refinement', Theoretical Computer Science, 311, pp. 463 - 478, http://dx.doi.org/10.1016/j.tcs.2003.10.031
,2004, 'Event structures for resolvable conflict', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3153, pp. 550 - 561, http://dx.doi.org/10.1007/978-3-540-28629-5_42
,2004, 'Precongruence formats for decorated trace semantics', ACM Transactions on Computational Logic, 5, pp. 26 - 78, http://dx.doi.org/10.1145/963927.963929
,2004, 'The meaning of negative premises in transition system specifications II', Journal of Logic and Algebraic Programming, 60-61, pp. 229 - 258, http://dx.doi.org/10.1016/j.jlap.2004.03.007
,2003, 'Proof nets for unit-free multiplicative-additive linear logic', Proceedings - Symposium on Logic in Computer Science, pp. 1 - 10
,2003, 'Nested Semantics over Finite Trees are Equationally Hard', BRICS Report Series, 10, http://dx.doi.org/10.7146/brics.v10i27.21795
,2003, 'Bundle event structures and CCSP', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2761, pp. 57 - 71, http://dx.doi.org/10.1007/978-3-540-45187-7_4
,2003, 'Compositionality of Hennessy-Milner logic through structural operational semantics', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2751, pp. 412 - 422, http://dx.doi.org/10.1007/978-3-540-45077-1_38
,2003, 'Query nets: Interacting workflow modules that ensure global termination', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2678, pp. 184 - 199, http://dx.doi.org/10.1007/3-540-44895-0_13
,2002, 'Token-controlled place refinement in hierarchical petri nets with application to active document workflow', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2360 LNCS, pp. 394 - 413, http://dx.doi.org/10.1007/3-540-48068-4_23
,2001, 'Refinement of actions and equivalence notions for concurrent systems', Acta Informatica, 37, pp. 229 - 327, http://dx.doi.org/10.1007/s002360000041
,2000, 'Information and Computation: Preface', Information and Computation, 156, pp. 1, http://dx.doi.org/10.1006/inco.1999.2815
,2000, 'Precongruence formats for decorated trace preorders', Proceedings - Symposium on Logic in Computer Science, pp. 107 - 118, http://dx.doi.org/10.1109/LICS.2000.855760
,1999, 'Petri nets, configuration structures, and higher dimensional automata', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1664 LNCS, pp. 21 - 27, http://dx.doi.org/10.1007/3-540-48320-9_3
,1997, 'The Difference between Splitting in n and n + 1', Information and Computation, 136, pp. 109 - 142, http://dx.doi.org/10.1006/inco.1997.2634
,1997, 'Notes on the methodology of CCS and CSP', Theoretical Computer Science, 177, pp. 329 - 349, http://dx.doi.org/10.1016/S0304-3975(96)00251-4
,1996, 'Axiomatizing Prefix Iteration with Silent Steps', Information and Computation, 127, pp. 26 - 40, http://dx.doi.org/10.1006/inco.1996.0047
,1996, 'Ntyft/ntyxt Rules Reduce to Ntree Rules', Information and Computation, 126, pp. 1 - 10, http://dx.doi.org/10.1006/inco.1996.0030
,1996, 'Branching time and abstraction in bisimulation semantics', Journal of the ACM, 43, pp. 555 - 600, http://dx.doi.org/10.1145/233551.233556
,1995, 'Axiomatizing Prefix Iteration with Silent Steps', BRICS Report Series, 2, http://dx.doi.org/10.7146/brics.v2i56.19957
,1995, 'Configuration structures (extended abstract)', Proceedings - Symposium on Logic in Computer Science, pp. 199 - 209
,1993, 'Modular specification of process algebras', Theoretical Computer Science, 113, pp. 293 - 348, http://dx.doi.org/10.1016/0304-3975(93)90006-F
,1990, 'Reactive, generative, and stratified models of probabilistic processes', Proceedings - Symposium on Logic in Computer Science, pp. 130 - 141
,1989, 'Abstraction and Empty Process in Process Algebra1', Fundamenta Informaticae, 12, pp. 221 - 241, http://dx.doi.org/10.3233/fi-1989-12208
,Conference Papers
2024, 'Semantics for Linear-time Temporal Logic with Finite Observations', in Electronic Proceedings in Theoretical Computer Science, EPTCS, pp. 35 - 50, http://dx.doi.org/10.4204/EPTCS.412.4
,2024, 'Branching Bisimilarity for Processes with Time-Outs', in Leibniz International Proceedings in Informatics, LIPIcs, http://dx.doi.org/10.4230/LIPIcs.CONCUR.2024.36
,2023, 'A Cancellation Law for Probabilistic Processes', in Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, Antwerp, Belgium, pp. 42 - 58, presented at Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantics (EXPRESS/SOS 2023), Antwerp, Belgium, 18 September 2023, http://dx.doi.org/10.4204/EPTCS.387.5
,2023, 'A Lean-Congruence Format for EP-Bisimilarity', in Electronic Proceedings in Theoretical Computer Science, EPTCS, pp. 59 - 75, http://dx.doi.org/10.4204/EPTCS.387.6
,2022, 'Comparing the expressiveness of the π -calculus and CCS', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Munich, Germany, pp. 548 - 574, presented at 31st European Symposium on Programming, ESOP 2022, Munich, Germany, 02 April 2022 - 07 April 2022, http://dx.doi.org/10.1007/978-3-030-99336-8_20
,2021, 'Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom', in 2021 36TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), IEEE, ELECTR NETWORK, Univ Roma La Sapienza, presented at 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), ELECTR NETWORK, Univ Roma La Sapienza, 29 June 2021 - 02 July 2021, http://dx.doi.org/10.1109/LICS52264.2021.9470531
,2020, 'Reactive temporal logic', in Electronic Proceedings in Theoretical Computer Science, EPTCS, pp. 51 - 68, http://dx.doi.org/10.4204/EPTCS.322.6
,2020, 'Reactive bisimulation semantics for a process algebra with time-outs', in Leibniz International Proceedings in Informatics, LIPIcs, pp. 61 - 623, http://dx.doi.org/10.4230/LIPIcs.CONCUR.2020.6
,2020, 'Feasibility of Cross-Chain Payment with Success Guarantees', in Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 579 - 581, http://dx.doi.org/10.1145/3350755.3400264
,2020, 'Formalising the optimised link state routing protocol', in Electronic Proceedings in Theoretical Computer Science, EPTCS, pp. 40 - 71, http://dx.doi.org/10.4204/EPTCS.316.3
,2019, 'On the meaning of transition system specifications', in Electronic Proceedings in Theoretical Computer Science, EPTCS, Amsterdam, The Netherlands, pp. 69 - 85, presented at EXPRESS/SOS, Amsterdam, The Netherlands, 26 August 2019, http://dx.doi.org/10.4204/EPTCS.300.5
,2019, 'Preface', in Leibniz International Proceedings in Informatics, LIPIcs
,2019, 'A Process Algebra for Link Layer Protocols', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Prague, Czech Republic, pp. 668 - 693, presented at 28th European Symposium on Programming, ESOP 2019, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, proceedings, Prague, Czech Republic, 06 April 2019 - 11 April 2019, http://dx.doi.org/10.1007/978-3-030-17184-1_24
,2019, 'Justness: A Completeness Criterion for Capturing Liveness Properties (Extended Abstract)', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Prague, Czech Republic, pp. 505 - 522, presented at 22nd International Conference, FOSSACS 2019, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, proceedings, Prague, Czech Republic, 06 April 2019 - 11 April 2019, http://dx.doi.org/10.1007/978-3-030-17127-8_29
,2018, 'Analysing AWN-specifications using mCRL2 (extended abstract)', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Maynooth, Ireland, pp. 398 - 418, presented at International Conference on Integrated Formal Methods, Maynooth, Ireland, 05 September 2018 - 07 September 2018, http://dx.doi.org/10.1007/978-3-319-98938-9_23
,2018, 'Preface', in Electronic Proceedings in Theoretical Computer Science, EPTCS, http://dx.doi.org/10.4204/EPTCS.268
,