Fernando Rosa-Velardo

According to our database1, Fernando Rosa-Velardo
  • authored at least 33 papers between 2005 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Ordinal recursive complexity of Unordered Data Nets.
Inf. Comput., 2017

2015
Analysis of Asynchronous Programs with Event-Based Synchronization.
Proceedings of the Programming Languages and Systems, 2015

2014
Safety and Soundness for Priced Resource-Constrained Workflow Nets.
Fundam. Inform., 2014

Expressiveness of Dynamic Networks of Timed Petri Nets.
Proceedings of the Language and Automata Theory and Applications, 2014

Dynamic Networks of Timed Petri Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2014

2013
On the coverability and reachability languages of monotonic extensions of Petri nets.
Theor. Comput. Sci., 2013

Ordinal theory for expressiveness of well-structured transition systems.
Inf. Comput., 2013

Petri nets with name creation for transient secure association.
Acta Inf., 2013

2012
Multiset rewriting for the verification of depth-bounded processes with name binding.
Inf. Comput., 2012

Cost Soundness for Priced Resource-Constrained Workflow Nets.
Proceedings of the Application and Theory of Petri Nets - 33rd International Conference, 2012

2011
Decidability and complexity of Petri nets with unordered data.
Theor. Comput. Sci., 2011

Accelerations for the Coverability Set of Petri Nets with Names.
Fundam. Inform., 2011

Ordinal Theory for Expressiveness of Well Structured Transition Systems.
Proceedings of the Foundations of Software Science and Computational Structures, 2011

Dynamic Soundness in Resource-Constrained Workflow Nets.
Proceedings of the Formal Techniques for Distributed Systems, 2011

2010
Decidability Problems in Petri Nets with Names and Replication.
Fundam. Inform., 2010

Decision Problems for Petri Nets with Names
CoRR, 2010

Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding.
Proceedings of the Rewriting Logic and Its Applications - 8th International Workshop, 2010

Depth Boundedness in Multiset Rewriting Systems with Name Binding.
Proceedings of the Reachability Problems, 4th International Workshop, 2010

Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data.
Proceedings of the Language and Automata Theory and Applications, 2010

Forward Analysis for Petri Nets with Name Creation.
Proceedings of the Applications and Theory of Petri Nets, 2010

2009
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication.
Proceedings of the Applications and Theory of Petri Nets, 2009

2008
Name Creation vs. Replication in Petri Net Systems.
Fundam. Inform., 2008

2007
On the Expressiveness of Mobile Synchronizing Petri Nets.
Electr. Notes Theor. Comput. Sci., 2007

Coding Mobile Synchronizing Petri Nets into Rewriting Logic.
Electr. Notes Theor. Comput. Sci., 2007

Petri Nets for the Verification of Ubiquitous Systems with Transient Secure Association.
Proceedings of the Ubiquitous Intelligence and Computing, 4th International Conference, 2007

New Bisimulation Semantics for Distributed Systems.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2007

Name Creation vs. Replication in Petri Net Systems.
Proceedings of the Petri Nets and Other Models of Concurrency, 2007

2006
Typed Mobile Ambients in Maude.
Electr. Notes Theor. Comput. Sci., 2006

Mobile Synchronizing Petri Nets: A Choreographic Approach for Coordination in Ubiquitous Systems.
Electr. Notes Theor. Comput. Sci., 2006

Replicated Ubiquitous Nets.
Proceedings of the Computational Science and Its Applications, 2006

Symbolic Semantics for the Verification of Security Properties of Mobile Petri Nets.
Proceedings of the Automated Technology for Verification and Analysis, 2006

2005
Tagged Systems: A Framework for the Specification of History-dependent Properties.
Electr. Notes Theor. Comput. Sci., 2005

Ubiquitous Systems and Petri Nets.
Proceedings of the Computational Science and Its Applications, 2005


  Loading...