Results 1  10
of
17
I.: RCharon, a Modeling Language for Reconfigurable Hybrid Systems
 In: Hybrid Systems: Computation and Control. Volume 3927 of LNCS
, 2006
"... For more information, please contact ..."
(Show Context)
Foundations of a compositional interchange format for hybrid systems
, 2006
"... Abstract. A compositional interchange format for hybrid systems is defined in terms of an interchange automaton, allowing arbitrary differential algebraic equations, including fully implicit or switched DAEs, discrete, continuous and algebraic variables, that can be internal or external, urgency con ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
(Show Context)
Abstract. A compositional interchange format for hybrid systems is defined in terms of an interchange automaton, allowing arbitrary differential algebraic equations, including fully implicit or switched DAEs, discrete, continuous and algebraic variables, that can be internal or external, urgency conditions, and operators for parallel composition, action hiding, variable hiding and urgent actions. Its compositional semantics is formally defined in terms of a hybrid transition system. This allows development of transformations to and from other formalisms that can be proven to preserve essential properties, and it allows a clear separation between the mathematical meaning of a model and implementation aspects such as algorithms used for solving differential algebraic equations. 1
Automating verification of cooperation, control, and design in traffic applications
 FORMAL METHODS AND HYBRID REALTIME SYSTEMS. VOLUME 4700 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2007
"... We present a verification methodology for cooperating traffic agents covering analysis of cooperation strategies, realization of strategies through control, and implementation of control. For each layer, we provide dedicated approaches to formal verification of safety and stability properties of the ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
(Show Context)
We present a verification methodology for cooperating traffic agents covering analysis of cooperation strategies, realization of strategies through control, and implementation of control. For each layer, we provide dedicated approaches to formal verification of safety and stability properties of the design. The range of employed verification techniques invoked to span this verification space includes application of preverified design patterns, automatic synthesis of Lyapunov functions, constraint generation for parameterized designs, modelchecking in rich theories, and abstraction refinement. We illustrate this approach with a variant of the European Train Control System (ETCS), employing layer specific verification techniques to layer specific views of an ETCS design.
Hillston (2009): HYPE: a process algebra for compositional flows and emergent behaviour. CONCUR 2009Concurrency Theory
"... Abstract. Several process algebras for modelling hybrid systems have appeared in the literature in recent years. These all assume that continuous variables in the system are modelled monolithically, often with the differential equations embedded explicitly in the syntax of the process algebra expre ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
Abstract. Several process algebras for modelling hybrid systems have appeared in the literature in recent years. These all assume that continuous variables in the system are modelled monolithically, often with the differential equations embedded explicitly in the syntax of the process algebra expression. In HYPE an alternative approach is taken which offers finergrained modelling with each flow or influence affecting a variable modelled separately. The overall behaviour then emerges as the composition of these flows. This approach is supported by an operational semantics which distinguishes states as collections of flows and which is supported by an equivalence which satisfies the property that bisimilar HYPE models give rise to the same sets of continuous behaviours.
Stochastic HYPE: Flowbased modelling of stochastic hybrid systems
"... Stochastic HYPE is a novel process algebra that models stochastic, instantaneous and continuous behaviour. It develops the flowbased approach of the hybrid process algebra HYPE by replacing nonurgent events with events with exponentiallydistributed durations and also introduces random resets. The ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Stochastic HYPE is a novel process algebra that models stochastic, instantaneous and continuous behaviour. It develops the flowbased approach of the hybrid process algebra HYPE by replacing nonurgent events with events with exponentiallydistributed durations and also introduces random resets. The random resets allow for general stochasticity, and in particular allow for the use of event durations drawn from distributions other than the exponential distribution. To account for stochasticity, the semantics of stochastic HYPE target piecewise deterministic Markov processes (PDMPs), via intermediate transitiondriven stochastic hybrid automata (TDSHA) in contrast to the hybrid automata used as semantic target for HYPE. Stochastic HYPE models have a specific structure where the controller of a system is separate from the continuous aspect of this system providing separation of concerns and supporting reasoning. A novel equivalence is defined which captures when two models have the same stochastic behaviour (as in stochastic bisimulation), instantaneous behaviour (as in classical bisimulation) and continuous behaviour. These techniques are illustrated via an assembly line example. 1
Refactoring, Refinement, and Reasoning A Logical Characterization for Hybrid Systems
"... Abstract. Refactoring of code is a common device in software engineering. As cyberphysical systems (CPS) become ever more complex, similar engineering practices become more common in CPS development. Proper safe developments of CPS designs are accompanied by a proof of correctness. Since the inhe ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Refactoring of code is a common device in software engineering. As cyberphysical systems (CPS) become ever more complex, similar engineering practices become more common in CPS development. Proper safe developments of CPS designs are accompanied by a proof of correctness. Since the inherent complexities of CPS practically mandate iterative development, frequent changes of models are standard practice, but require reverification of the resulting models after every change. To overcome this issue, we develop proofaware refactorings for CPS. That is, we study model transformations on CPS and show how they correspond to relations on correctness proofs. As the main technical device, we show how the impact of model transformations on correctness can be characterized by different notions of refinement in differential dynamic logic. Furthermore, we demonstrate the application of refinements on a series of safetypreserving and livenesspreserving refactorings. For some of these we can give strong results by proving on a metalevel that they are correct. Where this is impossible, we construct proof obligations for showing that the refactoring respects the refinement relation. 1
Foundations of a compositional interchange format for hybrid systems
, 2006
"... Abstract A compositional interchange format for hybrid systems is defined in terms of an interchange automaton, allowing arbitrary differential algebraic equations, including fully implicit or switched DAEs, discrete, continuous and algebraic variables, that can be internal or external, urgency con ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract A compositional interchange format for hybrid systems is defined in terms of an interchange automaton, allowing arbitrary differential algebraic equations, including fully implicit or switched DAEs, discrete, continuous and algebraic variables, that can be internal or external, urgency conditions, and operators for parallel composition, action hiding, variable hiding and urgent actions. Its compositional semantics is formally defined in terms of a hybrid transition system. This allows development of transformations to and from other formalisms that can be proven to preserve essential properties, and it allows a clear separation between the mathematical meaning of a model and implementation aspects such as algorithms used for solving differential algebraic equations. 1
States in Models of Embedded Systems
, 2012
"... ter verkrijging van de graad van doctor aan de Technische Universiteit Eindhoven, op gezag van de rector magnificus, prof.dr.ir. C.J. van Duijn, voor een commissie aangewezen door het College voor Promoties in het openbaar te verdedigen op dinsdag 22 januari 2013 om 16.00 uur door ..."
Abstract
 Add to MetaCart
(Show Context)
ter verkrijging van de graad van doctor aan de Technische Universiteit Eindhoven, op gezag van de rector magnificus, prof.dr.ir. C.J. van Duijn, voor een commissie aangewezen door het College voor Promoties in het openbaar te verdedigen op dinsdag 22 januari 2013 om 16.00 uur door
Systems Engineering Group
"... implementation of infrastructure for modelbased integration and testing N.C.W.M. Braspenning, J.M. van de MortelFronczak, ..."
Abstract
 Add to MetaCart
(Show Context)
implementation of infrastructure for modelbased integration and testing N.C.W.M. Braspenning, J.M. van de MortelFronczak,