Reachability Analysis of Stochastic Hybrid Systems by Optimal Control (2008)
Bujorianu, L.M., Lygeros, J., Langerak, R.
For stochastic hybrid systems, the reachability analysis is an important and difficult problem. In this paper, we prove that, under natural assumptions, reachability analysis can be characterised as...
Decision algorithm for the stability of planar switching linear systems (2008)
Daws, C.F., Langerak, R., Polderman, J.W.
This paper presents a decision algorithm for the analysis of the stability of a class of planar switched linear systems, modeled by hybrid automata. The dynamics in each location of the hybrid...
An Interpretation of Concurrent Hybrid Time Systems over Multi-clock Systems (2008)
Bujorianu, M.C., Bujorianu, L.M., Langerak, R.
In this paper, we present a multiclock model for real time abstractions of hybrid systems. We call Hybrid Time systems the resulting model, which is constructed using category theory. Such systems...
Khusainov, D., Langerak, R., Kuzmych, O.
The logic-dynamical hybrid system given by a set of subsystems which are linear differential-difference equations with constant coefficients and constant delay is investigated in the paper. The...
Estimations of solutions convergence of hybrid systems with delay (2006)
Estimations are given for solutions of hybrid systems with delays, by using Lyapunov-Krasovsky functionals.
Stability Analysis for Hybrid Automata Using Conservative Gains (2003)
Langerak, R., Polderman, J.W., Krilavičius, T.
This paper presents a stability analysis approach for a class of hybrid automata. It is assumed that the dynamics in each location of the hybrid automaton is linear and asymptotically stable, and...
First passage time analysis of stochastic process algebra using partial orders (2001)
Ruys, T.C., Langerak, R., Katoen, J.P., Latella, D., Massink, M.
This paper proposes a partial-order semantics for a stochastic process algebra that supports general (non-memoryless) distributions and combines this with an approach to numerically analyse the first...
A complete finite prefix for process algebra (1999)
In this paper we show how to use McMillan's complete finite prefix approach for process algebra. We present the model of component event structures as a semantics for process algebra, and show how to...
Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding (1999)
The starting point of this paper is McMillan's complete finite prefix of an unfolding that has been obtained from a Petri net or a process algebra expression. The paper addresses the question of how...
Partial-order models for quantitative extensions of LOTOS (1998)
Brinksma, H., Katoen, J.P., Latella, D., Langerak, R.
Event structures are a prominent model for non-interleaving concurrency. The use of event structures for providing a compositional non-interleaving semantics to LOTOS without data is studied. In...
A consistent causality-based view on a timed process algebra including urgent interactions (1998)
Katoen, J.P., Latella, D., Langerak, R., Brinksma, H., Bolognesi, T.
This paper discusses a timed variant of a process algebra akin to LOTOS, baptized UPA, in a causality-based setting. Two timed features are incorporated—a delay function which constrains the...
Validation of Bosch' Mobile Communication NetworkArchitecture with SPIN (1997)
This paper discusses validation projects carried out for the Mobile Communication Division of Robert Bosch GmbH. We verified parts of their Mobile Communication Network (MCNet), a communication...
A stochastic causality-based process algebra (1995)
Brinksma, H., Katoen, J.P., Latella, D., Langerak, R.
This paper discusses stochastic extensions of a simple process algebra in a causality-based setting. Atomic actions are supposed to happen after a delay that is determined by a stochastic variable...
Functionality Decomposition by Compositional Correctness Preserving Transformation (1995)
We present an algorithm for the decomposition of processes in a process algebraic framework. Decomposition, or the refinement of process substructure, is an important design principle in the top-down...
A Stochastic Causality-Based Process Algebra (1995)
Brinksma, E., Langerak, R., Latella, D.
This paper discusses stochastic extensions of a simple process algebra in a causality-based setting. Atomic actions are supposed to happen after a delay that is determined by a stochastic variable...
[3] B. Beizer. Black-Box Testing, Techniques for Functional Testing of Software and (1991)
Postman Tours, In S. Aggarwal, K. Sabnani, Protocol Speci Cation, Veri Cation Viii, A. V. Aho, ...
[6] E. Brinksma. A theory for the derivation of tests. In Protocol Speci cation, Testing,