Publicaciones (35) Publicaciones de FERNANDO ROSA VELARDO

2020

  1. Introducing complexity to formal testing

    Journal of Logical and Algebraic Methods in Programming, Vol. 111

2017

  1. Ordinal recursive complexity of Unordered Data Nets

    Information and Computation, Vol. 254, pp. 41-58

2015

  1. Analysis of asynchronous programs with event-based synchronization

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9032, pp. 535-559

2014

  1. Dynamic networks of timed Petri nets

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. Expressiveness of dynamic networks of timed Petri nets

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  3. Safety and soundness for priced resource-constrained workflow nets

    Fundamenta Informaticae, Vol. 131, Núm. 1, pp. 55-80

2013

  1. On the coverability and reachability languages of monotonic extensions of Petri nets

    Theoretical Computer Science, Vol. 467, pp. 12-29

  2. On the decidability of model checking LTL fragments in monotonic extensions of Petri nets

    Electronic Communications of the EASST

  3. Ordinal theory for expressiveness of well-structured transition systems

    Information and Computation, Vol. 224, pp. 1-22

  4. Petri nets with name creation for transient secure association

    Acta Informatica, Vol. 50, Núm. 7-8, pp. 403-436

2012

  1. Cost soundness for priced resource-constrained workflow nets

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. Multiset rewriting for the verification of depth-bounded processes with name binding

    Information and Computation, Vol. 215, pp. 68-87

2011

  1. Accelerations for the coverability set of Petri nets with names

    Fundamenta Informaticae

  2. Decidability and complexity of Petri nets with unordered data

    Theoretical Computer Science, Vol. 412, Núm. 34, pp. 4439-4451

  3. Dynamic soundness in resource-constrained workflow nets

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  4. Ordinal theory for expressiveness of well structured transition systems

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2010

  1. Decidability problems in Petri nets with names and replication

    Fundamenta Informaticae

  2. Depth boundedness in multiset rewriting systems with name binding

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  3. Forward analysis for petri nets with name creation

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  4. Language-based comparison of Petri nets with black tokens, pure names and ordered data

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)