| 2012 | ||
|---|---|---|
| 67 | 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 | |
| 2011 | ||
| 66 | 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 | |
| 65 | 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 | |
| 64 | 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 | |
| 63 | David Romero-Hernández, David de Frutos-Escrig: On the Unification of Process Semantics: Logical Semantics SOS 2011: 47-61 | |
| 62 | 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) | |
| 61 | 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) | |
| 60 | Fernando Rosa-Velardo, David de Frutos-Escrig: Decidability and complexity of Petri nets with unordered data. Theor. Comput. Sci. 412(34): 4439-4451 (2011) | |
| 2010 | ||
| 59 | Ignacio Fábregas, David de Frutos-Escrig, Miguel Palomino: Logics for Contravariant Simulations. FMOODS/FORTE 2010: 224-231 | |
| 58 | Fernando Rosa-Velardo, David de Frutos-Escrig: Forward Analysis for Petri Nets with Name Creation. Petri Nets 2010: 185-205 | |
| 57 | Ignacio Fábregas, David de Frutos-Escrig, Miguel Palomino: Equational Characterization of Covariant-Contravariant Simulation and Conformance Simulation Semantics SOS 2010: 1-14 | |
| 56 | Fernando Rosa-Velardo, David de Frutos-Escrig: Decision Problems for Petri Nets with Names CoRR abs/1011.3964: (2010) | |
| 55 | Fernando Rosa-Velardo, David de Frutos-Escrig: Decidability Problems in Petri Nets with Names and Replication. Fundam. Inform. 105(3): 291-317 (2010) | |
| 2009 | ||
| 54 | Ignacio Fábregas, David de Frutos-Escrig, Miguel Palomino: Non-strongly Stable Orders Also Define Interesting Simulation Relations. CALCO 2009: 221-235 | |
| 53 | Harald Fecher, David de Frutos-Escrig, Gerald Lüttgen, Heiko Schmidt: On the Expressiveness of Refinement Settings. FSEN 2009: 276-291 | |
| 52 | 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 | |
| 51 | David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Miguel Palomino: On the Unification of Process Semantics: Observational Semantics. SOFSEM 2009: 279-290 | |
| 50 | 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) | |
| 49 | David de Frutos-Escrig, Carlos Gregorio-Rodríguez: (Bi)simulations up-to characterise process semantics. Inf. Comput. 207(2): 146-170 (2009) | |
| 48 | 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) | |
| 2008 | ||
| 47 | David de Frutos-Escrig, Miguel Palomino, Ignacio Fábregas: Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations. FORTE 2008: 283-298 | |
| 46 | David de Frutos-Escrig, Carlos Gregorio-Rodríguez: Universal Coinductive Characterisations of Process Semantics. IFIP TCS 2008: 397-412 | |
| 45 | 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) | |
| 44 | 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) | |
| 43 | 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) | |
| 42 | Fernando Rosa-Velardo, David de Frutos-Escrig: Name Creation vs. Replication in Petri Net Systems. Fundam. Inform. 88(3): 329-356 (2008) | |
| 2007 | ||
| 41 | David de Frutos-Escrig, Fernando Rosa-Velardo, Carlos Gregorio-Rodríguez: New Bisimulation Semantics for Distributed Systems. FORTE 2007: 143-159 | |
| 40 | Fernando Rosa-Velardo, David de Frutos-Escrig: Name Creation vs. Replication in Petri Net Systems. ICATPN 2007: 402-422 | |
| 39 | Ignacio Fábregas, Miguel Palomino, David de Frutos-Escrig: Reflection and Preservation of Properties in Coalgebraic (bi)Simulations. ICTAC 2007: 231-245 | |
| 38 | 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) | |
| 37 | 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) | |
| 2006 | ||
| 36 | Fernando Rosa-Velardo, David de Frutos-Escrig: Symbolic Semantics for the Verification of Security Properties of Mobile Petri Nets. ATVA 2006: 461-476 | |
| 35 | Fernando Rosa-Velardo, David de Frutos-Escrig, Olga Marroquín Alonso: Replicated Ubiquitous Nets. ICCSA (4) 2006: 158-168 | |
| 34 | 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) | |
| 33 | David de Frutos-Escrig, Carlos Gregorio-Rodríguez: Process Equivalences as Global Bisimulations. J. UCS 12(11): 1521-1550 (2006) | |
| 2005 | ||
| 32 | David de Frutos-Escrig, Carlos Gregorio-Rodríguez: Bisimulations Up-to for the Linear Time Branching Time Spectrum. CONCUR 2005: 278-292 | |
| 31 | David de Frutos-Escrig, Olga Marroquín Alonso, Fernando Rosa-Velardo: Ubiquitous Systems and Petri Nets. ICCSA (2) 2005: 1156-1166 | |
| 30 | 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) | |
| 2004 | ||
| 29 | David de Frutos-Escrig, Manuel Núñez: Formal Techniques for Networked and Distributed Systems - FORTE 2004, 24th IFIP WG 6.1 International Conference, Madrid Spain, September 27-30, 2004, Proceedings Springer 2004 | |
| 28 | David de Frutos-Escrig, Carlos Gregorio-Rodríguez: Preserving Contexts for Soft Conformance Relation. FATES 2004: 33-48 | |
| 2003 | ||
| 27 | David de Frutos-Escrig, Olga Marroquín Alonso: Replicated Ambient Petri Nets. International Conference on Computational Science 2003: 774-783 | |
| 26 | David de Frutos-Escrig, Olga Marroquín Alonso: Ambient Petri nets. Electr. Notes Theor. Comput. Sci. 85(1): 39 (2003) | |
| 2001 | ||
| 25 | Olga Marroquín Alonso, David de Frutos-Escrig: Extending the Petri Box Calculus with Time. ICATPN 2001: 303-322 | |
| 2000 | ||
| 24 | 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 | |
| 23 | David de Frutos-Escrig, Valentín Valero Ruiz, Olga Marroquín Alonso: Decidability of Properties of Timed-Arc Petri Nets. ICATPN 2000: 187-206 | |
| 1999 | ||
| 22 | Luis Fernando Llana Díaz, David de Frutos-Escrig: Relating May and Must Testing Semantics for Discrete Timed Process Algebras. ASIAN 1999: 74-86 | |
| 21 | David de Frutos-Escrig, Natalia López, Manuel Núñez: Global Timed Bisimulation: An Introduction. FORTE 1999: 401-416 | |
| 1998 | ||
| 20 | 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 | ||
| 19 | Fernando Cuartero, David de Frutos-Escrig, Valentín Valero Ruiz: A Sound and Complete Proof System for Probabilistic Processes. ARTS 1997: 340-352 | |
| 18 | Luis Fernando Llana Díaz, David de Frutos-Escrig: Denotational Semantics for Timed Testing. ARTS 1997: 368-382 | |
| 17 | David de Frutos-Escrig, Luis Fernando Llana Díaz, Manuel Núñez: Friendly Testing as a Conformance Relation. FORTE 1997: 283-298 | |
| 1995 | ||
| 16 | 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 | |
| 15 | Manuel Núñez, David de Frutos-Escrig, Luis Fernando Llana Díaz: Acceptance Trees for Probabilistic Processes. CONCUR 1995: 249-263 | |
| 14 | Manuel Núñez, David de Frutos-Escrig: Testing Semantics for Probabilistic LOTOS. FORTE 1995: 367-382 | |
| 13 | David de Frutos-Escrig, Manuel Núñez, Juan Quemada: Characterizing termination in LOTOS via testing. PSTV 1995: 237-250 | |
| 1993 | ||
| 12 | David de Frutos-Escrig: A Characterization of LOTOS Representable Networks of Parallel Processes. AMAST 1993: 281-288 | |
| 11 | Juan Quemada, David de Frutos-Escrig, Arturo Azcorra: TIC: A TImed Calculus. Formal Asp. Comput. 5(3): 224-252 (1993) | |
| 1991 | ||
| 10 | Santiago Pavón, M. Hulström, Juan Quemada, David de Frutos-Escrig, Y. Ortega: Inverse Expansion. FORTE 1991: 297-312 | |
| 9 | 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 | |
| 8 | Yolanda Ortega-Mallén, David de Frutos-Escrig: A Complete Proof System for Timed Observations. TAPSOFT, Vol.1 1991: 412-440 | |
| 7 | 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 | ||
| 6 | Tommaso Bolognesi, David de Frutos-Escrig, Yolanda Ortega-Mallén: Graphical Composition Theorems for Parallel and Hiding Operators. FORTE 1990: 459-470 | |
| 1989 | ||
| 5 | Juan Quemada, Arturo Azcorra, David de Frutos-Escrig: TIC: A Timed Calculus for LOTOS. FORTE 1989: 195-209 | |
| 1987 | ||
| 4 | David de Frutos-Escrig: Probabilistic Ianov's Schemes. Theor. Comput. Sci. 53: 67-97 (1987) | |
| 1986 | ||
| 3 | David de Frutos-Escrig: Probabilistic Ianov's Schemes. CAAP 1986: 142-157 | |
| 2 | David de Frutos-Escrig: Some Probabilistic Powerdomains in the Category SFP. STACS 1986: 49-59 | |
| 1984 | ||
| 1 | David de Frutos-Escrig: A Characterization of Plotkin's Order in Powerdomains, and Some of its Properties. Theor. Comput. Sci. 31: 73-82 (1984) | |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page