A Characterization of Plotkin's Order in Powerdomains, and Some of its Properties. - David de Frutos-Escrig (Theor. Comput. Sci., 1984)

Some Probabilistic Powerdomains in the Category SFP. - David de Frutos-Escrig (STACS, 1986)

Probabilistic Ianov's Schemes. - David de Frutos-Escrig (Theor. Comput. Sci., 1987)

TIC: A Timed Calculus for LOTOS. - Juan Quemada; Arturo Azcorra; David de Frutos-Escrig (FORTE, 1989)

Graphical Composition Theorems for Parallel and Hiding Operators. - Tommaso Bolognesi; David de Frutos-Escrig; Yolanda Ortega-Mallén (FORTE, 1990)

Timed Observations: A Semantic Model for Real-Time Concurrency. - Yolanda Ortega-Mallén; David de Frutos-Escrig (Programming Concepts and Methods, 1990)

Inverse Expansion. - Santiago Pavón; M. Hulström; Juan Quemada; David de Frutos-Escrig; Y. Ortega (FORTE, 1991)

Simulation of Timed Petri Nets by Ordinary Petri Nets and Applications to Decidability of the Timed Reachability Problem and other Related Problems. - Valentín Valero Ruiz; David de Frutos-Escrig; Fernando Cuartero (PNPM, 1991)

On Narrowing Strategies for Partial Non-Strict Functions. - David de Frutos-Escrig; María-Inés Fernández-Camacho (TAPSOFT, Vol.2, 1991)

A Complete Proof System for Timed Observations. - Yolanda Ortega-Mallén; David de Frutos-Escrig (TAPSOFT, Vol.1, 1991)

A Characterization of LOTOS Representable Networks of Parallel Processes. - David de Frutos-Escrig (AMAST, 1993)

Decidability of the strict reachability problem for TPN's with rational and real durations. - Valentín Valero Ruiz; David de Frutos-Escrig; Fernando Cuartero Gómez (PNPM, 1993)

TIC: A TImed Calculus. - Juan Quemada; David de Frutos-Escrig; Arturo Azcorra (Formal Aspects Comput., 1993)

Timed Processes of Timed Petri Nets. - Valentín Valero Ruiz; David de Frutos-Escrig; Fernando Cuartero (Application and Theory of Petri Nets, 1995)

Acceptance Trees for Probabilistic Processes. - Manuel Núñez 001; David de Frutos-Escrig; Luis Fernando Llana Díaz (CONCUR, 1995)

Testing Semantics for Probabilistic LOTOS. - Manuel Núñez 001; David de Frutos-Escrig (FORTE, 1995)

Characterizing termination in LOTOS via testing. - David de Frutos-Escrig; Manuel Núñez 001; Juan Quemada (PSTV, 1995)

A Sound and Complete Proof System for Probabilistic Processes. - Fernando Cuartero; David de Frutos-Escrig; Valentín Valero Ruiz (ARTS, 1997)

Denotational Semantics for Timed Testing. - Luis Fernando Llana Díaz; David de Frutos-Escrig (ARTS, 1997)

Friendly Testing as a Conformance Relation. - David de Frutos-Escrig; Luis Fernando Llana Díaz; Manuel Núñez 001 (FORTE, 1997)

An invitation to friendly testing. - David de Frutos-Escrig; Luis Fernando Llana Díaz; Manuel Núñez 001 (J. Comput. Sci. Technol., 1998)

Relating May and Must Testing Semantics for Discrete Timed Process Algebras. - Luis Fernando Llana Díaz; David de Frutos-Escrig (ASIAN, 1999)

Global Timed Bisimulation: An Introduction. - David de Frutos-Escrig; Natalia López; Manuel Núñez 001 (FORTE, 1999)

On non-decidability of reachability for timed-arc Petri nets. - Valentín Valero Ruiz; David de Frutos-Escrig; Fernando Cuartero Gómez (PNPM, 1999)

Decidability of Properties of Timed-Arc Petri Nets. - David de Frutos-Escrig; Valentín Valero Ruiz; Olga Marroquín Alonso (ICATPN, 2000)

Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic. - Roberto Bruni 001; David de Frutos-Escrig; Narciso Martí-Oliet; Ugo Montanari (CONCUR, 2000)

Extending the Petri Box Calculus with Time. - Olga Marroquín Alonso; David de Frutos-Escrig (ICATPN, 2001)

sPBC: A Markovian Extension of Finite Petri box calculus. - Hermenegilda Macià; Valentín Valero; David de Frutos-Escrig (PNPM, 2001)

Replicated Ambient Petri Nets. - David de Frutos-Escrig; Olga Marroquín Alonso (International Conference on Computational Science, 2003)

Ambient Petri nets. - David de Frutos-Escrig; Olga Marroquín Alonso (FGC, 2003)

Preserving Contexts for Soft Conformance Relation. - David de Frutos-Escrig; Carlos Gregorio-Rodríguez (FATES, 2004)

Tagged Systems: A Framework for the Specification of History-dependent Properties. - Fernando Rosa-Velardo; Clara Segura; David de Frutos-Escrig (PROLE, 2004)

Bisimulations Up-to for the Linear Time Branching Time Spectrum. - David de Frutos-Escrig; Carlos Gregorio-Rodríguez (CONCUR, 2005)

Ubiquitous Systems and Petri Nets. - David de Frutos-Escrig; Olga Marroquín Alonso; Fernando Rosa-Velardo (ICCSA (2), 2005)

Mobile Synchronizing Petri Nets: A Choreographic Approach for Coordination in Ubiquitous Systems. - Fernando Rosa-Velardo; Olga Marroquín Alonso; David de Frutos-Escrig (MTCoord@COORDINATION, 2005)

On the Expressiveness of Mobile Synchronizing Petri Nets. - Fernando Rosa-Velardo; David de Frutos-Escrig; Olga Marroquín Alonso (SecCO@CONCUR, 2005)

Symbolic Semantics for the Verification of Security Properties of Mobile Petri Nets. - Fernando Rosa-Velardo; David de Frutos-Escrig (ATVA, 2006)

Replicated Ubiquitous Nets. - Fernando Rosa-Velardo; David de Frutos-Escrig; Olga Marroquín Alonso (ICCSA (4), 2006)

Process Equivalences as Global Bisimulations. - David de Frutos-Escrig; Carlos Gregorio-Rodríguez (J. Univers. Comput. Sci., 2006)

New Bisimulation Semantics for Distributed Systems. - David de Frutos-Escrig; Fernando Rosa-Velardo; Carlos Gregorio-Rodríguez (FORTE, 2007)

Reflection and Preservation of Properties in Coalgebraic (bi)Simulations. - Ignacio Fábregas; Miguel Palomino; David de Frutos-Escrig (ICTAC, 2007)

Simulations Up-to and Canonical Preorders: (Extended Abstract). - David de Frutos-Escrig; Carlos Gregorio-Rodríguez (SOS@LICS/ICALP, 2007)

Constrained Simulations, Nested Simulation Semantics and Counting Bisimulations. - David de Frutos-Escrig; Carlos Gregorio-Rodríguez (PROLE, 2007)

Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations. - David de Frutos-Escrig; Miguel Palomino; Ignacio Fábregas (FORTE, 2008)

Universal Coinductive Characterisations of Process Semantics. - David de Frutos-Escrig; Carlos Gregorio-Rodríguez (IFIP TCS, 2008)

Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences. - David de Frutos-Escrig; Carlos Gregorio-Rodríguez; Miguel Palomino (FICS, 2008)

A congruence relation for sPBC. - Hermenegilda Macià; Valentín Valero Ruiz; Fernando Cuartero; David de Frutos-Escrig (Formal Methods Syst. Des., 2008)

Name Creation vs. Replication in Petri Net Systems. - Fernando Rosa-Velardo; David de Frutos-Escrig (Fundam. Informaticae, 2008)

Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication. - Fernando Rosa-Velardo; David de Frutos-Escrig (Petri Nets, 2009)

Non-strongly Stable Orders Also Define Interesting Simulation Relations. - Ignacio Fábregas; David de Frutos-Escrig; Miguel Palomino (CALCO, 2009)

On the Expressiveness of Refinement Settings. - Harald Fecher; David de Frutos-Escrig; Gerald Lüttgen; Heiko Schmidt (FSEN, 2009)

On the Unification of Process Semantics: Observational Semantics. - David de Frutos-Escrig; Carlos Gregorio-Rodríguez; Miguel Palomino (SOFSEM, 2009)

On the Unification of Process Semantics: Equational Semantics. - David de Frutos-Escrig; Carlos Gregorio-Rodríguez; Miguel Palomino (MFPS, 2009)

(Bi)simulations up-to characterise process semantics. - David de Frutos-Escrig; Carlos Gregorio-Rodríguez (Inf. Comput., 2009)

Ready to preorder: an algebraic and general proof. - David de Frutos-Escrig; Carlos Gregorio-Rodríguez; Miguel Palomino (J. Log. Algebraic Methods Program., 2009)

Forward Analysis for Petri Nets with Name Creation. - Fernando Rosa-Velardo; David de Frutos-Escrig (Petri Nets, 2010)

Logics for Contravariant Simulations. - Ignacio Fábregas; David de Frutos-Escrig; Miguel Palomino (FMOODS/FORTE, 2010)

Equational Characterization of Covariant-Contravariant Simulation and Conformance Simulation Semantics - Ignacio Fábregas; David de Frutos-Escrig; Miguel Palomino (SOS, 2010)

Decision Problems for Petri Nets with Names - Fernando Rosa-Velardo; David de Frutos-Escrig (CoRR, 2010)

Decidability Problems in Petri Nets with Names and Replication. - Fernando Rosa-Velardo; David de Frutos-Escrig (Fundam. Informaticae, 2010)

Relating Modal Refinements, Covariant-Contravariant Simulations and Partial Bisimulations. - Luca Aceto; Ignacio Fábregas; David de Frutos-Escrig; Anna Ingólfsdóttir; Miguel Palomino (FSEN, 2011)

Axiomatizing Weak Ready Simulation Semantics over BCCSP. - Luca Aceto; David de Frutos-Escrig; Carlos Gregorio-Rodríguez; Anna Ingólfsdóttir (ICTAC, 2011)

On the Unification of Process Semantics: Logical Semantics - David Romero-Hernández; David de Frutos-Escrig (SOS, 2011)

Graphical representation of covariant-contravariant modal formulae - Luca Aceto; Ignacio Fábregas; David de Frutos-Escrig; Anna Ingólfsdóttir; Miguel Palomino (EXPRESS, 2011)

Accelerations for the Coverability Set of Petri Nets with Names. - Fernando Rosa-Velardo; María Martos-Salgado; David de Frutos-Escrig (Fundam. Informaticae, 2011)

Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet. - Luca Aceto; David de Frutos-Escrig; Carlos Gregorio-Rodríguez; Anna Ingólfsdóttir (Inf. Process. Lett., 2011)

Decidability and complexity of Petri nets with unordered data. - Fernando Rosa-Velardo; David de Frutos-Escrig (Theor. Comput. Sci., 2011)

Defining Distances for All Process Semantics. - David Romero-Hernández; David de Frutos-Escrig (FMOODS/FORTE, 2012)

The Equational Theory of Weak Complete Simulation Semantics over BCCSP. - Luca Aceto; David de Frutos-Escrig; Carlos Gregorio-Rodríguez; Anna Ingólfsdóttir (SOFSEM, 2012)

Distances between Processes: A Pure Algebraic Approach. - David Romero-Hernández; David de Frutos-Escrig (WADT, 2012)

Unifying the Linear Time-Branching Time Spectrum of Process Semantics - David de Frutos-Escrig; Carlos Gregorio-Rodríguez; Miguel Palomino; David Romero-Hernández (Log. Methods Comput. Sci., 2013)

On the specification of modal systems: A comparison of three frameworks. - Luca Aceto; Ignacio Fábregas; David de Frutos-Escrig; Anna Ingólfsdóttir; Miguel Palomino (Sci. Comput. Program., 2013)

Coinductive Definition of Distances between Processes: Beyond Bisimulation Distances. - David Romero-Hernández; David de Frutos-Escrig (FORTE, 2014)

Axiomatizing weak simulation semantics over BCCSP. - Luca Aceto; David de Frutos-Escrig; Carlos Gregorio-Rodríguez; Anna Ingólfsdóttir (Theor. Comput. Sci., 2014)

Proving Continuity of Coinductive Global Bisimulation Distances: A Never Ending Story. - David Romero-Hernández; David de Frutos-Escrig; Dario Della Monica (PROLE, 2015)

Branching Bisimulation Games. - David de Frutos-Escrig; Jeroen J. A. Keiren; Tim A. C. Willemse (FORTE, 2016)

Evaluation of Temporal Datasets via Interval Temporal Logic Model Checking. - Dario Della Monica; David de Frutos-Escrig; Angelo Montanari; Aniello Murano; Guido Sciavicco (TIME, 2017)

Special issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015). - Luca Aceto; David de Frutos-Escrig (Acta Informatica, 2017)

Trace Simulation Semantics is not Finitely Based over BCCSP. - Luca Aceto; David de Frutos-Escrig; Anna Ingólfsdóttir (Acta Cybern., 2017)

Games for Bisimulations and Abstraction. - David de Frutos-Escrig; Jeroen J. A. Keiren; Tim A. C. Willemse (Log. Methods Comput. Sci., 2017)

An Efficient Characterization of Petri Net Solvable Binary Words. - David de Frutos-Escrig; Maciej Koutny; Lukasz Mikulski (Petri Nets, 2018)

Petri Nets Are (Not Only) Distributed Automata. - David de Frutos-Escrig (Carl Adam Petri: Ideas, Personality, Impact, 2019)

Reversing Steps in Petri Nets. - David de Frutos-Escrig; Maciej Koutny; Lukasz Mikulski (Petri Nets, 2019)

Beyond ω-regular languages: ωT-regular expressions and their automata and logic counterparts. - David Barozzini; David de Frutos-Escrig; Dario Della Monica; Angelo Montanari; Pietro Sala (Theor. Comput. Sci., 2020)

Distributed Population Protocols: Naturally! - David de Frutos-Escrig (PNSE@Petri Nets, 2021)

Investigating Reversibility of Steps in Petri Nets. - David de Frutos-Escrig; Maciej Koutny; Lukasz Mikulski (Fundam. Informaticae, 2021)