Syntax and consistent equation semantics of hybrid Chi

The hybrid χ (Chi) formalism integrates concepts from dynamics and control theory with concepts from computer science, in particular from process algebra and hybrid automata. It integrates ease of modeling with a straightforward, structured operational semantics. Its ‘consistent equation semantics’ enforces state changes to be consistent with delay predicates, that combine the invariant and flow clauses of hybrid automata. Ease of modeling is ensured by means of the following concepts: (1) different classes of variables: discrete and continuous, of subclass jumping or non-jumping, and algebraic; (2) strong time determinism of alternative composition in combination with delayable guards; (3) integration of urgent and non-urgent actions; (4) differential algebraic equations as a process term as in mathematics; (5) steady-state initialization; and 6) several user-friendly syntactic extensions. Furthermore, the χ formalism incorporates several concepts for complex system specification: (1) process terms for scoping that integrate abstraction, local variables, local channels and local recursion definitions; (2) process definition and instantiation that enable process re-use, encapsulation, hierarchical and/or modular composition of processes; and (3) different interaction mechanisms: handshake synchronization and synchronous communication that allow interaction between processes without sharing variables, and shared variables that enable modular composition of continuous-time or hybrid processes. The syntax and semantics are illustrated using several examples.     

Extreme simplification and rendering of point sets using algebraic multigrid

We present a novel approach for extreme simplification of point set models, in the context of real-time rendering. Point sets are often rendered using simple point primitives, such as oriented discs. However, this requires using many primitives to render even moderately simple shapes. Often, one wishes to render a simplified model using only a few primitives, thus trading accuracy for simplicity. For this goal, we propose a more complex primitive, called a splat, that is able to approximate larger and more complex surface areas than oriented discs. We construct our primitive by decomposing the model into quasi-flat regions, using an efficient algebraic multigrid algorithm. Next, we encode these regions into splats implemented as planar support polygons textured with color and transparency information and render the splats using a special blending algorithm. Our approach combines the advantages of mesh-less point-based techniques with traditional polygon-based techniques. We demonstrate our method on various models.     

A linear translation from CTL* to the first-order modal μ -calculus

The modal μ-calculus is a very expressive temporal logic. In particular, logics such as LTL, CTL and CTL* can be translated into the modal μ-calculus, although existing translations of LTL and CTL* are at least exponential in size. We show that an existing simple first-order extension of the modal μ-calculus allows for a linear translation from LTL. Furthermore, we show that solving the translated formulae is as efficient as the best known methods to solve LTL formulae directly.     

Duplication of constants in process algebra

The constant 0 (or δ, nil) has different roles in process algebra: on the one hand, it serves as the identity element of alternative composition, on the other hand, it stands for a blocked atomic action or for livelock. When extensions with timing are considered, these roles diverge. We argue that it is better to use two separate constants 0˙ and 0 for the different usages.With respect to the termination constant 1 (or , skip), the situation is comparable: on the one hand, it serves as the identity element of sequential composition, on the other hand, it serves as the identity element of parallel composition, and stands for a skipped atomic action. We have separate constants 1˙ and 1 for the different usages.We set up a theory of process algebra, starting out from these four constants in their respective roles. We do this first for the untimed theory, and work out the extension to discrete timing and relative timing in detail. We indicate how extensions involving dense timing or absolute timing are to be handled. All extensions are conservative.     

An analytical model to determine the ultimate load on masonry arch bridges.

This paper proposes an analytical elasto–plastic model to describe the behavior of arches. The modeling is carried out using the equations of (i) horizontal equilibrium, (ii) vertical equilibrium and (iii) equilibrium of moments. The latter equations of equilibrium are ordinary differential equations which can easily be solved by adding boundary conditions, imposing restrictions on the horizontal and vertical movement and on the rotation in the abutments of the arch. For masonry arches, including material properties allowing the occurrence of cracks and the subsequent formation of hinges is required. The latter theory has been implemented in a computer program (Matlab), offering numerical simulations. The software was used to illustrate two case-studies, i.e., the assessment of an arch loaded with a vertical point load and one with a horizontal point load.     

Computing multiscale curve and surface skeletons of genus 0 shapes using a global importance measure

We present a practical algorithm for computing robust, multiscale curve and surface skeletons of 3D objects. Based on a model which follows an advection principle, we assign to each point on the skeleton a part of the object surface, called the collapse. The size of the collapse is used as a uniform importance measure for the curve and surface skeleton, so that both can be simplified by imposing a single threshold on this intuitive measure. The simplified skeletons are connected by default, without special precautions, due to the monotonicity of the importance measure. The skeletons possess additional desirable properties: They are centered, robust to noise, hierarchical, and provide a natural skeleton-to-boundary mapping. We present a voxel-based algorithm that is straightforward to implement and simple to use. We illustrate our method on several realistic 3D objects.     

A sequential-move game for enhancing safety and security cooperation within chemical clusters

The present paper provides a game theoretic analysis of strategic cooperation on safety and security among chemical companies within a chemical industrial cluster. We suggest a two-stage sequential move game between adjacent chemical plants and the so-called Multi-Plant Council (MPC). The MPC is considered in the game as a leader player who makes the first move, and the individual chemical companies are the followers. The MPC's objective is to achieve full cooperation among players through establishing a subsidy system at minimum expense. The rest of the players rationally react to the subsidies proposed by the MPC and play Nash equilibrium. We show that such a case of conflict between safety and security, and social cooperation, belongs to the 'coordination with assurance' class of games, and we explore the role of cluster governance (fulfilled by the MPC) in achieving a full cooperative outcome in domino effects prevention negotiations. The paper proposes an algorithm that can be used by the MPC to develop the subsidy system. Furthermore, a stepwise plan to improve cross-company safety and security management in a chemical industrial cluster is suggested and an illustrative example is provided.     

On Well-Foundedness and Expressiveness of Promoted Tyft: Being Promoted Makes a Difference

In this paper, we solve two open problems posed by Karen L. Bernstein regarding her promoted tyft format for structured operational semantics. We show that, unlike formats with closed terms as labels, such as the tyft format, the well-foundedness assumption cannot be dropped for the promoted tyft format while preserving the congruence result. We also show that the well-founded promoted tyft format is incomparable to the tyft format with closed terms as labels, i.e., there are transition relations that can be specified by the promoted tyft format but not by the tyft format, and vice versa.     

A syntactic commutativity format for SOS

Considering operators defined using Structural Operational Semantics (SOS), commutativity axioms are intuitive properties that hold for many of them. Proving this intuition is usually a laborious task, requiring several pages of boring and standard proof. To save this effort, we propose a syntactic SOS format which guarantees commutativity for a set of composition operators.     

Management of evacuation in case of fire accidents in chemical industrial areas

Trade-offs between economic and safety arguments exist in the operation of chemical installations, should knock-on calamities induced by fire accidents occur: a sudden installation shutdown might result in substantial economic losses, but may be needed to ensure safety. Due to the very rare nature of domino effect risks induced decision problems an adequate evacuation decision aid model to be used by plant safety management does, to the best of the authors' knowledge, not exist. This paper develops a tentative approach to calculate the economic gains and/or losses linked to the decision problem whether or not, and when, to evacuate chemical installation(s) threatened by possible domino effect risks. The proposed model is illustrated by a case-study based on empirical data.