default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFernando Rosa-Velardo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j11]Ismael Rodríguez
, Fernando Rosa-Velardo, Fernando Rubio:
Introducing complexity to formal testing. J. Log. Algebraic Methods Program. 111: 100502 (2020)
2010 – 2019
- 2017
- [j10]Fernando Rosa-Velardo:
Ordinal recursive complexity of Unordered Data Nets. Inf. Comput. 254: 41-58 (2017) - 2015
- [c22]Michael Emmi, Pierre Ganty, Rupak Majumdar, Fernando Rosa-Velardo:
Analysis of Asynchronous Programs with Event-Based Synchronization. ESOP 2015: 535-559 - 2014
- [j9]María Martos-Salgado, Fernando Rosa-Velardo:
Safety and Soundness for Priced Resource-Constrained Workflow Nets. Fundam. Informaticae 131(1): 55-80 (2014) - [c21]María Martos-Salgado, Fernando Rosa-Velardo:
Dynamic Networks of Timed Petri Nets. Petri Nets 2014: 294-313 - [c20]María Martos-Salgado, Fernando Rosa-Velardo:
Expressiveness of Dynamic Networks of Timed Petri Nets. LATA 2014: 516-527 - 2013
- [j8]Fernando Rosa-Velardo:
Petri nets with name creation for transient secure association. Acta Informatica 50(7-8): 403-436 (2013) - [j7]Rémi Bonnet, Alain Finkel, Serge Haddad, Fernando Rosa-Velardo:
Ordinal theory for expressiveness of well-structured transition systems. Inf. Comput. 224: 1-22 (2013) - [j6]Giorgio Delzanno, Fernando Rosa-Velardo:
On the coverability and reachability languages of monotonic extensions of Petri nets. Theor. Comput. Sci. 467: 12-29 (2013) - 2012
- [j5]Fernando Rosa-Velardo, María Martos-Salgado:
Multiset rewriting for the verification of depth-bounded processes with name binding. Inf. Comput. 215: 68-87 (2012) - [c19]María Martos-Salgado, Fernando Rosa-Velardo:
Cost Soundness for Priced Resource-Constrained Workflow Nets. Petri Nets 2012: 108-127 - 2011
- [j4]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) - [j3]Fernando Rosa-Velardo, David de Frutos-Escrig:
Decidability and complexity of Petri nets with unordered data. Theor. Comput. Sci. 412(34): 4439-4451 (2011) - [c18]María Martos-Salgado, Fernando Rosa-Velardo:
Dynamic Soundness in Resource-Constrained Workflow Nets. FMOODS/FORTE 2011: 259-273 - [c17]Rémi Bonnet, Alain Finkel, Serge Haddad, Fernando Rosa-Velardo:
Ordinal Theory for Expressiveness of Well Structured Transition Systems. FoSSaCS 2011: 153-167 - 2010
- [j2]Fernando Rosa-Velardo, David de Frutos-Escrig:
Decidability Problems in Petri Nets with Names and Replication. Fundam. Informaticae 105(3): 291-317 (2010) - [c16]Fernando Rosa-Velardo, David de Frutos-Escrig:
Forward Analysis for Petri Nets with Name Creation. Petri Nets 2010: 185-205 - [c15]Fernando Rosa-Velardo, Giorgio Delzanno:
Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data. LATA 2010: 524-535 - [c14]Fernando Rosa-Velardo:
Depth Boundedness in Multiset Rewriting Systems with Name Binding. RP 2010: 161-175 - [c13]Fernando Rosa-Velardo:
Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding. WRLA 2010: 191-207 - [i1]Fernando Rosa-Velardo, David de Frutos-Escrig:
Decision Problems for Petri Nets with Names. CoRR abs/1011.3964 (2010)
2000 – 2009
- 2009
- [c12]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 - 2008
- [j1]Fernando Rosa-Velardo, David de Frutos-Escrig:
Name Creation vs. Replication in Petri Net Systems. Fundam. Informaticae 88(3): 329-356 (2008) - 2007
- [c11]Fernando Rosa-Velardo, David de Frutos-Escrig:
Name Creation vs. Replication in Petri Net Systems. ICATPN 2007: 402-422 - [c10]David de Frutos-Escrig, Fernando Rosa-Velardo, Carlos Gregorio-Rodríguez:
New Bisimulation Semantics for Distributed Systems. FORTE 2007: 143-159 - [c9]Fernando Rosa-Velardo:
Petri Nets for the Verification of Ubiquitous Systems with Transient Secure Association. UIC 2007: 1148-1158 - 2006
- [c8]Fernando Rosa-Velardo, David de Frutos-Escrig:
Symbolic Semantics for the Verification of Security Properties of Mobile Petri Nets. ATVA 2006: 461-476 - [c7]Fernando Rosa-Velardo, David de Frutos-Escrig, Olga Marroquín Alonso:
Replicated Ubiquitous Nets. ICCSA (4) 2006: 158-168 - [c6]Fernando Rosa-Velardo:
Coding Mobile Synchronizing Petri Nets into Rewriting Logic. RULE@FLoC 2006: 83-98 - 2005
- [c5]David de Frutos-Escrig, Olga Marroquín Alonso, Fernando Rosa-Velardo:
Ubiquitous Systems and Petri Nets. ICCSA (2) 2005: 1156-1166 - [c4]Fernando Rosa-Velardo, David de Frutos-Escrig, Olga Marroquín Alonso:
On the Expressiveness of Mobile Synchronizing Petri Nets. SecCO@CONCUR 2005: 77-94 - [c3]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 - [c2]Fernando Rosa-Velardo, Clara Segura, Alberto Verdejo:
Typed Mobile Ambients in Maude. RULE@RDP 2005: 135-161 - 2004
- [c1]Fernando Rosa-Velardo, Clara Segura, David de Frutos-Escrig:
Tagged Systems: A Framework for the Specification of History-dependent Properties. PROLE 2004: 151-174
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-05-08 21:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
