David de Frutos-Escrig

97 papers A 1B 13C 14Misc 1Journal 29Unranked 38

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