| Decidability and complexity of Petri nets with unordered data F Rosa-Velardo, D de Frutos-Escrig Theoretical Computer Science 412 (34), 4439-4451, 2011 | 96 | 2011 |
| Name creation vs. replication in petri net systems F Rosa-Velardo, D de Frutos-Escrig Fundamenta Informaticae 88 (3), 329-356, 2008 | 59 | 2008 |
| Mobile Synchronizing Petri Nets: a choreographic approach for coordination in Ubiquitous Systems F Rosa-Velardo, O Marroquín-Alonso, D de Frutos-Escrig Electronic Notes in Theoretical Computer Science 150 (1), 103-126, 2006 | 33 | 2006 |
| Typed mobile ambients in Maude F Rosa-Velardo, C Segura, A Verdejo Electronic Notes in Theoretical Computer Science 147 (1), 135-161, 2006 | 29 | 2006 |
| On the expressiveness of mobile synchronizing Petri nets F Rosa-Velardo, D de Frutos-Escrig, O Marroquín-Alonso Electronic Notes in Theoretical Computer Science 180 (1), 77-94, 2007 | 27 | 2007 |
| Dynamic soundness in resource-constrained workflow nets M Martos-Salgado, F Rosa-Velardo International Conference on Formal Methods for Open Object-Based Distributed …, 2011 | 22 | 2011 |
| Ordinal recursive complexity of unordered data nets F Rosa-Velardo Information and Computation 254, 41-58, 2017 | 19 | 2017 |
| New bisimulation semantics for distributed systems D de Frutos-Escrig, F Rosa-Velardo, C Gregorio-Rodríguez International Conference on Formal Techniques for Networked and Distributed …, 2007 | 16 | 2007 |
| Coding Mobile Synchronizing Petri Nets into Rewriting Logic F Rosa-Velardo Electronic Notes in Theoretical Computer science 174 (1), 83-98, 2007 | 16 | 2007 |
| On the coverability and reachability languages of monotonic extensions of petri nets G Delzanno, F Rosa-Velardo Theoretical Computer Science 467, 12-29, 2013 | 15 | 2013 |
| Name creation vs. replication in petri net systems F Rosa-Velardo, D de Frutos-Escrig International Conference on Application and Theory of Petri Nets, 402-422, 2007 | 14 | 2007 |
| Ordinal theory for expressiveness of well-structured transition systems R Bonnet, A Finkel, S Haddad, F Rosa-Velardo Information and Computation 224, 1-22, 2013 | 13 | 2013 |
| Decidability problems in Petri nets with names and replication F Rosa-Velardo, D de Frutos-Escrig Fundamenta informaticae 105 (3), 291-317, 2010 | 13 | 2010 |
| Ubiquitous systems and Petri nets D de Frutos Escrig, OM Alonso, FR Velardo International Conference on Computational Science and Its Applications, 1156 …, 2005 | 13* | 2005 |
| Analysis of asynchronous programs with event-based synchronization M Emmi, P Ganty, R Majumdar, F Rosa-Velardo Programming Languages and Systems: 24th European Symposium on Programming …, 2015 | 12 | 2015 |
| Multiset rewriting for the verification of depth-bounded processes with name binding F Rosa-Velardo, M Martos-Salgado Information and Computation 215, 68-87, 2012 | 12 | 2012 |
| Comparing Petri data nets and timed Petri nets R Bonnet, A Finkel, S Haddad, F Rosa-Velardo LSV, ENS Cachan, Research Report LSV-10-23, 2010 | 12 | 2010 |
| Accelerations for the coverability set of Petri nets with names F Rosa-Velardo, M Martos-Salgado, D de Frutos-Escrig Fundamenta Informaticae 113 (3-4), 313-341, 2011 | 10 | 2011 |
| Language-based comparison of Petri nets with black tokens, pure names and ordered data F Rosa-Velardo, G Delzanno Language and Automata Theory and Applications: 4th International Conference …, 2010 | 7 | 2010 |
| Decidability results for restricted models of petri nets with name creation and replication F Rosa-Velardo, D de Frutos-Escrig International Conference on Applications and Theory of Petri Nets, 63-82, 2009 | 7 | 2009 |
