-
1
-
-
34548859945
-
-
Franck Cassez, Stavros Tripakis, and Karine Altisen. Sensor minimization problems with static or dynamic observers for fault diagnosis. Technical Report RI-2007-1, IRCCyN/CNRS, 1 rue de la Noë, BP 92101, 44321 Nantes Cedes, France, January 2007. Available at http://www.irccyn.fr/franck.
-
Franck Cassez, Stavros Tripakis, and Karine Altisen. Sensor minimization problems with static or dynamic observers for fault diagnosis. Technical Report RI-2007-1, IRCCyN/CNRS, 1 rue de la Noë, BP 92101, 44321 Nantes Cedes, France, January 2007. Available at http://www.irccyn.fr/franck.
-
-
-
-
2
-
-
51149108735
-
Sensor minimization problems with static or dynamic observers for fault diagnosis
-
Bratislava, Slovak Republic, July, IEEE Computer Society
-
Franck Cassez, Stavros Tripakis, and Karine Altisen. Sensor minimization problems with static or dynamic observers for fault diagnosis. In 7th International Conference on Application of Concurrency to System Design (ACSD'07), Bratislava, Slovak Republic, July 2007. IEEE Computer Society.
-
(2007)
7th International Conference on Application of Concurrency to System Design (ACSD'07)
-
-
Cassez, F.1
Tripakis, S.2
Altisen, K.3
-
3
-
-
0032642997
-
Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems
-
New Orleans, Louisiana, United States, ACM Press New York, NY, USA. ISBN:1-58133-109-7
-
Ali Dasdan, Sandy S. Irani, and Rajesh K. Gupta. Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems. In Annual ACM IEEE Design Automation Conference, pages 37-42, New Orleans, Louisiana, United States, 1999. ACM Press New York, NY, USA. ISBN:1-58133-109-7.
-
(1999)
Annual ACM IEEE Design Automation Conference
, pp. 37-42
-
-
Dasdan, A.1
Irani, S.S.2
Gupta, R.K.3
-
5
-
-
0035418515
-
A polynomial algorithm for testing diagnosability of discrete event systems
-
August
-
Shengbing Jiang, Zhongdong Huang, Vigyan Chandra, and Ratnesh Kumar. A polynomial algorithm for testing diagnosability of discrete event systems. IEEE Transactions on Automatic Control, 46(8), August 2001.
-
(2001)
IEEE Transactions on Automatic Control
, vol.46
, Issue.8
-
-
Jiang, S.1
Huang, Z.2
Chandra, V.3
Kumar, R.4
-
6
-
-
0037350942
-
Optimal sensor selection for discrete event systems with partial observation
-
March
-
Shengbing Jiang, Ratnesh Kumar, and Humberto E. Garcia. Optimal sensor selection for discrete event systems with partial observation. IEEE Transactions on Automatic Control, 48(3):369-381, March 2003.
-
(2003)
IEEE Transactions on Automatic Control
, vol.48
, Issue.3
, pp. 369-381
-
-
Jiang, S.1
Kumar, R.2
Garcia, H.E.3
-
7
-
-
0001391363
-
A characterization of the minimum mean cycle in a digraph
-
Richard M. Karp. A characterization of the minimum mean cycle in a digraph. Discrete Mathematics, 23:309-311, 1978.
-
(1978)
Discrete Mathematics
, vol.23
, pp. 309-311
-
-
Karp, R.M.1
-
8
-
-
0023104549
-
Supervisory control of a class of discrete event processes
-
January
-
Peter Ramadge and W. Murray Wonham. Supervisory control of a class of discrete event processes. SIAM J. Control Optim., 25(1), January 1987.
-
(1987)
SIAM J. Control Optim
, vol.25
, Issue.1
-
-
Ramadge, P.1
Murray Wonham, W.2
-
9
-
-
0029373586
-
Diagnosability of discrete event systems
-
September
-
Meera Sampath, Raja Sengupta, Stephane Lafortune, Kasim Sinnamohideen, and Demosthenis C. Teneketzis. Diagnosability of discrete event systems. IEEE Transactions on Automatic Control, 40(9), September 1995.
-
(1995)
IEEE Transactions on Automatic Control
, vol.40
, Issue.9
-
-
Sampath, M.1
Sengupta, R.2
Lafortune, S.3
Sinnamohideen, K.4
Teneketzis, D.C.5
-
11
-
-
0034840907
-
On the computational complexity of some problems arising in partially-observed discrete event systems
-
Arlington, VA
-
Tae-Sic Yoo and Stéphane Lafortune. On the computational complexity of some problems arising in partially-observed discrete event systems. In American Control Conference (ACC'01), 2001. Arlington, VA.
-
(2001)
American Control Conference (ACC'01)
-
-
Yoo, T.1
Lafortune, S.2
-
12
-
-
0030143640
-
The complexity of mean payoff games on graphs
-
Uri Zwick and Michael S. Paterson. The complexity of mean payoff games on graphs. Theoretical Computer Science, 158(1-2):343-359, 1996.
-
(1996)
Theoretical Computer Science
, vol.158
, Issue.1-2
, pp. 343-359
-
-
Zwick, U.1
Paterson, M.S.2
|