State estimation for constant-time labeled automata under dense time
References
[1]
Abdeddaïm Y., Asarin E., Maler O., Scheduling with timed automata, Theoretical Computer Science 354 (2) (2006) 272–300.
[2]
Alur R., Dill D.L., A theory of timed automata, Theoretical Computer Science 126 (2) (1994) 183–235.
[3]
Alur R., Fix L., Henzinger T.A., A determinizable class of timed automata, in: Dill D.L. (Ed.), Computer aided verification, 1999, pp. 1–13.
[4]
Alur R., Madhusudan P., Decision problems for timed automata: a survey, in: Bernardo M., Corradini F. (Eds.), Formal methods for the design of real-time systems, 2004, pp. 1–24.
[5]
Basile F., Cabasino M.P., Seatzu C., State estimation and fault diagnosis of labeled time Petri net systems with unobservable transitions, IEEE Transactions on Automatic Control 60 (4) (2015) 997–1009.
[6]
Berthomieu B., Diaz M., Modeling and verification of time dependent systems using time Petri nets, IEEE Transactions on Software Engineering 17 (3) (1991) 259–273.
[7]
Bondy J.A., Graph theory with applications, The Macmillan Press Ltd, 1976.
[8]
Bouyer P., Haddad S., Reynier P.-A., Undecidability results for timed automata with silent transitions, Fundamenta Informaticae 92 (1–2) (2009) 1–25.
[9]
Brailsford S.C., Potts C.N., Smith B.M., Constraint satisfaction problems: algorithms and applications, European Journal of Operational Research 119 (3) (1999) 557–581.
[10]
Brandin B., Wonham W., Supervisory control of timed discrete-event systems, IEEE Transactions on Automatic Control 39 (2) (1994) 329–342.
[11]
Caines, P. E., Greiner, R., & Wang, S. (1988). Dynamical logic observers for finite automata. In Proceedings of 27th IEEE conference on decision and control (pp. 226–233).
[12]
Cartwright D., Gleason T.C., The number of paths and cycles in a digraph, Psychometrika. 31 (2) (1966) 179–199.
[13]
Cassandras C.G., Lafortune S., Introduction to discrete event systems, Springer, Cham, Switzerland, 2021.
[14]
Cassez F., The dark side of timed opacity, in: Park J.H., Chen H.-H., Atiquzzaman M., Lee C., Kim T.-h., Yeo S.-S. (Eds.), Advances in information security and assurance, 2009, pp. 21–30.
[15]
Cassez, F. (2010). Dynamic observers for fault diagnosis of timed systems. In Proceedings of 49th IEEE conference on decision and control (pp. 4359–4364).
[16]
Declerck P., Bonhomme P., State estimation of timed labeled Petri nets with unobservable transitions, IEEE Transactions on Automation Science and Engineering 11 (1) (2014) 103–110.
[17]
Dima C., Real-time automata, Journal of Automata, Languages and Combinatorics 6 (1) (2001) 3–24.
[18]
Finkel O., Undecidable problems about timed automata, in: Asarin E., Bouyer P. (Eds.), Formal modeling and analysis of timed systems, 2006, pp. 187–199.
[19]
Focardi, R., & Gorrieri, R. (1994). A taxonomy of trace-based security properties for CCS. In Proceedings of the workshop on computer security foundations (pp. 126–136).
[20]
Gao, C., Lefebvre, D., Seatzu, C., Li, Z., & Giua, A. (2020). A region-based approach for state estimation of timed automata under no event observation. In Proceedings of 25th IEEE international conference on emerging technologies and factory automation (pp. 799–804).
[21]
Gaubert S., Performance evaluation of (max,+) automata, IEEE Transactions on Automatic Control 40 (12) (1995) 2014–2025.
[22]
Gómez R., Bowman H., Efficient detection of zeno runs in timed automata, in: Raskin J.F., Thiagarajan P.S. (Eds.), Formal modeling and analysis of timed systems, 2007, pp. 195–210.
[23]
Hadjicostis C.N., Estimation and inference in discrete event systems: A model-based approach with finite automata, Springer, Cham, Switzerland, 2020.
[24]
Hua L.-k., Shiu P., Introduction to number theory, Springer, Berlin, Heidelberg, 1982.
[25]
Jeron, T., Marchand, H., Pinchinat, S., & Cordier, M.-O. (2006). Supervision patterns in discrete event systems diagnosis. In Proceedings of 8th international workshop on discrete event systems (pp. 262–268).
[26]
Kostolányi P., Determinisability of unary weighted automata over the rational numbers, Theoretical Computer Science 898 (2022) 110–131.
[27]
Koutsoukos X.D., He K.X., Lemmon M.D., Antsaklis P.J., Timed Petri nets in hybrid systems: stability and supervisory control, Discrete Event Dynamic Systems: Theory and Applications 8 (2) (1998) 137–173.
[28]
Lai A., Lahaye S., Giua A., State estimation of max-plus automata with unobservable events, Automatica 105 (2019) 36–42.
[29]
Lai A., Lahaye S., Giua A., Verification of detectability for unambiguous weighted automata, IEEE Transactions on Automatic Control 66 (3) (2021) 1437–1444.
[30]
Lefebvre D., Li Z., Liang Y., Diagnosis of timed patterns for discrete event systems by means of state isolation, Automatica 153 (111045) (2023) 1.
[31]
Li J., Lefebvre D., Hadjicostis C.N., Li Z., Observers for a class of timed automata based on elapsed time graphs, IEEE Transactions on Automatic Control 67 (2) (2022) 767–779.
[32]
Lin F., Opacity of discrete event systems and its applications, Automatica 47 (3) (2011) 496–503.
[33]
Mazarè, L. (2004). Using unification for opacity properties. In Proceedings of the workshop on issues in the theory of security (pp. 165–176).
[34]
Merlin P., Farber D., Recoverability of communication protocols-implications of a theoretical study, IEEE Transactions on Communications 24 (9) (1976) 1036–1043.
[35]
Özveren C.M., Willsky A.S., Observability of discrete event dynamic systems, IEEE Transactions on Automatic Control 35 (7) (1990) 797–806.
[36]
Panek S., Stursberg O., Engell S., Efficient synthesis of production schedules by optimization of timed automata, Control Engineering Practice 14 (10) (2006) 1183–1197.
[37]
Ramadge, P. J. (1986). Observability of discrete event systems. In Proceedings of 25th IEEE conference on decision and control (pp. 1108–1112).
[38]
Saboori, A., & Hadjicostis, C. N. (2007). Notions of security and opacity in discrete event systems. In Proceedings of 46th IEEE conference on decision and control (pp. 5056–5061).
[39]
Saboori, A., & Hadjicostis, C. N. (2008). Verification of initial-state opacity in security applications of DES. In Proceedings of 9th international workshop on discrete event systems (pp. 328–333).
[40]
Saboori, A., & Hadjicostis, C. N. (2009). Verification of K-step opacity and analysis of its complexity. In Proceedings of 48th IEEE conference on decision and control (pp. 205–210).
[41]
Saboori A., Hadjicostis C.N., Verification of infinite-step opacity and complexity considerations, IEEE Transactions on Automatic Control 57 (5) (2012) 1265–1269.
[42]
Sampath M., Lafortune S., Teneketzis D., Active diagnosis of discrete-event systems, IEEE Transactions on Automatic Control 43 (7) (1998) 908–929.
[43]
Sampath M., Sengupta R., Lafortune S., Sinnamohideen K., Teneketzis D., Diagnosability of discrete-event systems, IEEE Transactions on Automatic Control 40 (9) (1995) 1555–1575.
[44]
Tong Y., Li Z., Seatzu C., Giua A., Verification of state-based opacity using Petri nets, IEEE Transactions on Automatic Control 62 (99) (2017) 2823–2837.
[45]
Tripakis S., Fault diagnosis for timed automata, in: Damm W., Olderog E.R. (Eds.), Formal techniques in real-time and fault-tolerant systems, 2002, pp. 205–221.
[46]
Van Hung D., Ji W., On the design of hybrid control systems using automata models, in: Chandru V., Vinay V. (Eds.), Foundations of software technology and theoretical computer science, 1996, pp. 156–167.
[47]
Wang X., Li Z., Wonham W.M., Dynamic multiple-period reconfiguration of real-time scheduling based on timed DES supervisory control, IEEE Transactions on Industrial Informatics 12 (1) (2016) 101–111.
[48]
Wang L., Zhan N., An J., The opacity of real-time automata, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 37 (11) (2018) 2845–2856.
[49]
Wonham W.M., Towards an abstract internal model principle, IEEE Transactions on Systems, Man and Cybernetics SMC-6 (11) (1976) 735–740.
[50]
Xu S., Kumar R., Real-time control of dense-time systems using digital-clocks, IEEE Transactions on Automatic Control 55 (9) (2010) 2003–2013.
[51]
Zaytoon J., Lafortune S., Overview of fault diagnosis methods for discrete event systems, Annual Reviews in Control 37 (2) (2013) 308–320.
[52]
Zhang, K. (2021). State-based opacity of real-time automata. In Proceedings of the international workshop on cellular automata and discrete complex systems (pp. 12:1–12:15).
[53]
Zuberek W.M., Timed Petri nets definitions, properties, and applications, Microelectronics Reliability 31 (4) (1991) 627–644.
Index Terms
- State estimation for constant-time labeled automata under dense time
Index terms have been assigned to the content through auto-classification.
Recommendations
State estimation in labeled time Petri net systems using observed modified state class graph
AbstractIn this paper, we present an improved method for the state estimation of a labeled time Petri net (LTPN) system with unobservable transitions. Precisely, we provide a computationally efficient graph, called an observed modified state class graph (...
Discrete-time minmax filtering subject to a norm-constrained state estimate
This paper considers discrete-time minmax filtering when the state estimate, or part of the state estimate, is subjected to a norm constraint. Derivation and use of minmax filters are motivated by the desire to estimate systems states in a more robust ...
Symbolic state estimation in bounded timed labeled Petri nets
AbstractThis paper addresses the state estimation of timed discrete event systems, where the occurrence of an event is associated with a time delay and the initial state of the system belongs to a set of possible initial states. A discrete event system ...
Comments
Information & Contributors
Information
Published In
Elsevier Ltd.
Publisher
Pergamon Press, Inc.
United States
Publication History
Published: 01 December 2024
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Feb 2025