Recent Submissions

  • Icon

    Optimization of high-throughput real-time processes in physics reconstruction  [PhD Thesis]

    Cámpora Pérez, Daniel Hugo (2019-11-29)
    La presente tesis se ha desarrollado en colaboración entre la Universidad de Sevilla y la Organización Europea para la Investigación Nuclear, CERN. El detector LHCb es uno de los cuatro grandes detectores situados en ...
  • Icon

    Seventeenth Brainstorming Week on Membrane Computing Sevilla, February 5 - 8, 2019 : RGNC REPORT 1/2019  [Book]

    Orellana Martín, David; Paun, Gheorghe; Riscos Núñez, Agustín; Andreu Guzmán, José A. (Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
  • Icon

    New applications for an old tool  [Presentation]

    Valencia Cabrera, Luis; Orellana Martín, David; Pérez Hurtado, Ignacio; Pérez Jiménez, Mario de Jesús (Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
    First, the dependency graph technique, not so far from its current application, was developed trying to nd the shortest computations for membrane systems solving instances of SAT. Certain families of membrane systems ...
  • Icon

    A syntax for semantics in P-Lingua  [Presentation]

    Pérez Hurtado, Ignacio; Orellana Martín, David; Riscos Núñez, Agustín; Pérez Jiménez, Mario de Jesús (Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
    P-Lingua is a software framework for Membrane Computing, it includes a programming language, also called P-Lingua, for writting P system de nitions using a syntax close to standard scienti c notation. The rst line of a ...
  • Icon

    An apparently innocent problem in Membrane Computing  [Presentation]

    Orellana Martín, David; Valencia Cabrera, Luis; Riscos Núñez, Agustín; Pérez Jiménez, Mario de Jesús (Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
    The search for effcient solutions of computationally hard problems by means of families of membrane systems has lead to a wide and prosperous eld of research. The study of computational complexity theory in Membrane ...
  • Icon

    A new perspective on computational complexity theory in Membrane Computing  [Presentation]

    Orellana Martín, David; Valencia Cabrera, Luis; Riscos Núñez, Agustín; Pérez Jiménez, Mario de Jesús (Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
    A single Turing machine can solve decision problems with an in nite number of instances. On the other hand, in the framework of membrane computing, a \solution" to an abstract decision problem consists of a family of ...
  • Icon

    P Systems: from Anti-Matter to Anti-Rules  [Presentation]

    Alhazov, Artiom; Freund, Rudolf; Ivanov, Sergiu; Pérez Jiménez, Mario de Jesús (Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
    The concept of a matter object being annihilated when meeting its corresponding anti-matter object is taken over for rule labels as objects and anti-rule labels as the corresponding annihilation counterpart in P systems. ...
  • Icon

    Decision-Theoretic Planning with Person Trajectory Prediction for Social Navigation  [Presentation]

    Pérez Hurtado de Mendoza, Ignacio; Capitán, Jesús; Caballero, Fernando; Merino, Luis (Springer, 2015)
    Robots navigating in a social way should reason about people intentions when acting. For instance, in applications like robot guidance or meeting with a person, the robot has to consider the goals of the people. Intentions ...
  • Icon

    An extension of GHMMs for environments with occlusions and automatic goal discovery for person trajectory prediction  [Presentation]

    Pérez Hurtado de Mendoza, Ignacio; Capitán, Jesús; Caballero, Fernando; Merino, Luis (IEEE Computer Society, 2015)
    Robots navigating in a social way should use some knowledge about common motion patterns of people in the environment. Moreover, it is known that people move intending to reach certain points of interest, and machine ...
  • Icon

    A formalization of membrane systems with dynamically evolving structures  [Article]

    Freund, Rudolf; Pérez Hurtado de Mendoza, Ignacio; Riscos Núñez, Agustín; Verlan, Sergey (Taylor and Francis, 2013)
    This article introduces a general formalism/framework flexible enough to cover descriptions of different variants of P systems having a dynamic membrane structure. Our framework can be useful for the precise definition ...
  • Icon

    Secure Communication of Local States in Interpreted Systems  [Presentation]

    Albert, Michael; Cordón Franco, Andrés; Ditmarsch, Hans P. van; Fernández Duque, David; Joosten, Joost J.; Soler Toscano, Fernando (Springer, 2011)
    Given an interpreted system, we investigate ways for two agents to communicate secrets by public announcements. For card deals, the problem to keep all of your cards a secret (i) can be distinguished from the problem to ...
  • Icon

    A Note on Complexity Measures for Probabilistic P Systems  [Article]

    Cordón Franco, Andrés; Sancho Caparrini, Fernando (J.UCS.org, 2004)
    In this paper we present a first approach to the definition of different entropy measures for probabilistic P systems in order to obtain some quantitative parameters showing how complex the evolution of a P system is. ...
  • Icon

    A geometric protocol for cryptography with cards  [Article]

    Cordón Franco, Andrés; Ditmarsch, Hans P. van; Fernández Duque, David; Soler Toscano, Fernando (Springer, 2015)
    In the generalized Russian cards problem, the three players Alice, Bob and Cath draw a, b and c cards, respectively, from a deck of a + b + c cards. Players only know their own cards and what the deck of cards is. Alice ...
  • Icon

    Semantics for incident identification and resolution reports  [Article]

    Borrego Díaz, Joaquín; Chávez González, Antonia María; Pro Martín, José Luis; Matos Arana, Virginia (Oxford Academic, 2016)
    In order to achieve a safe and systematic treatment of security protocols, organizations release a number of technical briefings describing how to detect and manage security incidents. A critical issue is that this document ...
  • Icon

    Some Results on LΔ n+1  [Article]

    Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (Wiley, 2001)
    We study the quantifier complexity and the relative strength of some fragments of arithmetic axiomatized by induction and minimization schemes for Δn+1 formulas.
  • Icon

    Provably Total Primitive Recursive Functions: Theories with Induction  [Presentation]

    Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (Springer, 2004)
    A natural example of a function algebra is R (T), the class of provably total computable functions (p.t.c.f.) of a theory T in the language of first order Arithmetic. In this paper a simple characterization of that kind ...
  • Icon

    Predicativity through Transfinite Reflection  [Article]

    Cordón Franco, Andrés; Fernández Duque, David; Joosten, Joost J.; Lara Martín, Francisco Félix (The Association for Symbolic Logic, 2017)
    Let T be a second-order arithmetical theory, Λ a well-order, λ < Λ and X ⊆ ℕ. We use as a formalization of “φ is provable from T and an oracle for the set X, using ω-rules of nesting depth at most λ”. For a set of ...
  • Icon

    On the quantifier complexity of Δ n+1 (T)– induction  [Article]

    Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (Springer, 2004)
    In this paper we continue the study of the theories IΔ n+1 (T), initiated in [7]. We focus on the quantifier complexity of these fragments and theirs (non)finite axiomatization. A characterization is obtained for the class ...
  • Icon

    On Rules and Parameter Free Systems in Bounded Arithmetic  [Presentation]

    Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (Springer, 2007)
    We present model–theoretic techniques to obtain conservation results for first order bounded arithmetic theories, based on a hierarchical version of the well known notion of an existentially closed model.
  • Icon

    On axiom schemes for T-provably Δ1 formulas  [Article]

    Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (Springer, 2014)
    This paper investigates the status of the fragments of Peano Arithmetic obtained by restricting induction, collection and least number axiom schemes to formulas which are Δ1 provably in an arithmetic theory T. In ...

View more