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

2013

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

    Science of Computer Programming

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

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

2012

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

2011

  1. Accelerations for the coverability set of Petri nets with names

    Fundamenta Informaticae

  2. Decidability and complexity of Petri nets with unordered data

    Theoretical Computer Science, Vol. 412, Núm. 34, pp. 4439-4451

2010

  1. Decidability problems in Petri nets with names and replication

    Fundamenta Informaticae

  2. Equational characterization of covariant-contravariant simulation and conformance simulation semantics

    Electronic Proceedings in Theoretical Computer Science, EPTCS

  3. Forward analysis for petri nets with name creation

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

  4. Logics for contravariant simulations

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

2009

  1. Decidability results for restricted models of petri nets with name creation and replication

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

  2. Non-strongly stable orders also define interesting simulation relations

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

  3. On the Unification of Process Semantics: Equational Semantics

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

  4. 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. Multiset bisimulations as a common framework for ordinary and probabilistic bisimulations

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

  3. Name creation vs. replication in petri net systems

    Fundamenta Informaticae

2007

  1. Name creation vs. replication in Petri net systems

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

  2. New bisimulation semantics for distributed systems

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

  3. On the Expressiveness of Mobile Synchronizing Petri Nets

    Electronic Notes in Theoretical Computer Science, Vol. 180, Núm. 1, pp. 77-94

  4. Reflection and preservation of properties in coalgebraic (bi)simulations

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