#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1995

2000

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Stefan Kowalewski, Olaf Stursberg, +6 authors Heinz Treseler
- Hybrid Systems
- 1997

This contribution reports on a case study in the application of tool-based methods for a systematic analysis of hybrid systems. In particular, the study is focussed on continuous processes controlled by logic controllers, as this class of hybrid systems is widespread among process industry plants. To achieve comparable results, all methods and tools under… (More)

- Olaf Stursberg, Stefan Kowalewski, Ingo Hoffmann, Jörg Preußig
- Hybrid Systems
- 1996

We describe two approaches to derive Timed and Linear Hybrid Automata from continuous models given as systems of ordinary diierential equations. A semiquantitative modeling method is applied which yields a qualitative description of the system dynamics and quantitative bounds for the residence times in the discrete states or the state variable derivatives.… (More)

- Jörg Preußig, Stefan Kowalewski, Howard Wong-Toi, Thomas A. Henzinger
- FTRTFT
- 1998

ion must be amenable to automated analysis. Typically, this is achieved by ensuring that the abstraction belongs to a restricted class of automata. In previous work, we proposed that the abstractions H 0 be linear hybrid automata [1], in which the continuous dynamics are given as constant polyhedral di erential inclusions. For these automata, reachable… (More)

- Ralf Huuck, Yassine Lakhnech, Luis Urbina, Sebastian Engell, Stefan Kowalewski, Jörg Preußig
- Scalable Computing: Practice and Experience
- 1998

In this paper we integrate two diierent approaches for the speciication and veriication of timed systems being used in control theory and computer science. These are the timed condition/event systems and the timed automata formalisms. Our main result states that timed condition/event systems can be eeciently transformed into timed automata which then can be… (More)

- Jörg Preußig, Olaf Stursberg, Stefan Kowalewski
- HSCC
- 1999

The paper presents a concept for the reachability analysis of switched continuous systems in which switching only occurs when the continuous state trajectory crosses thresholds defined by a rectangular partitioning of the state space. It combines an existing approach for approximating such systems by rectangular automata with an existing reachability… (More)

- Stefan Kowalewski, Sebastian Engell, Jörg Preußig, Olaf Stursberg
- Automatica
- 1999

An approach to the formal verification of logic controllers for processes with switched continuous dynamics is presented. The method builds on modular, timed discrete event models of the plant and the controller. Subsystems with continuous dynamics are approximated algorithmically. The formal verification consists of determining the reachable discrete… (More)

The paper describes a model-based approach to the formal verification of sequential control programs for chemical processes. It is assumed that the control software is represented as a Sequential Function Chart (SFC) which may include timing constraints for the control actions. The verification method is based on a timed Condition/Event (C/E) model of the… (More)

- Sebastian Engell, Stefan Kowalewski, Bruce H. Krogh, Jörg Preußig
- EUROSIM
- 1995

- Stefan Kowalewski, Jörg Preußig
- TACAS
- 1996

This paper describes the use of timed Condition/Event (C/E) systems, a real-time extension of the C/E system framework introduced by Sreenivas and Krogh, for building models of chemical plants in a modular fashion and as a basis for the model-based analysis of their discrete control. The approach is illustrated by applying it to the safety control logic of… (More)

- Jörg Preußig
- 2000