Información del autor
Documentos disponibles escritos por este autor (6)
Añadir el resultado a su cesta Hacer una sugerencia Refinar búsqueda
texto impreso
Aceto, Luca ; Frutos Escrig, David de ; Gregorio Rodríguez, Carlos ; Ingolfsdottir, Anna | Springer | 2011Ready simulation has proven to be one of the most significant semantics in process theory. It is at the heart of a number of general results that pave the way to a comprehensive understanding of the spectrum of process semantics. Since its origi[...]texto impreso
This paper is devoted to the study of the (in)equational theory of the largest (pre)congruences over the language BCCSP induced by variations on the classic simulation preorder and equivalence that abstract from internal steps in process behavio[...]texto impreso
This note shows that the complete and the ready simulation preorders do not have a finite inequational basis over the language BCCSP when the set of actions is a singleton. Moreover, the equivalences induced by those preorders do not have a fini[...]texto impreso
Aceto, Luca ; Fábregas, Ignacio ; Frutos Escrig, David de ; Ingolfsdottir, Anna ; Palomino, Miguel | Springer | 2012This paper studies the relationships between three notions of behavioural preorder that have been proposed in the literature: refinement over modal transition systems, and the covariant-contravariant simulation and the partial bisimulation preor[...]texto impreso
Aceto, Luca ; Fábregas, Ignacio ; García-Pérez, Álvaro ; Ortega Mallén, Yolanda | Logical Methods in Computer Science | 2019-10-14The 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 sp[...]texto impreso
Aceto, Luca ; Frutos Escrig, David de ; Gregorio Rodríguez, Carlos ; Ingolfsdottir, Anna | Springer | 2012This paper presents a complete account of positive and negative results on the finite axiomatizability of weak complete simulation semantics over the language BCCSP. We offer finite (un)conditional ground-complete axiomatizations for the weak co[...]
