Sembrando en las lomas de Villarrubia de Santiago con una Kuhn SD 4500

El pasado 8 de febrero, tras varias semanas de condiciones atmosféricas y de suelo adversas, el equipo del LPF-Tagralia asistido por dos alumnos colaboradores del Máster de Agroingeniería de la UPM, logró realizar el esperado ensayo de campo para la evaluación de una sembradora Kuhn SD 4500. Hay que agradecer a los responsables de la explotación SAT San Pedro la posibilidad que nos han brindado de evaluar una máquina en plena campaña en un momento en el que existe una clara limitación del tiempo disponible para realizar la labor en toda superficie programada. La sembradora tiene dos años de vida útil (aproximadamente 750 h de uso) lo que otorga a los ensayos un valor añadido al contemplar aspectos que no se tienen en cuenta cuando se estudia una máquina nueva

Empleo de herramientas de simulación con fines docentes para desarrollar prácticas de sistemas altamente distribuidos

El objetivo de este proyecto consiste en mitigar los problemas existentes para ejecutar aplicaciones distribuidas en las prácticas de la asignatura Programación de Sistemas Distribuidos. Para ello proponemos el uso del simulador SIMCAN, el cual ha sido validado contra arquitecturas reales. Concretamente, se propone adaptar este simulador, desarrollado en el contexto de la investigación, para fines docentes. Seguidamente, se utilizará la versión adaptada de SIMCAN en las prácticas de la asignatura Programación de Sistemas Distribuidos, del grado de Ingeniería de Computadores de la FDI/UCM

Modal abstractions in μ \mu CRL

We describe a framework to generate modal abstract approximations from process algebraic specifications, written in the language µ-CRL. We introduce a new format for processes specification called Modal Linear Process Equation (MLPE). An MLPE represents all the possible interleavings of the parallel composition of a number of processes. Every transition step may lead to a set of abstract states labelled with a set of abstract actions. We use MLPEs to characterize abstract interpretations of systems and to generate Modal Labelled Transition Systems, in which transitions may have two modalities may and must. We prove that the abstractions are sound for the full action-based µ-calculus. The main parts of the theory have been formalized and proved using the automatic theorem prover PVS. The set of definitions, theorems and proofs composes a reusable framework to formally analyze process specifications

Modal Abstractions in µCRL

We describe a framework to generate modal abstract approximations from process algebraic specifications, written in the language µCRL. We allow abstraction of state variables and action labels. Moreover, we introduce a new format for process specifications called Modal Linear Process Equation (MLPE). Every transition step may lead to a set of abstract tates labelled with a set of abstract actions. We use MLPEs to characterize abstract interpretations of systems and to generate Modal Labelled Transition Systems, in which transitions may have two modalities may and must. We prove that the abstractions are sound for the full action-based µ-calculus. Finally, we apply the result to check some safety and liveness properties for the bounded retransmission protocol

An abstract interpretation toolkit for μCRL

This paper describes a toolkit that assists in the task of generating abstract approximations of process algebraic specifications written in the language μCRL. Abstractions are represented by Modal Labelled Transition Systems, which are mixed transition systems with may and must modalities. The approach permits to infer the satisfaction or refutation of safety and liveness properties expressed in the (action-based) μ-calculus. The tool supports the abstraction of states and action labels, which allows to deal with infinitely branching systems

An Abstract Interpretation Toolkit for μCRL

AbstractThis paper describes a toolkit that assists in the task of generating abstract approximations of process algebraic specifications written in the language μCRL. Abstractions are represented by Modal Labelled Transition Systems, which are mixed transition systems with may and must modalities. The approach permits to infer the satisfaction or refutation of safety and liveness properties expressed in the (action-based) μ-calculus. The tool supports the abstraction of states and action labels which allows to deal with infinitely branching systems