This paper presents an extension of existing software architecture tools to model physical systems, their interconnections, and the interactions between physical and cyber components. A new CPS architectural style is introduced to support the principled design and evaluation of alternative architectures for cyberphysical systems (CPSs). The implementation of the CPS architectural style in AcmeS...

The analysis of forest cover change at different scales is an increasingly important research topic in environmental studies. Forest Landscape Restoration (FLR) integrated approach to manage and restore forests across various landscapes environments. Such restoration helps meet the targets Sustainable Development Goal (SDG)–15, as outlined UN Environment’s sixth Global Outlook, which includes s...

Statistical model-checking is a recent technique used for both verification and performance analysis of hybrid systems. It does not suffer from decidability issues or state-space explosion compared to traditional model-checking. Furthermore, it is applicable to more powerful formalisms such as stochastic hybrid automata. Its principle is simple so how simple is it really to make it work in prac...

Statistical model-checking is a recent technique used for both verification and performance analysis of hybrid systems. It does not suffer from decidability issues or state-space explosion compared to traditional model-checking. Furthermore, it is applicable to more powerful formalisms such as stochastic hybrid automata. Its principle is simple so how simple is it really to make it work in prac...

A novel approach is developed for predicting body trajectories for cancer progression, where conditional probabilities of clinical data are modeled using Hidden Markov Model techniques. Basically, each potential body site is encoded by an N-letter code, and a disease trajectory is described in terms of a string of letters. Patient data base records are then represented by such strings with diff...

Markov automata (MA) and weak bisimulation have been proposed by Eisentraut, Hermanns and Zhang in [10]. In this paper we propose early and late semantics of Markovian automata, and then introduce early and late weak bisimulations correspondingly. We show that early weak bisimulation coincides with the weak bisimulation in [10], and late weak bisimulation is strictly coarser. Further, we extend...

Hybrid system theory lies at the intersection of the fields of engineering control theory and computer science verification. It is defined as the modeling, analysis, and control of systems that involve the interaction of both discrete state systems, represented by finite automata, and continuous state dynamics, represented by differential equations. The embedded autopilot of a modern commercial...

We introduce sampled data hybrid automata (SDHA) as a formal model of hybrid systems that result from clock-driven computer control of continuous dynamic sytems. In contrast to standard hybrid automata, the discrete state transitions in the SDHA can occur only at valid sampling times when the guard conditions are evaluated. Sequences of valid sampling times are defined by a clock structure that...

We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpretations of hybrid automata in the process algebra for hybrid systems and compare them with the standard interpretation of hybrid automata as timed transition systems. We also relate the synchronized product operator on ...