Search

Your search keyword '"Su, R. (Rong)"' showing total 36 results
Start Over Author "Su, R. (Rong)" Search Limiters Available in Library Collection

Refine your results

36 results on '"Su, R. (Rong)"'

7. 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

8. Aggregative synthesis of distributed supervisors based on automata abstraction

Author

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

Abstract

Achieving nonblockingness in supervisory control imposes a major challenge when the number of states of a target system is large, often owing to synchronous product of many relatively small local components. To overcome this difficulty, in this paper we first present a distributed supervisory control problem, then provide an aggregative synthesis approach that computes nonblocking distributed supervisors. The key to the success of this approach is a newly developed automaton abstraction technique, that removes irrelevant internal transitions at each synthesis stage so that nonblocking supervisor synthesis can be carried out on relatively small abstracted models.

Published
2010
Full Text
View/download PDF

9. Model abstraction of nondeterministic finite state automata in supervisor synthesis

Author

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

Abstract

Blockingness is one of the major obstacles that need to be overcome in the Ramadge-Wonham supervisory synthesis paradigm, especially for large systems. In this paper, we propose an abstraction technique to overcome this difficulty. We first provide details of this abstraction technique, then describe how it can be applied to a supervisor synthesis problem, where plant models are nondeterministic but specifications and supervisors are deterministic. We show that a nonblocking supervisor for an abstraction of a plant under a specification is guaranteed to be a nonblocking supervisor of the original plant under the same specification. The reverse statement is also true, if we impose an additional constraint in the choice of the alphabet of abstraction, i.e., every event, which is either observable or labels a transition to a marker state, is contained in the alphabet of abstraction.

Published
2010
Full Text
View/download PDF

10. Aggregative synthesis of distributed supervisors based on automata abstraction

Author

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

Abstract

Achieving nonblockingness in supervisory control imposes a major challenge when the number of states of a target system is large, often owing to synchronous product of many relatively small local components. To overcome this difficulty, in this paper we first present a distributed supervisory control problem, then provide an aggregative synthesis approach that computes nonblocking distributed supervisors. The key to the success of this approach is a newly developed automaton abstraction technique, that removes irrelevant internal transitions at each synthesis stage so that nonblocking supervisor synthesis can be carried out on relatively small abstracted models.

Published
2010
Full Text
View/download PDF

11. Model abstraction of nondeterministic finite state automata in supervisor synthesis

Author

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

Abstract

Blockingness is one of the major obstacles that need to be overcome in the Ramadge-Wonham supervisory synthesis paradigm, especially for large systems. In this paper, we propose an abstraction technique to overcome this difficulty. We first provide details of this abstraction technique, then describe how it can be applied to a supervisor synthesis problem, where plant models are nondeterministic but specifications and supervisors are deterministic. We show that a nonblocking supervisor for an abstraction of a plant under a specification is guaranteed to be a nonblocking supervisor of the original plant under the same specification. The reverse statement is also true, if we impose an additional constraint in the choice of the alphabet of abstraction, i.e., every event, which is either observable or labels a transition to a marker state, is contained in the alphabet of abstraction.

Published
2010
Full Text
View/download PDF

12. 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

13. Control of input/output discrete-event systems

Author

Petreczky, M. (Mihaly), Teunissen, R., Su, R. (Rong), Beek, D.A. van, Schuppen, J.H. (Jan) van, Rooda, J.E. (Jacobus), Petreczky, M. (Mihaly), Teunissen, R., Su, R. (Rong), Beek, D.A. van, Schuppen, J.H. (Jan) van, and Rooda, J.E. (Jacobus)

Published
2009

27. Control of input/output discrete-event systems

Author

Petreczky, M. (Mihaly), Teunissen, R., Su, R. (Rong), Beek, D.A. van, Schuppen, J.H. (Jan) van, Rooda, J.E. (Jacobus), Petreczky, M. (Mihaly), Teunissen, R., Su, R. (Rong), Beek, D.A. van, Schuppen, J.H. (Jan) van, and Rooda, J.E. (Jacobus)

Published
2009

32. Control of input-output discrete-event systems

Author

Petreczky, M. (Mihaly), Theunissen, R., Su, R. (Rong), Beek, D.A. van, Schuppen, J.H. (Jan) van, Rooda, J.E. (Jacobus), Petreczky, M. (Mihaly), Theunissen, R., Su, R. (Rong), Beek, D.A. van, Schuppen, J.H. (Jan) van, and Rooda, J.E. (Jacobus)

Published
2008

35. Control of input-output discrete-event systems

Author

Petreczky, M. (Mihaly), Theunissen, R., Su, R. (Rong), Beek, D.A. van, Schuppen, J.H. (Jan) van, Rooda, J.E. (Jacobus), Petreczky, M. (Mihaly), Theunissen, R., Su, R. (Rong), Beek, D.A. van, Schuppen, J.H. (Jan) van, and Rooda, J.E. (Jacobus)

Published
2008

Catalog

Books, media, physical & digital resources
See catalog results