default search action
David de Frutos-Escrig
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i8]Ignacio Fábregas, Miguel Palomino, David de Frutos-Escrig:
Reflection and Preservation of Properties in Coalgebraic (bi)Simulations. CoRR abs/2402.00958 (2024) - [i7]David de Frutos-Escrig, Miguel Palomino, Ignacio Fábregas:
Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations. CoRR abs/2402.00962 (2024) - [i6]Ignacio Fábregas, David de Frutos-Escrig, Miguel Palomino:
Non-strongly Stable Orders Also Define Interesting Simulation Relations. CoRR abs/2402.00963 (2024) - [i5]Ignacio Fábregas, David de Frutos-Escrig, Miguel Palomino:
Logics for Contravariant Simulations. CoRR abs/2402.00964 (2024) - [i4]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 abs/2402.00966 (2024) - 2021
- [j21]David de Frutos-Escrig, Maciej Koutny, Lukasz Mikulski:
Investigating Reversibility of Steps in Petri Nets. Fundam. Informaticae 183(1-2): 67-96 (2021) - [c65]David de Frutos-Escrig:
Distributed Population Protocols: Naturally! PNSE@Petri Nets 2021: 213-232 - [i3]David de Frutos-Escrig, Maciej Koutny, Lukasz Mikulski:
Investigating Reversibility of Steps in Petri Nets. CoRR abs/2110.10535 (2021) - 2020
- [j20]David Barozzini, David de Frutos-Escrig, Dario Della Monica, Angelo Montanari, Pietro Sala:
Beyond ω-regular languages: ωT-regular expressions and their automata and logic counterparts. Theor. Comput. Sci. 813: 270-304 (2020)
2010 – 2019
- 2019
- [c64]David de Frutos-Escrig, Maciej Koutny, Lukasz Mikulski:
Reversing Steps in Petri Nets. Petri Nets 2019: 171-191 - [p1]David de Frutos-Escrig:
Petri Nets Are (Not Only) Distributed Automata. Carl Adam Petri: Ideas, Personality, Impact 2019: 67-72 - 2018
- [c63]David de Frutos-Escrig, Maciej Koutny, Lukasz Mikulski:
An Efficient Characterization of Petri Net Solvable Binary Words. Petri Nets 2018: 207-226 - 2017
- [j19]Luca Aceto, David de Frutos-Escrig:
Special issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015). Acta Informatica 54(1): 1-2 (2017) - [j18]Luca Aceto, David de Frutos-Escrig, Anna Ingólfsdóttir:
Trace Simulation Semantics is not Finitely Based over BCCSP. Acta Cybern. 23(1): 81-90 (2017) - [j17]David de Frutos-Escrig, Jeroen J. A. Keiren, Tim A. C. Willemse:
Games for Bisimulations and Abstraction. Log. Methods Comput. Sci. 13(4) (2017) - [c62]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: 11:1-11:18 - 2016
- [c61]David de Frutos-Escrig, Jeroen J. A. Keiren, Tim A. C. Willemse:
Branching Bisimulation Games. FORTE 2016: 142-157 - [i2]David de Frutos-Escrig, Jeroen J. A. Keiren, Tim A. C. Willemse:
Games for Bisimulations and Abstraction. CoRR abs/1611.00401 (2016) - 2015
- [c60]David Romero-Hernández, David de Frutos-Escrig, Dario Della Monica:
Proving Continuity of Coinductive Global Bisimulation Distances: A Never Ending Story. PROLE 2015: 48-63 - [e2]Luca Aceto, David de Frutos-Escrig:
26th International Conference on Concurrency Theory, CONCUR 2015, Madrid, Spain, September 1.4, 2015. LIPIcs 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-91-0 [contents] - 2014
- [j16]Luca Aceto, David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Anna Ingólfsdóttir:
Axiomatizing weak simulation semantics over BCCSP. Theor. Comput. Sci. 537: 42-71 (2014) - [c59]David Romero-Hernández, David de Frutos-Escrig:
Coinductive Definition of Distances between Processes: Beyond Bisimulation Distances. FORTE 2014: 249-265 - 2013
- [j15]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) - [j14]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): 2468-2487 (2013) - 2012
- [c58]David Romero-Hernández, David de Frutos-Escrig:
Defining Distances for All Process Semantics. FMOODS/FORTE 2012: 169-185 - [c57]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 - [c56]David Romero-Hernández, David de Frutos-Escrig:
Distances between Processes: A Pure Algebraic Approach. WADT 2012: 265-282 - 2011
- [j13]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): 313-341 (2011) - [j12]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) - [j11]Fernando Rosa-Velardo, David de Frutos-Escrig:
Decidability and complexity of Petri nets with unordered data. Theor. Comput. Sci. 412(34): 4439-4451 (2011) - [c55]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 - [c54]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 - [c53]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 - [c52]David Romero-Hernández, David de Frutos-Escrig:
On the Unification of Process Semantics: Logical Semantics. SOS 2011: 47-61 - 2010
- [j10]Fernando Rosa-Velardo, David de Frutos-Escrig:
Decidability Problems in Petri Nets with Names and Replication. Fundam. Informaticae 105(3): 291-317 (2010) - [c51]Fernando Rosa-Velardo, David de Frutos-Escrig:
Forward Analysis for Petri Nets with Name Creation. Petri Nets 2010: 185-205 - [c50]Ignacio Fábregas, David de Frutos-Escrig, Miguel Palomino:
Logics for Contravariant Simulations. FMOODS/FORTE 2010: 224-231 - [c49]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
- [j9]David de Frutos-Escrig, Carlos Gregorio-Rodríguez:
(Bi)simulations up-to characterise process semantics. Inf. Comput. 207(2): 146-170 (2009) - [j8]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): 539-551 (2009) - [c48]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 - [c47]Ignacio Fábregas, David de Frutos-Escrig, Miguel Palomino:
Non-strongly Stable Orders Also Define Interesting Simulation Relations. CALCO 2009: 221-235 - [c46]Harald Fecher, David de Frutos-Escrig, Gerald Lüttgen, Heiko Schmidt:
On the Expressiveness of Refinement Settings. FSEN 2009: 276-291 - [c45]David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Miguel Palomino:
On the Unification of Process Semantics: Observational Semantics. SOFSEM 2009: 279-290 - [c44]David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Miguel Palomino:
On the Unification of Process Semantics: Equational Semantics. MFPS 2009: 243-267 - 2008
- [j7]Hermenegilda Macià, Valentín Valero Ruiz, Fernando Cuartero, David de Frutos-Escrig:
A congruence relation for sPBC. Formal Methods Syst. Des. 32(2): 85-128 (2008) - [j6]Fernando Rosa-Velardo, David de Frutos-Escrig:
Name Creation vs. Replication in Petri Net Systems. Fundam. Informaticae 88(3): 329-356 (2008) - [c43]David de Frutos-Escrig, Miguel Palomino, Ignacio Fábregas:
Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations. FORTE 2008: 283-298 - [c42]David de Frutos-Escrig, Carlos Gregorio-Rodríguez:
Universal Coinductive Characterisations of Process Semantics. IFIP TCS 2008: 397-412 - [c41]David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Miguel Palomino:
Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences. FICS 2008: 149-162 - 2007
- [c40]Fernando Rosa-Velardo, David de Frutos-Escrig:
Name Creation vs. Replication in Petri Net Systems. ICATPN 2007: 402-422 - [c39]David de Frutos-Escrig, Fernando Rosa-Velardo, Carlos Gregorio-Rodríguez:
New Bisimulation Semantics for Distributed Systems. FORTE 2007: 143-159 - [c38]Ignacio Fábregas, Miguel Palomino, David de Frutos-Escrig:
Reflection and Preservation of Properties in Coalgebraic (bi)Simulations. ICTAC 2007: 231-245 - [c37]David de Frutos-Escrig, Carlos Gregorio-Rodríguez:
Simulations Up-to and Canonical Preorders: (Extended Abstract). SOS@LICS/ICALP 2007: 13-28 - [c36]David de Frutos-Escrig, Carlos Gregorio-Rodríguez:
Constrained Simulations, Nested Simulation Semantics and Counting Bisimulations. PROLE 2007: 41-58 - 2006
- [j5]David de Frutos-Escrig, Carlos Gregorio-Rodríguez:
Process Equivalences as Global Bisimulations. J. Univers. Comput. Sci. 12(11): 1521-1550 (2006) - [c35]Fernando Rosa-Velardo, David de Frutos-Escrig:
Symbolic Semantics for the Verification of Security Properties of Mobile Petri Nets. ATVA 2006: 461-476 - [c34]Fernando Rosa-Velardo, David de Frutos-Escrig, Olga Marroquín Alonso:
Replicated Ubiquitous Nets. ICCSA (4) 2006: 158-168 - 2005
- [c33]David de Frutos-Escrig, Carlos Gregorio-Rodríguez:
Bisimulations Up-to for the Linear Time Branching Time Spectrum. CONCUR 2005: 278-292 - [c32]David de Frutos-Escrig, Olga Marroquín Alonso, Fernando Rosa-Velardo:
Ubiquitous Systems and Petri Nets. ICCSA (2) 2005: 1156-1166 - [c31]Fernando Rosa-Velardo, David de Frutos-Escrig, Olga Marroquín Alonso:
On the Expressiveness of Mobile Synchronizing Petri Nets. SecCO@CONCUR 2005: 77-94 - [c30]Fernando Rosa-Velardo, Olga Marroquín Alonso, David de Frutos-Escrig:
Mobile Synchronizing Petri Nets: A Choreographic Approach for Coordination in Ubiquitous Systems. MTCoord@COORDINATION 2005: 103-126 - 2004
- [c29]David de Frutos-Escrig, Carlos Gregorio-Rodríguez:
Preserving Contexts for Soft Conformance Relation. FATES 2004: 33-48 - [c28]Fernando Rosa-Velardo, Clara Segura, David de Frutos-Escrig:
Tagged Systems: A Framework for the Specification of History-dependent Properties. PROLE 2004: 151-174 - [e1]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. Lecture Notes in Computer Science 3235, Springer 2004, ISBN 3-540-23252-4 [contents] - 2003
- [c27]David de Frutos-Escrig, Olga Marroquín Alonso:
Replicated Ambient Petri Nets. International Conference on Computational Science 2003: 774-783 - [c26]David de Frutos-Escrig, Olga Marroquín Alonso:
Ambient Petri nets. FGC 2003: 39 - 2001
- [c25]Olga Marroquín Alonso, David de Frutos-Escrig:
Extending the Petri Box Calculus with Time. ICATPN 2001: 303-322 - [c24]Hermenegilda Macià, Valentín Valero, David de Frutos-Escrig:
sPBC: A Markovian Extension of Finite Petri box calculus. PNPM 2001: 207-216 - 2000
- [c23]David de Frutos-Escrig, Valentín Valero Ruiz, Olga Marroquín Alonso:
Decidability of Properties of Timed-Arc Petri Nets. ICATPN 2000: 187-206 - [c22]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
- [c21]Luis Fernando Llana Díaz, David de Frutos-Escrig:
Relating May and Must Testing Semantics for Discrete Timed Process Algebras. ASIAN 1999: 74-86 - [c20]David de Frutos-Escrig, Natalia López, Manuel Núñez:
Global Timed Bisimulation: An Introduction. FORTE 1999: 401-416 - [c19]Valentín Valero Ruiz, David de Frutos-Escrig, Fernando Cuartero Gómez:
On non-decidability of reachability for timed-arc Petri nets. PNPM 1999: 188-196 - 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
- [c18]Fernando Cuartero, David de Frutos-Escrig, Valentín Valero Ruiz:
A Sound and Complete Proof System for Probabilistic Processes. ARTS 1997: 340-352 - [c17]Luis Fernando Llana Díaz, David de Frutos-Escrig:
Denotational Semantics for Timed Testing. ARTS 1997: 368-382 - [c16]David de Frutos-Escrig, Luis Fernando Llana Díaz, Manuel Núñez:
Friendly Testing as a Conformance Relation. FORTE 1997: 283-298 - 1995
- [c15]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 - [c14]Manuel Núñez, David de Frutos-Escrig, Luis Fernando Llana Díaz:
Acceptance Trees for Probabilistic Processes. CONCUR 1995: 249-263 - [c13]Manuel Núñez, David de Frutos-Escrig:
Testing Semantics for Probabilistic LOTOS. FORTE 1995: 367-382 - [c12]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 Aspects Comput. 5(3): 224-252 (1993) - [c11]David de Frutos-Escrig:
A Characterization of LOTOS Representable Networks of Parallel Processes. AMAST 1993: 281-288 - [c10]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: 56-65 - 1991
- [c9]Santiago Pavón, M. Hulström, Juan Quemada, David de Frutos-Escrig, Y. Ortega:
Inverse Expansion. FORTE 1991: 297-312 - [c8]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 - [c7]Yolanda Ortega-Mallén, David de Frutos-Escrig:
A Complete Proof System for Timed Observations. TAPSOFT, Vol.1 1991: 412-440 - [c6]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
- [c5]Tommaso Bolognesi, David de Frutos-Escrig, Yolanda Ortega-Mallén:
Graphical Composition Theorems for Parallel and Hiding Operators. FORTE 1990: 459-470 - [c4]Yolanda Ortega-Mallén, David de Frutos-Escrig:
Timed Observations: A Semantic Model for Real-Time Concurrency. Programming Concepts and Methods 1990: 125-154
1980 – 1989
- 1989
- [c3]Juan Quemada, Arturo Azcorra, David de Frutos-Escrig:
TIC: A Timed Calculus for LOTOS. FORTE 1989: 195-209 - 1987
- [j2]David de Frutos-Escrig:
Probabilistic Ianov's Schemes. Theor. Comput. Sci. 53: 67-97 (1987) - 1986
- [c2]David de Frutos-Escrig:
Probabilistic Ianov's Schemes. CAAP 1986: 142-157 - [c1]David de Frutos-Escrig:
Some Probabilistic Powerdomains in the Category SFP. STACS 1986: 49-59 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-28 02:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint