Publikationen, an denen er mitarbeitet DAVID DE FRUTOS ESCRIG (22)

2014

  1. Axiomatizing weak simulation semantics over BCCSP

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

2013

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

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

2012

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

2011

  1. Axiomatizing weak ready simulation semantics over BCCSP

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

  2. Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet

    Information Processing Letters, Vol. 111, Núm. 9, pp. 408-413

2009

  1. (Bi)simulations up-to characterise process semantics

    Information and Computation

  2. On the Unification of Process Semantics: Equational Semantics

    Electronic Notes in Theoretical Computer Science, Vol. 249, pp. 243-267

  3. Ready to preorder: an algebraic and general proof

    Journal of Logic and Algebraic Programming, Vol. 78, Núm. 7, pp. 539-551

2008

  1. Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences

    Electronic Notes in Theoretical Computer Science, Vol. 212, Núm. C, pp. 149-162

  2. Constrained Simulations, Nested Simulation Semantics and Counting Bisimulations

    Electronic Notes in Theoretical Computer Science, Vol. 206, Núm. C, pp. 41-58

  3. Universal coinductive characterisations of process semantics

    IFIP International Federation for Information Processing

2007

  1. New bisimulation semantics for distributed systems

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

  2. Simulations Up-to and Canonical Preorders. (Extended Abstract)

    Electronic Notes in Theoretical Computer Science, Vol. 192, Núm. 1 SPEC. ISS., pp. 13-28

  3. Testing semantics for urgent timed process algebras

    Real-time Systems: Modeling, Design And Applications (World Scientific Publishing Co.), pp. 221-235

2006

  1. Process equivalences as global bisimulations

    Journal of Universal Computer Science

2005

  1. Bisimulations up-to for the linear time branching time spectrum

    Lecture Notes in Computer Science

  2. Preserving contexts for soft conformance relation

    Lecture Notes in Computer Science

2004

  1. Preface

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

1998

  1. An invitation to friendly testing

    Journal of Computer Science and Technology, Vol. 13, Núm. 6

  2. Invitation to friendly testing

    Journal of Computer Science and Technology, Vol. 13, Núm. 6, pp. 531-545