Transition Systems and Parallel Programming

URI permanente para esta colección:

Artículos en la categoría Transition Systems and Parallel Programming publicados en las Actas de las XVIII Jornadas de Programación y Lenguajes (PROLE 2018).
Notificar un error en esta colección


Envíos recientes

Mostrando 1 - 3 de 3
  • Resumen
    Rule formats for nominal process calculi
    Aceto, Luca; Fábregas, Ignacio; García Pérez, Álvaro; Ingólfsdóttir, Anna; Ortega Mallén, Yolanda. Actas de las XVIII Jornadas de Programación y Lenguajes (PROLE 2018), 2018-09-17.
    Artículo publicado en CONCUR 2017. The nominal transition systems (NTSs) of Parrow et al. describe the operational semantics of nominal process calculi. We study NTSs in terms of the nominal residual transition systems (NRTSs) that we introduce. We provide rule formats for the specifications of NRTSs that ensure that the associated NRTS is an NTS and apply them to the operational specification of the early pi-calculus. Our study stems from the recent Nominal SOS of Cimini et al. and from earlier works in nominal sets and nominal logic by Gabbay, Pitts and their collaborators.
  • Resumen
    An Efficient Characterization of Petri Net Solvable Binary Words
    de Frutos Escrig, David; Koutny, Maciej; Mikulski, Lukasz. Actas de las XVIII Jornadas de Programación y Lenguajes (PROLE 2018), 2018-09-17.
    We present a simple characterization of the set of Petri net solvable binary words. It states that they are exactly the extensions of the prefixes of Petri net cyclic solvable words, by some prefix x^k, where x is any letter of the binary alphabet being considered, and k is any natural number. We derive several consequences of this characterization which, in a way, shows that the set of solvable words is smaller than expected. Therefore, the existing conjecture that all of them can be generated by quite simple net is not only confirmed, but indeed reinforced. As a byproduct of the characterization, we also present a linear time algorithm for deciding whether a binary word is solvable. The key idea is that the connection with the cyclic solvable words induces certain structural regularity. Therefore, one just needs to look for possible irregularities, which can be done in a structural way, resulting in a rather surprising linearity of the decision algorithm. Finally, we employ the obtained results to provide a characterization of reversible binary transition systems. Artículo aceptado para su presentación en Petri Nets 2018 - The 39th International Conference on Applications and Theory of Petri Nets and Concurrency. Bratislava, Slovakia, June 24-29, 2018. Los "proceedings" serán publicados en el Volumen 10877 de la serie LNCS de Springer.
  • Resumen
    Una librería para inteligencia de enjambre basada en la programación funcional
    Rubio, Fernando; de la Encina, Alberto; Rabanal, Pablo; Rodríguez, Ismael. Actas de las XVIII Jornadas de Programación y Lenguajes (PROLE 2018), 2018-09-17.
    IIn this paper we present a library of parallel skeletons to deal with swarm intelligence metaheuristics. The library is implemented using the parallel functional language Eden, an extension of the sequential functional language Haskell. Due to the higher-order nature of functional languages, we simplify the task of writing generic code, and also the task of comparing different strategies. The paper illustrates how to develop new skeletons and presents empirical results. The complete version of the paper was accepted for publication in IWANN 2017. The paper can be obtained at