David de Frutos-Escrig

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 17

Top Topics

Simulation Game

Temporal Epistemic

Top Venues

Theor. Comput. Sci.

Publications

Ignacio Fábregas, Miguel Palomino, David de Frutos-Escrig
Reflection and Preservation of Properties in Coalgebraic (bi)Simulations. CoRR (2024)
Ignacio Fábregas, David de Frutos-Escrig, Miguel Palomino
Non-strongly Stable Orders Also Define Interesting Simulation Relations. CoRR (2024)
Ignacio Fábregas, David de Frutos-Escrig, Miguel Palomino
Logics for Contravariant Simulations. CoRR (2024)
David de Frutos-Escrig, Miguel Palomino, Ignacio Fábregas
Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations. CoRR (2024)
Luca Aceto, Ignacio Fábregas, David de Frutos-Escrig, Anna Ingólfsdóttir, Miguel Palomino
On the specification of modal systems: A comparison of three frameworks. CoRR (2024)
David de Frutos-Escrig, Maciej Koutny, Lukasz Mikulski
Investigating Reversibility of Steps in Petri Nets. CoRR (2021)
David de Frutos-Escrig
Distributed Population Protocols: Naturally! PNSE@Petri Nets (2021)
David de Frutos-Escrig, Maciej Koutny, Lukasz Mikulski
Investigating Reversibility of Steps in Petri Nets. Fundam. Informaticae 183 (1-2) (2021)
David Barozzini, David de Frutos-Escrig, Dario Della Monica, Angelo Montanari, Pietro Sala
-regular expressions and their automata and logic counterparts. Theor. Comput. Sci. 813 (2020)
David de Frutos-Escrig, Maciej Koutny, Lukasz Mikulski
Reversing Steps in Petri Nets. Petri Nets (2019)
David de Frutos-Escrig, Maciej Koutny, Lukasz Mikulski
An Efficient Characterization of Petri Net Solvable Binary Words. Petri Nets (2018)
David de Frutos-Escrig, Jeroen J. A. Keiren, Tim A. C. Willemse
Games for Bisimulations and Abstraction. Log. Methods Comput. Sci. 13 (4) (2017)
Luca Aceto, David de Frutos-Escrig
Special issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015). Acta Informatica 54 (1) (2017)
Luca Aceto, David de Frutos-Escrig, Anna Ingólfsdóttir
Trace Simulation Semantics is not Finitely Based over BCCSP. Acta Cybern. 23 (1) (2017)
Dario Della Monica, David de Frutos-Escrig, Angelo Montanari, Aniello Murano, Guido Sciavicco
Evaluation of Temporal Datasets via Interval Temporal Logic Model Checking. TIME (2017)
David de Frutos-Escrig, Jeroen J. A. Keiren, Tim A. C. Willemse
Branching Bisimulation Games. FORTE (2016)
David de Frutos-Escrig, Jeroen J. A. Keiren, Tim A. C. Willemse
Games for Bisimulations and Abstraction. CoRR (2016)
David Romero-Hernández, David de Frutos-Escrig, Dario Della Monica
Proving Continuity of Coinductive Global Bisimulation Distances: A Never Ending Story. PROLE (2015)
David Romero-Hernández, David de Frutos-Escrig
Coinductive Definition of Distances between Processes: Beyond Bisimulation Distances. FORTE (2014)
Luca Aceto, David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Anna Ingólfsdóttir
Axiomatizing weak simulation semantics over BCCSP. Theor. Comput. Sci. 537 (2014)
Luca Aceto, Ignacio Fábregas, David de Frutos-Escrig, Anna Ingólfsdóttir, Miguel Palomino
On the specification of modal systems: A comparison of three frameworks. Sci. Comput. Program. 78 (12) (2013)
David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Miguel Palomino, David Romero-Hernández
Unifying the Linear Time-Branching Time Spectrum of Process Semantics Log. Methods Comput. Sci. 9 (2) (2013)
David Romero-Hernández, David de Frutos-Escrig
Defining Distances for All Process Semantics. FMOODS/FORTE (2012)
Luca Aceto, David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Anna Ingólfsdóttir
The Equational Theory of Weak Complete Simulation Semantics over BCCSP. SOFSEM (2012)
David Romero-Hernández, David de Frutos-Escrig
Distances between Processes: A Pure Algebraic Approach. WADT (2012)
David Romero-Hernández, David de Frutos-Escrig
On the Unification of Process Semantics: Logical Semantics SOS (2011)
Fernando Rosa-Velardo, David de Frutos-Escrig
Decidability and complexity of Petri nets with unordered data. Theor. Comput. Sci. 412 (34) (2011)
Luca Aceto, Ignacio Fábregas, David de Frutos-Escrig, Anna Ingólfsdóttir, Miguel Palomino
Relating Modal Refinements, Covariant-Contravariant Simulations and Partial Bisimulations. FSEN (2011)
Luca Aceto, David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Anna Ingólfsdóttir
Axiomatizing Weak Ready Simulation Semantics over BCCSP. ICTAC (2011)
Fernando Rosa-Velardo, María Martos-Salgado, David de Frutos-Escrig
Accelerations for the Coverability Set of Petri Nets with Names. Fundam. Informaticae 113 (3-4) (2011)
Luca Aceto, Ignacio Fábregas, David de Frutos-Escrig, Anna Ingólfsdóttir, Miguel Palomino
Graphical representation of covariant-contravariant modal formulae EXPRESS (2011)
Luca Aceto, David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Anna Ingólfsdóttir
Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet. Inf. Process. Lett. 111 (9) (2011)
Fernando Rosa-Velardo, David de Frutos-Escrig
Forward Analysis for Petri Nets with Name Creation. Petri Nets (2010)
Fernando Rosa-Velardo, David de Frutos-Escrig
Decidability Problems in Petri Nets with Names and Replication. Fundam. Informaticae 105 (3) (2010)
Ignacio Fábregas, David de Frutos-Escrig, Miguel Palomino
Logics for Contravariant Simulations. FMOODS/FORTE (2010)
Fernando Rosa-Velardo, David de Frutos-Escrig
Decision Problems for Petri Nets with Names CoRR (2010)
Ignacio Fábregas, David de Frutos-Escrig, Miguel Palomino
Equational Characterization of Covariant-Contravariant Simulation and Conformance Simulation Semantics SOS (2010)
Harald Fecher, David de Frutos-Escrig, Gerald Lüttgen, Heiko Schmidt
On the Expressiveness of Refinement Settings. FSEN (2009)
David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Miguel Palomino
Ready to preorder: an algebraic and general proof. J. Log. Algebraic Methods Program. 78 (7) (2009)
David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Miguel Palomino
On the Unification of Process Semantics: Equational Semantics. MFPS (2009)
David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Miguel Palomino
On the Unification of Process Semantics: Observational Semantics. SOFSEM (2009)
David de Frutos-Escrig, Carlos Gregorio-Rodríguez
(Bi)simulations up-to characterise process semantics. Inf. Comput. 207 (2) (2009)
Fernando Rosa-Velardo, David de Frutos-Escrig
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication. Petri Nets (2009)
Ignacio Fábregas, David de Frutos-Escrig, Miguel Palomino
Non-strongly Stable Orders Also Define Interesting Simulation Relations. CALCO (2009)
David de Frutos-Escrig, Carlos Gregorio-Rodríguez
Universal Coinductive Characterisations of Process Semantics. IFIP TCS (2008)
David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Miguel Palomino
Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences. Electron. Notes Theor. Comput. Sci. 212 (2008)
Fernando Rosa-Velardo, David de Frutos-Escrig
Name Creation vs. Replication in Petri Net Systems. Fundam. Informaticae 88 (3) (2008)
David de Frutos-Escrig, Miguel Palomino, Ignacio Fábregas
Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations. FORTE (2008)
Hermenegilda Macià, Valentín Valero Ruiz, Fernando Cuartero, David de Frutos-Escrig
A congruence relation for sPBC. Formal Methods Syst. Des. 32 (2) (2008)
David de Frutos-Escrig, Carlos Gregorio-Rodríguez
Constrained Simulations, Nested Simulation Semantics and Counting Bisimulations. Electron. Notes Theor. Comput. Sci. 206 (2008)
David de Frutos-Escrig, Carlos Gregorio-Rodríguez
Simulations Up-to and Canonical Preorders: (Extended Abstract). Electron. Notes Theor. Comput. Sci. 192 (1) (2007)
Ignacio Fábregas, Miguel Palomino, David de Frutos-Escrig
Reflection and Preservation of Properties in Coalgebraic (bi)Simulations. ICTAC (2007)
David de Frutos-Escrig, Fernando Rosa-Velardo, Carlos Gregorio-Rodríguez
New Bisimulation Semantics for Distributed Systems. FORTE (2007)
Fernando Rosa-Velardo, David de Frutos-Escrig, Olga Marroquín Alonso
On the Expressiveness of Mobile Synchronizing Petri Nets. Electron. Notes Theor. Comput. Sci. 180 (1) (2007)
Fernando Rosa-Velardo, David de Frutos-Escrig
Name Creation vs. Replication in Petri Net Systems. ICATPN (2007)
David de Frutos-Escrig, Carlos Gregorio-Rodríguez
Process Equivalences as Global Bisimulations. J. Univers. Comput. Sci. 12 (11) (2006)
Fernando Rosa-Velardo, Olga Marroquín Alonso, David de Frutos-Escrig
Mobile Synchronizing Petri Nets: A Choreographic Approach for Coordination in Ubiquitous Systems. Electron. Notes Theor. Comput. Sci. 150 (1) (2006)
Fernando Rosa-Velardo, David de Frutos-Escrig, Olga Marroquín Alonso
Replicated Ubiquitous Nets. ICCSA (4) (2006)
Fernando Rosa-Velardo, David de Frutos-Escrig
Symbolic Semantics for the Verification of Security Properties of Mobile Petri Nets. ATVA (2006)
Fernando Rosa-Velardo, Clara Segura, David de Frutos-Escrig
Tagged Systems: A Framework for the Specification of History-dependent Properties. Electron. Notes Theor. Comput. Sci. 137 (1) (2005)
David de Frutos-Escrig, Carlos Gregorio-Rodríguez
Bisimulations Up-to for the Linear Time Branching Time Spectrum. CONCUR (2005)
David de Frutos-Escrig, Olga Marroquín Alonso, Fernando Rosa-Velardo
Ubiquitous Systems and Petri Nets. ICCSA (2) (2005)
David de Frutos-Escrig, Carlos Gregorio-Rodríguez
Preserving Contexts for Soft Conformance Relation. FATES (2004)
David de Frutos-Escrig, Olga Marroquín Alonso
Ambient Petri nets. Electron. Notes Theor. Comput. Sci. 85 (1) (2003)
David de Frutos-Escrig, Olga Marroquín Alonso
Replicated Ambient Petri Nets. International Conference on Computational Science (2003)
Olga Marroquín Alonso, David de Frutos-Escrig
Extending the Petri Box Calculus with Time. ICATPN (2001)
Hermenegilda Macià, Valentín Valero, David de Frutos-Escrig
sPBC: A Markovian Extension of Finite Petri box calculus. PNPM (2001)
Roberto Bruni, David de Frutos-Escrig, Narciso Martí-Oliet, Ugo Montanari
Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic. CONCUR (2000)
David de Frutos-Escrig, Valentín Valero Ruiz, Olga Marroquín Alonso
Decidability of Properties of Timed-Arc Petri Nets. ICATPN (2000)
David de Frutos-Escrig, Natalia López, Manuel Núñez
Global Timed Bisimulation: An Introduction. FORTE (1999)
Luis Fernando Llana Díaz, David de Frutos-Escrig
Relating May and Must Testing Semantics for Discrete Timed Process Algebras. ASIAN (1999)
Valentín Valero Ruiz, David de Frutos-Escrig, Fernando Cuartero Gómez
On non-decidability of reachability for timed-arc Petri nets. PNPM (1999)
David de Frutos-Escrig, Luis Fernando Llana Díaz, Manuel Núñez
An invitation to friendly testing. J. Comput. Sci. Technol. 13 (6) (1998)
David de Frutos-Escrig, Luis Fernando Llana Díaz, Manuel Núñez
Friendly Testing as a Conformance Relation. FORTE (1997)
Fernando Cuartero, David de Frutos-Escrig, Valentín Valero Ruiz
A Sound and Complete Proof System for Probabilistic Processes. ARTS (1997)
Luis Fernando Llana Díaz, David de Frutos-Escrig
Denotational Semantics for Timed Testing. ARTS (1997)
Manuel Núñez, David de Frutos-Escrig
Testing Semantics for Probabilistic LOTOS. FORTE (1995)
Valentín Valero Ruiz, David de Frutos-Escrig, Fernando Cuartero
Timed Processes of Timed Petri Nets. Application and Theory of Petri Nets (1995)
Manuel Núñez, David de Frutos-Escrig, Luis Fernando Llana Díaz
Acceptance Trees for Probabilistic Processes. CONCUR (1995)
David de Frutos-Escrig, Manuel Núñez, Juan Quemada
Characterizing termination in LOTOS via testing. PSTV (1995)
Juan Quemada, David de Frutos-Escrig, Arturo Azcorra
TIC: A TImed Calculus. Formal Aspects Comput. 5 (3) (1993)
Valentín Valero Ruiz, David de Frutos-Escrig, Fernando Cuartero Gómez
Decidability of the strict reachability problem for TPN's with rational and real durations. PNPM (1993)
David de Frutos-Escrig
A Characterization of LOTOS Representable Networks of Parallel Processes. AMAST (1993)
Valentín Valero Ruiz, David de Frutos-Escrig, Fernando Cuartero
Simulation of Timed Petri Nets by Ordinary Petri Nets and Applications to Decidability of the Timed Reachability Problem and other Related Problems. PNPM (1991)
Santiago Pavón, M. Hulström, Juan Quemada, David de Frutos-Escrig, Y. Ortega
Inverse Expansion. FORTE (1991)
Yolanda Ortega-Mallén, David de Frutos-Escrig
A Complete Proof System for Timed Observations. TAPSOFT, Vol.1 (1991)
David de Frutos-Escrig, María-Inés Fernández-Camacho
On Narrowing Strategies for Partial Non-Strict Functions. TAPSOFT, Vol.2 (1991)
Tommaso Bolognesi, David de Frutos-Escrig, Yolanda Ortega-Mallén
Graphical Composition Theorems for Parallel and Hiding Operators. FORTE (1990)
Yolanda Ortega-Mallén, David de Frutos-Escrig
Timed Observations: A Semantic Model for Real-Time Concurrency. Programming Concepts and Methods (1990)
Juan Quemada, Arturo Azcorra, David de Frutos-Escrig
TIC: A Timed Calculus for LOTOS. FORTE (1989)
David de Frutos-Escrig
Probabilistic Ianov's Schemes. Theor. Comput. Sci. 53 (1987)
David de Frutos-Escrig
Probabilistic Ianov's Schemes. CAAP (1986)
David de Frutos-Escrig
Some Probabilistic Powerdomains in the Category SFP. STACS (1986)
David de Frutos-Escrig
A Characterization of Plotkin's Order in Powerdomains, and Some of its Properties. Theor. Comput. Sci. 31 (1984)