loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
First ACM and IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE?03)
A Generalised Approach to Supervisor Synthesis
Mont Saint-Michel, France
June 24-June 26
ISBN: 0-7695-1923-7
ASCII Text
x 
 
Roberto Ziller, Klaus Schneider, "A Generalised Approach to Supervisor Synthesis," Formal Methods and Models for Co-Design, ACM/IEEE International Conference on, pp. 217, First ACM and IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE?03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/MEMCOD.2003.1210106,
author = {Roberto Ziller and Klaus Schneider},
title = {A Generalised Approach to Supervisor Synthesis},
journal ={Formal Methods and Models for Co-Design, ACM/IEEE International Conference on},
volume = {0},
year = {2003},
isbn = {0-7695-1923-7},
pages = {217},
doi = {http://doi.ieeecomputersociety.org/10.1109/MEMCOD.2003.1210106},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Formal Methods and Models for Co-Design, ACM/IEEE International Conference on
TI - A Generalised Approach to Supervisor Synthesis
SN - 0-7695-1923-7
SP
EP
A1 - Roberto Ziller,
A1 - Klaus Schneider,
PY - 2003
KW - null
VL - 0
JA - Formal Methods and Models for Co-Design, ACM/IEEE International Conference on
ER -
 
Roberto Ziller, University of Karlsruhe
Klaus Schneider, University of Kaiserslautern
We present a generalisation of the supervisory control problem proposed by Ramadge and Wonham. The objective of that problem is to synthesise a controller which constrains a system's behaviour according to a given specification, ensuring controllability and coaccessibility. By introducing a new representation of the solution using systems of ?-calculus equations we are able to handle these two conditions separately and thus to exchange the coaccessibility requirement by any ?-calculus expression. Well-known results on the complexity of ?-calculus model checking allow us to easily assess the computational complexity of any generalisation. As an example we solve the synthesis problem under consideration of fairness constraints.
Citation:
Roberto Ziller, Klaus Schneider, "A Generalised Approach to Supervisor Synthesis," memocode, pp.217, First ACM and IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE?03), 2003
Usage of this product signifies your acceptance of the Terms of Use.