6 research outputs found

    Timed Operational Semantics and Well-Formedness of Shape Calculus

    Get PDF
    The Shape Calculus is a bio-inspired calculus for describing 3D shapes moving in a space. A shape forms a 3D process when combined with a behaviour. Behaviours are specified with a timed CCS-like process algebra using a notion of channel that models naturally binding sites on the surface of shapes. In this paper, the full formal timed operational semantics of the calculus is provided, together with examples that illustrate the use of the calculus in a well-known biological scenario. Moreover, a result of well-formedness about the evolution of a given network of well-formed 3D processes is proved

    Adaptability Checking in Multi-Level Complex Systems

    Full text link
    A hierarchical model for multi-level adaptive systems is built on two basic levels: a lower behavioural level B accounting for the actual behaviour of the system and an upper structural level S describing the adaptation dynamics of the system. The behavioural level is modelled as a state machine and the structural level as a higher-order system whose states have associated logical formulas (constraints) over observables of the behavioural level. S is used to capture the global and stable features of B, by a defining set of allowed behaviours. The adaptation semantics is such that the upper S level imposes constraints on the lower B level, which has to adapt whenever it no longer can satisfy them. In this context, we introduce weak and strong adaptabil- ity, i.e. the ability of a system to adapt for some evolution paths or for all possible evolutions, respectively. We provide a relational characterisation for these two notions and we show that adaptability checking, i.e. deciding if a system is weak or strong adaptable, can be reduced to a CTL model checking problem. We apply the model and the theoretical results to the case study of motion control of autonomous transport vehicles.Comment: 57 page, 10 figures, research papaer, submitte

    Adaptability checking in complex systems

    Get PDF
    A hierarchical approach for modelling the adaptability features of complex systems is introduced. It is based on a structural level S, describing the adaptation dynamics of the system, and a behavioural level B accounting for the description of the admissible dynamics of the system. Moreover, a unified system, called S[B]S[B], is defined by coupling S and B. The adaptation semantics is such that the S level imposes structural constraints on the B level, which has to adapt whenever it no longer can satisfy them. In this context, we introduce weak and strong adaptability, i.e. the ability of a system to adapt for some evolution paths or for all possible evolutions, respectively. We provide a relational characterisation for these two notions and we show that adaptability checking, i.e. deciding if a system is weakly or strongly adaptable, can be reduced to a CTL model checking problem. We apply the model and the theoretical results to the case study of a motion controller of autonomous transport vehicles

    Timed Operational Semantics and Well-Formedness of Shape Calculus

    No full text
    The Shape Calculus is a bio-inspired calculus for describing 3D shapes moving in a space. A shape forms a 3D process when combined with a behaviour. Behaviours are specified with a timed CCS-like process algebra using a notion of channel that models naturally binding sites on the surface of shapes. In this paper, the full formal timed operational semantics of the calculus is provided, together with examples that illustrate the use of the calculus in a well-known biological scenario. Moreover, a result of well-formedness about the evolution of a given network of well-formed 3D processes is proved

    Shape Calculus: Timed Operational Semantics and Well-Formedness

    No full text
    Extended version, including proofs, of Bartocci, E.; Cacciagrano, D. R.; Di Berardini, M. R.; Merelli, E. & Tesei, L. Timed Operational Semantics and Well-formedness of Shape Calculus. Scientific Annals of Computer Science, 20(1):33-52, 201
    corecore