Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
David de Frutos-Escrig
2010 – today
- 2013
[i2]David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Miguel Palomino, David Romero-Hernández: Unifying the Linear Time-Branching Time Spectrum of Process Semantics. CoRR abs/1304.6574 (2013)- 2012
[c46]David Romero-Hernández, David de Frutos-Escrig: Defining Distances for All Process Semantics. FMOODS/FORTE 2012: 169-185
[c45]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: 141-152
[c44]David Romero-Hernández, David de Frutos-Escrig: Distances between Processes: A Pure Algebraic Approach. WADT 2012: 265-282- 2011
[j21]Fernando Rosa-Velardo, María Martos-Salgado, David de Frutos-Escrig: Accelerations for the Coverability Set of Petri Nets with Names. Fundam. Inform. 113(3-4): 313-341 (2011)
[j20]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): 408-413 (2011)
[j19]Fernando Rosa-Velardo, David de Frutos-Escrig: Decidability and complexity of Petri nets with unordered data. Theor. Comput. Sci. 412(34): 4439-4451 (2011)
[c43]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: 268-283
[c42]Luca Aceto, David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Anna Ingólfsdóttir: Axiomatizing Weak Ready Simulation Semantics over BCCSP. ICTAC 2011: 7-24
[c41]Luca Aceto, Ignacio Fábregas, David de Frutos-Escrig, Anna Ingólfsdóttir, Miguel Palomino: Graphical representation of covariant-contravariant modal formulae. EXPRESS 2011: 1-15
[c40]David Romero-Hernández, David de Frutos-Escrig: On the Unification of Process Semantics: Logical Semantics. SOS 2011: 47-61- 2010
[j18]Fernando Rosa-Velardo, David de Frutos-Escrig: Decidability Problems in Petri Nets with Names and Replication. Fundam. Inform. 105(3): 291-317 (2010)
[c39]Fernando Rosa-Velardo, David de Frutos-Escrig: Forward Analysis for Petri Nets with Name Creation. Petri Nets 2010: 185-205
[c38]Ignacio Fábregas, David de Frutos-Escrig, Miguel Palomino: Logics for Contravariant Simulations. FMOODS/FORTE 2010: 224-231
[c37]Ignacio Fábregas, David de Frutos-Escrig, Miguel Palomino: Equational Characterization of Covariant-Contravariant Simulation and Conformance Simulation Semantics. SOS 2010: 1-14
[i1]Fernando Rosa-Velardo, David de Frutos-Escrig: Decision Problems for Petri Nets with Names. CoRR abs/1011.3964 (2010)
2000 – 2009
- 2009
[j17]David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Miguel Palomino: On the Unification of Process Semantics: Equational Semantics. Electr. Notes Theor. Comput. Sci. 249: 243-267 (2009)
[j16]David de Frutos-Escrig, Carlos Gregorio-Rodríguez: (Bi)simulations up-to characterise process semantics. Inf. Comput. 207(2): 146-170 (2009)
[j15]David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Miguel Palomino: Ready to preorder: an algebraic and general proof. J. Log. Algebr. Program. 78(7): 539-551 (2009)
[c36]Fernando Rosa-Velardo, David de Frutos-Escrig: Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication. Petri Nets 2009: 63-82
[c35]Ignacio Fábregas, David de Frutos-Escrig, Miguel Palomino: Non-strongly Stable Orders Also Define Interesting Simulation Relations. CALCO 2009: 221-235
[c34]Harald Fecher, David de Frutos-Escrig, Gerald Lüttgen, Heiko Schmidt: On the Expressiveness of Refinement Settings. FSEN 2009: 276-291
[c33]David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Miguel Palomino: On the Unification of Process Semantics: Observational Semantics. SOFSEM 2009: 279-290- 2008
[j14]David de Frutos-Escrig, Carlos Gregorio-Rodríguez: Constrained Simulations, Nested Simulation Semantics and Counting Bisimulations. Electr. Notes Theor. Comput. Sci. 206: 41-58 (2008)
[j13]David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Miguel Palomino: Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences. Electr. Notes Theor. Comput. Sci. 212: 149-162 (2008)
[j12]Hermenegilda Macià, Valentín Valero Ruiz, Fernando Cuartero, David de Frutos-Escrig: A congruence relation for sPBC. Formal Methods in System Design 32(2): 85-128 (2008)
[j11]Fernando Rosa-Velardo, David de Frutos-Escrig: Name Creation vs. Replication in Petri Net Systems. Fundam. Inform. 88(3): 329-356 (2008)
[c32]David de Frutos-Escrig, Miguel Palomino, Ignacio Fábregas: Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations. FORTE 2008: 283-298
[c31]David de Frutos-Escrig, Carlos Gregorio-Rodríguez: Universal Coinductive Characterisations of Process Semantics. IFIP TCS 2008: 397-412- 2007
[j10]Fernando Rosa-Velardo, David de Frutos-Escrig, Olga Marroquín Alonso: On the Expressiveness of Mobile Synchronizing Petri Nets. Electr. Notes Theor. Comput. Sci. 180(1): 77-94 (2007)
[j9]David de Frutos-Escrig, Carlos Gregorio-Rodríguez: Simulations Up-to and Canonical Preorders: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 192(1): 13-28 (2007)
[c30]Fernando Rosa-Velardo, David de Frutos-Escrig: Name Creation vs. Replication in Petri Net Systems. ICATPN 2007: 402-422
[c29]David de Frutos-Escrig, Fernando Rosa-Velardo, Carlos Gregorio-Rodríguez: New Bisimulation Semantics for Distributed Systems. FORTE 2007: 143-159
[c28]Ignacio Fábregas, Miguel Palomino, David de Frutos-Escrig: Reflection and Preservation of Properties in Coalgebraic (bi)Simulations. ICTAC 2007: 231-245- 2006
[j8]Fernando Rosa-Velardo, Olga Marroquín Alonso, David de Frutos-Escrig: Mobile Synchronizing Petri Nets: A Choreographic Approach for Coordination in Ubiquitous Systems. Electr. Notes Theor. Comput. Sci. 150(1): 103-126 (2006)
[j7]David de Frutos-Escrig, Carlos Gregorio-Rodríguez: Process Equivalences as Global Bisimulations. J. UCS 12(11): 1521-1550 (2006)
[c27]Fernando Rosa-Velardo, David de Frutos-Escrig: Symbolic Semantics for the Verification of Security Properties of Mobile Petri Nets. ATVA 2006: 461-476
[c26]Fernando Rosa-Velardo, David de Frutos-Escrig, Olga Marroquín Alonso: Replicated Ubiquitous Nets. ICCSA (4) 2006: 158-168- 2005
[j6]Fernando Rosa-Velardo, Clara Segura, David de Frutos-Escrig: Tagged Systems: A Framework for the Specification of History-dependent Properties. Electr. Notes Theor. Comput. Sci. 137(1): 151-174 (2005)
[c25]David de Frutos-Escrig, Carlos Gregorio-Rodríguez: Bisimulations Up-to for the Linear Time Branching Time Spectrum. CONCUR 2005: 278-292
[c24]David de Frutos-Escrig, Olga Marroquín Alonso, Fernando Rosa-Velardo: Ubiquitous Systems and Petri Nets. ICCSA (2) 2005: 1156-1166- 2004
[c23]David de Frutos-Escrig, Carlos Gregorio-Rodríguez: Preserving Contexts for Soft Conformance Relation. FATES 2004: 33-48
[e1]David de Frutos-Escrig, Manuel Núñez (Eds.): Formal Techniques for Networked and Distributed Systems - FORTE 2004, 24th IFIP WG 6.1 International Conference, Madrid Spain, September 27-30, 2004, Proceedings. Lecture Notes in Computer Science 3235, Springer 2004, ISBN 3-540-23252-4- 2003
[j5]David de Frutos-Escrig, Olga Marroquín Alonso: Ambient Petri nets. Electr. Notes Theor. Comput. Sci. 85(1): 39 (2003)
[c22]David de Frutos-Escrig, Olga Marroquín Alonso: Replicated Ambient Petri Nets. International Conference on Computational Science 2003: 774-783- 2001
[c21]Olga Marroquín Alonso, David de Frutos-Escrig: Extending the Petri Box Calculus with Time. ICATPN 2001: 303-322- 2000
[c20]David de Frutos-Escrig, Valentín Valero Ruiz, Olga Marroquín Alonso: Decidability of Properties of Timed-Arc Petri Nets. ICATPN 2000: 187-206
[c19]Roberto Bruni, David de Frutos-Escrig, Narciso Martí-Oliet, Ugo Montanari: Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic. CONCUR 2000: 259-274
1990 – 1999
- 1999
[c18]Luis Fernando Llana Díaz, David de Frutos-Escrig: Relating May and Must Testing Semantics for Discrete Timed Process Algebras. ASIAN 1999: 74-86
[c17]David de Frutos-Escrig, Natalia López, Manuel Núñez: Global Timed Bisimulation: An Introduction. FORTE 1999: 401-416- 1998
[j4]David de Frutos-Escrig, Luis Fernando Llana Díaz, Manuel Núñez: An invitation to friendly testing. J. Comput. Sci. Technol. 13(6): 531-545 (1998)- 1997
[c16]Fernando Cuartero, David de Frutos-Escrig, Valentín Valero Ruiz: A Sound and Complete Proof System for Probabilistic Processes. ARTS 1997: 340-352
[c15]Luis Fernando Llana Díaz, David de Frutos-Escrig: Denotational Semantics for Timed Testing. ARTS 1997: 368-382
[c14]David de Frutos-Escrig, Luis Fernando Llana Díaz, Manuel Núñez: Friendly Testing as a Conformance Relation. FORTE 1997: 283-298- 1995
[c13]Valentín Valero Ruiz, David de Frutos-Escrig, Fernando Cuartero: Timed Processes of Timed Petri Nets. Application and Theory of Petri Nets 1995: 490-509
[c12]Manuel Núñez, David de Frutos-Escrig, Luis Fernando Llana Díaz: Acceptance Trees for Probabilistic Processes. CONCUR 1995: 249-263
[c11]Manuel Núñez, David de Frutos-Escrig: Testing Semantics for Probabilistic LOTOS. FORTE 1995: 367-382
[c10]David de Frutos-Escrig, Manuel Núñez, Juan Quemada: Characterizing termination in LOTOS via testing. PSTV 1995: 237-250- 1993
[j3]Juan Quemada, David de Frutos-Escrig, Arturo Azcorra: TIC: A TImed Calculus. Formal Asp. Comput. 5(3): 224-252 (1993)
[c9]David de Frutos-Escrig: A Characterization of LOTOS Representable Networks of Parallel Processes. AMAST 1993: 281-288- 1991
[c8]Santiago Pavón, M. Hulström, Juan Quemada, David de Frutos-Escrig, Y. Ortega: Inverse Expansion. FORTE 1991: 297-312
[c7]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: 154-163
[c6]Yolanda Ortega-Mallén, David de Frutos-Escrig: A Complete Proof System for Timed Observations. TAPSOFT, Vol.1 1991: 412-440
[c5]David de Frutos-Escrig, María-Inés Fernández-Camacho: On Narrowing Strategies for Partial Non-Strict Functions. TAPSOFT, Vol.2 1991: 416-437- 1990
[c4]Tommaso Bolognesi, David de Frutos-Escrig, Yolanda Ortega-Mallén: Graphical Composition Theorems for Parallel and Hiding Operators. FORTE 1990: 459-470
1980 – 1989
- 1989
[c3]Juan Quemada, Arturo Azcorra, David de Frutos-Escrig: TIC: A Timed Calculus for LOTOS. FORTE 1989: 195-209- 1987
[j2]- 1986
[c2]
[c1]- 1984
[j1]David de Frutos-Escrig: A Characterization of Plotkin's Order in Powerdomains, and Some of its Properties. Theor. Comput. Sci. 31: 73-82 (1984)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-19 19:31 CEST by the dblp team



