Publicaciones (78) Publicaciones de DAVID DE FRUTOS ESCRIG

2021

  1. Distributed population protocols: Naturally!

    CEUR Workshop Proceedings

  2. Investigating Reversibility of Steps in Petri Nets

    Fundamenta Informaticae, Vol. 183, Núm. 1-2, pp. 67-96

2020

  1. Beyond ω-regular languages: ωT-regular expressions and their automata and logic counterparts

    Theoretical Computer Science, Vol. 813, pp. 270-304

2019

  1. Reversing Steps in Petri Nets

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2018

  1. An efficient characterization of petri net solvable binary words

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2017

  1. Evaluation of temporal datasets via interval temporal logic model checking

    Leibniz International Proceedings in Informatics, LIPIcs

  2. Games for bisimulations and abstraction

    Logical Methods in Computer Science, Vol. 13, Núm. 4

  3. Special issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015)

    Acta Informatica

  4. Trace simulation semantics is not finitely based over BCCSP

    Acta Cybernetica, Vol. 23, Núm. 1, pp. 81-90

2016

  1. Branching bisimulation games

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2015

  1. Proving continuity of coinductive global bisimulation distances: A never ending story

    Electronic Proceedings in Theoretical Computer Science, EPTCS

2014

  1. Axiomatizing weak simulation semantics over BCCSP

    Theoretical Computer Science, Vol. 537, Núm. C, pp. 42-71

  2. Coinductive definition of distances between processes: Beyond bisimulation distances

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2013

  1. Distances between processes: A pure algebraic approach

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. On the specification of modal systems: A comparison of three frameworks

    Science of Computer Programming

  3. Unifying the linear time-branching time spectrum of strong process semantics

    Logical Methods in Computer Science, Vol. 9, Núm. 2

2012

  1. Alan Turing: una aproximación personal a su obra

    Gaceta de la Real Sociedad Matematica Española, Vol. 15, Núm. 4, pp. 675-696

  2. Defining distances for all process semantics

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  3. Relating modal refinements, covariant-contravariant simulations and partial bisimulations

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  4. The equational theory of weak complete simulation semantics over BCCSP

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)