Search

Your search keyword '"Rooda, J.E."' showing total 9 results
Start Over Author "Rooda, J.E." Publisher elsevier
9 results on '"Rooda, J.E."'

4. Simulation and verification of hybrid systems using Chi

Author

van Beek, D.A., Rooda, J.E., Schiffelers, R.R.H., and Cassandras, C.

Abstract

The hybrid Χ (Chi) formalism integrates concepts from dynamics and control theory with concepts from computer science. It integrates ease of modeling with a straightforward, structured operational semantics based on S-functions. Both simulators are defined in terms of a so-called stepper, which computes the set of possible transitions for given a Χ process. The stepper consists of three main functions: a function, Sa which returns the set of action steps for given a Χ process, a function Sd which returns the set of time steps for given a Χ process, and a function Tr which returns the reduced set of transitions. Action steps and time steps can be seen as symbolic transitions. They contain all information that is needed to determine the transitions that the process from which they are derived can perform without solving predicates. An action step represents zero or more action transitions and a time step represents zero or more time transitions.

Published
2006

5. A hybrid language for modeling, simulation and verification

Author

Schiffelers, R.R.H., Beek, van, D.A., Man, K.L., Reniers, M.A., Rooda, J.E., Engell, S., Gueguen, H., Zaytoon, J., and Formal System Analysis

Subjects
Computer Science::Logic in Computer Science, Computer Science::Programming Languages, Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)
Abstract

The ¿ language is a hybrid language for modeling, simulation and verification. As a result of the recently completed formal semantics, the language now consists of a number of orthogonal operators that operate on all process terms, including differential algebraic equations. The same ¿ model can be used for simulation and verification. Verification is possible after a straightforward syntactical translation of the model. Simulation related information is clearly separated from the other statements.

Published
2003

8. Nonconflict check by using sequential automaton abstractions

Author

Su, R. (Rong), Schuppen, J.H. (Jan) van, Rooda, J.E. (Jacobus), Haalen, R. van, Hofkamp, A., Su, R. (Rong), Schuppen, J.H. (Jan) van, Rooda, J.E. (Jacobus), Haalen, R. van, and Hofkamp, A.

Abstract

In Ramadge–Wonham supervisory control theory we often need to check nonconflict of plants and corresponding synthesized supervisors. For a large system such a check imposes a great computational challenge because of the complexity incurred by the composition of plants and supervisors. In this paper we present a novel procedure based on automaton abstractions, which removes internal transitions of relevant automata at each step, allowing the nonconflict check to be performed on relatively small automata, even though the original product system can be fairly large.

Published
2010
Full Text
View/download PDF

9. Languages and applications in hybrid modelling : positioning of Chi

Author

Beek, van, D.A., Rooda, J.E., Morel, G., and Vernadat, F.B.

Abstract

A widely used classification of modelling languages distinguishes the categories continuous-time (CT), discrete-event (DE), discrete-time (DT), and hybrid. For a better insight into the many different hybrid languages, a classification of five categories (CT, CT+, DE, DE+, and CT/DE) is proposed. Each category is explained, together with many of the included languages, simulators, and the associated application fields. Special interest is given to the Chi language used for specification, simulation and real-time control of industrial systems. Its CT part is based on (conditional) DAEs, its DE part on Communicating Sequential Processes. The suitability of the language for DE, CT, and CT/DE modelling is illustrated by two cases.

Published
1998

Catalog

Books, media, physical & digital resources
See catalog results