Araştırma Makalesi
BibTex RIS Kaynak Göster

The Most Probable Path Derivation for Quasi-Birth–Death Processes by Using Symbolic Control

Yıl 2026, Cilt: 9 Sayı: 1, 238 - 253, 14.01.2026
https://doi.org/10.47495/okufbed.1653681

Öz

In this study, we utilize the control theory of discrete event systems to compute the most likely paths in quasi-birth-death processes through hidden Markov models. We begin by discussing how quasi-birth-death processes can be framed as a control problem within the context of discrete event systems. Following this, we encode quasi-birth-death processes as a controller synthesis problem, explaining how to apply safety and optimization algorithms enables the controller to select the best paths. We validate our proposed method through several case studies and report its superior performance compared to various state-of-the-art techniques found in the literature.

Kaynakça

  • Antoniotti M., Mishra B. Discrete event models + temporal logic = supervisory controller: Automatic synthesis of locomotion controllers. In Proceedings of 1995 IEEE International Conference on Robotics and Automation 1995; 2: 1441-1446.
  • Asarin E., Maler O., Pnueli A., Sifakis J. Controller synthesis for timed automata. IFAC Proceedings Volumes 1998; 31(18): 447-452.
  • Bean N., Latouche G., Taylor P. Physical interpretations for quasi-birth-and-death process algorithms. Queueing Models and Service Management 2018; 1(2): 59-78.
  • Bean NG., Nielsen BF. Quasi-birth-and-death processes with rational arrival process components. Stochastic Models 2010; 26(3): 309-334.
  • Berthier N., Marchand H. Discrete controller synthesis for infinite state systems with reax. IFAC Proceedings Volumes 2014; 47(2): 46-53.
  • Bonafonte CA., Ros MX., Marino JB. An efficient algorithm to find the best state sequence in hsmm. In Eurospeech 1993: 3rd European Conference on Speech Communication and Technology 1993; 22-25.
  • Brejova B., Brown DG., Vinar T. The most probable annotation problem in hmms and its application to bioinformatics. Journal of Computer and System Sciences 2007; 73(7): 1060-1077.
  • Chen YL., Lin F. Safety control of discrete event systems using finite state machines with parameters. In Proceedings of the 2001 American Control Conference 2001; 2: 975-980.
  • Çaşka S. The performance of symbolic limited optimal discrete controller synthesis in the control and path planning of the quadcopter. Applied Sciences 2024; 14(16): 1-27.
  • Cawley SL., Pachter L. Hmm sampling and applications to gene finding and alternative splicing. Bioinformatics 2003; 19(2): 36-41.
  • Elhafsi EH., Molle M. On the solution to qbd processes with finite state space. Stochastic Analysis and Applications 2007; 25(4): 763-779.
  • Etessami K., Wojtczak D., Yannakakis M. Quasi-birth–death processes, tree-like qbds, probabilistic 1-counter automata, and pushdown systems. Performance Evaluation 2010; 67(9): 837-857.
  • Koller H., Widhalm P., Dragaschnig M., Graser A. Fast hidden markov model map-matching for sparse and noisy trajectories. In 2015 IEEE 18th International Conference on Intelligent Transportation Systems 2015; 2557-2561.
  • Latouche G., Ramaswami V. Introduction to matrix analytic methods in stochastic modeling. SIAM 1999; 45-78.
  • Luo J., Zhou M. Petri-net controller synthesis for partially controllable and observable discrete event systems. IEEE Transactions on Automatic Control 2016; 62(3): 1301-1313.
  • Marchand H., Bournai P., Le Borgne M., Le Guernic P. Synthesis of discrete-event controllers based on the signal environment. Discrete Event Dynamic System: Theory and Applications 2000; 10(4): 325-346.
  • Oura R., Ushio T., Sakakibara A. Bounded synthesis and reinforcement learning of supervisors for stochastic discrete event systems with ltl specifications. IEEE Transactions on Automatic Control 2024; 69(10): 6668-6683.
  • Özbaltan M. Hidden abstract stack markov models with learning process. Mathematics 2024; 12(13): 1-19.
  • Özbaltan M., Berthier N. Power-aware scheduling of data-flow hardware circuits with symbolic control. Archives of Control Sciences 2021; 31(2): 431-446.
  • Özbaltan M., Çaşka S. Incorporating symbolic discrete controller synthesis into a virtual robot experimental platform: An implementation with collaborative unmanned aerial vehicle robots. Drones 2021; 8(5): 1-15.
  • Özbaltan M., Kurucan M. Obtaining the most likely path in stochastic hidden input automata by using limited optimal discrete control. IEEE Access 2024; 12: 14776-14786.
  • Rabiner LR. A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE 1989; 77(2):257–286.
  • Ramadge PJ., Wonham WM. Supervisory control of a class of discrete event processes. SIAM Journal on Control and Optimization 1987; 25(1): 206-230.
  • Samari B., Akbarzadeh O., Zaker M., Lavaei A. From a single trajectory to safety controller synthesis of discrete-time nonlinear polynomial systems. IEEE Control Systems Letters 2024; 8: 3123-3128.
  • Tayachi Z., Escheikh M., Barkaoui K. Performance evaluation of virtual switch with batch arrival using quasi-birth–death process. In 2019 International Conference on Industrial Engineering and Systems Management 2019; 1-6.
  • Van LJ., Winands E. Quasi-birth-and-death processes with an explicit rate matrix. Stochastic Models 2016; 22(1): 77-98.
  • Viterbi AJ. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory 1967; 13(2): 260–269.
  • Wu JL. Control synthesis for discrete-time nonlinear control systems under state and input constraints. IEEE Transactions on Automatic Control 2024; 69(12): 8418-8432.

Sembolik Kontrol Kullanarak Quasi-Doğum-Ölüm Süreçleri İçin En Olası Yol Hesaplaması

Yıl 2026, Cilt: 9 Sayı: 1, 238 - 253, 14.01.2026
https://doi.org/10.47495/okufbed.1653681

Öz

Bu çalışmada, gizli Markov modelleri aracılığıyla quasi-doğum-ölüm süreçlerinde en olası yolları hesaplamak için ayrık olay sistemlerinin kontrol teorisini kullanıyoruz. İlk olarak, quasi-doğum-ölüm süreçlerinin, ayrık olay sistemleri ağlamında bir kontrol problemi olarak nasıl çerçevelenebileceğini ele alıyoruz. Ardından, quasi-doğum-ölüm süreçlerini bir kontrol sentez problemi olarak kodluyoruz. Güvenlik ve optimizasyon algoritmalarının uygulanması ile elde edilen denetleyicinin en iyi yolları nasıl seçmesini sağladığını açıklıyoruz. Önerilen yöntemi vaka çalışmaları ile doğruluyoruz ve sunduğumuz yaklaşımın literatürde kullanılan yöntemlere kıyasla üstün performans sağladığını gösteriyoruz.

Kaynakça

  • Antoniotti M., Mishra B. Discrete event models + temporal logic = supervisory controller: Automatic synthesis of locomotion controllers. In Proceedings of 1995 IEEE International Conference on Robotics and Automation 1995; 2: 1441-1446.
  • Asarin E., Maler O., Pnueli A., Sifakis J. Controller synthesis for timed automata. IFAC Proceedings Volumes 1998; 31(18): 447-452.
  • Bean N., Latouche G., Taylor P. Physical interpretations for quasi-birth-and-death process algorithms. Queueing Models and Service Management 2018; 1(2): 59-78.
  • Bean NG., Nielsen BF. Quasi-birth-and-death processes with rational arrival process components. Stochastic Models 2010; 26(3): 309-334.
  • Berthier N., Marchand H. Discrete controller synthesis for infinite state systems with reax. IFAC Proceedings Volumes 2014; 47(2): 46-53.
  • Bonafonte CA., Ros MX., Marino JB. An efficient algorithm to find the best state sequence in hsmm. In Eurospeech 1993: 3rd European Conference on Speech Communication and Technology 1993; 22-25.
  • Brejova B., Brown DG., Vinar T. The most probable annotation problem in hmms and its application to bioinformatics. Journal of Computer and System Sciences 2007; 73(7): 1060-1077.
  • Chen YL., Lin F. Safety control of discrete event systems using finite state machines with parameters. In Proceedings of the 2001 American Control Conference 2001; 2: 975-980.
  • Çaşka S. The performance of symbolic limited optimal discrete controller synthesis in the control and path planning of the quadcopter. Applied Sciences 2024; 14(16): 1-27.
  • Cawley SL., Pachter L. Hmm sampling and applications to gene finding and alternative splicing. Bioinformatics 2003; 19(2): 36-41.
  • Elhafsi EH., Molle M. On the solution to qbd processes with finite state space. Stochastic Analysis and Applications 2007; 25(4): 763-779.
  • Etessami K., Wojtczak D., Yannakakis M. Quasi-birth–death processes, tree-like qbds, probabilistic 1-counter automata, and pushdown systems. Performance Evaluation 2010; 67(9): 837-857.
  • Koller H., Widhalm P., Dragaschnig M., Graser A. Fast hidden markov model map-matching for sparse and noisy trajectories. In 2015 IEEE 18th International Conference on Intelligent Transportation Systems 2015; 2557-2561.
  • Latouche G., Ramaswami V. Introduction to matrix analytic methods in stochastic modeling. SIAM 1999; 45-78.
  • Luo J., Zhou M. Petri-net controller synthesis for partially controllable and observable discrete event systems. IEEE Transactions on Automatic Control 2016; 62(3): 1301-1313.
  • Marchand H., Bournai P., Le Borgne M., Le Guernic P. Synthesis of discrete-event controllers based on the signal environment. Discrete Event Dynamic System: Theory and Applications 2000; 10(4): 325-346.
  • Oura R., Ushio T., Sakakibara A. Bounded synthesis and reinforcement learning of supervisors for stochastic discrete event systems with ltl specifications. IEEE Transactions on Automatic Control 2024; 69(10): 6668-6683.
  • Özbaltan M. Hidden abstract stack markov models with learning process. Mathematics 2024; 12(13): 1-19.
  • Özbaltan M., Berthier N. Power-aware scheduling of data-flow hardware circuits with symbolic control. Archives of Control Sciences 2021; 31(2): 431-446.
  • Özbaltan M., Çaşka S. Incorporating symbolic discrete controller synthesis into a virtual robot experimental platform: An implementation with collaborative unmanned aerial vehicle robots. Drones 2021; 8(5): 1-15.
  • Özbaltan M., Kurucan M. Obtaining the most likely path in stochastic hidden input automata by using limited optimal discrete control. IEEE Access 2024; 12: 14776-14786.
  • Rabiner LR. A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE 1989; 77(2):257–286.
  • Ramadge PJ., Wonham WM. Supervisory control of a class of discrete event processes. SIAM Journal on Control and Optimization 1987; 25(1): 206-230.
  • Samari B., Akbarzadeh O., Zaker M., Lavaei A. From a single trajectory to safety controller synthesis of discrete-time nonlinear polynomial systems. IEEE Control Systems Letters 2024; 8: 3123-3128.
  • Tayachi Z., Escheikh M., Barkaoui K. Performance evaluation of virtual switch with batch arrival using quasi-birth–death process. In 2019 International Conference on Industrial Engineering and Systems Management 2019; 1-6.
  • Van LJ., Winands E. Quasi-birth-and-death processes with an explicit rate matrix. Stochastic Models 2016; 22(1): 77-98.
  • Viterbi AJ. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory 1967; 13(2): 260–269.
  • Wu JL. Control synthesis for discrete-time nonlinear control systems under state and input constraints. IEEE Transactions on Automatic Control 2024; 69(12): 8418-8432.
Toplam 28 adet kaynakça vardır.

Ayrıntılar

Birincil Dil İngilizce
Konular Makine Öğrenme (Diğer)
Bölüm Araştırma Makalesi
Yazarlar

Mete Özbaltan 0000-0002-3215-6363

Gönderilme Tarihi 8 Mart 2025
Kabul Tarihi 30 Temmuz 2025
Yayımlanma Tarihi 14 Ocak 2026
Yayımlandığı Sayı Yıl 2026 Cilt: 9 Sayı: 1

Kaynak Göster

APA Özbaltan, M. (2026). The Most Probable Path Derivation for Quasi-Birth–Death Processes by Using Symbolic Control. Osmaniye Korkut Ata Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 9(1), 238-253. https://doi.org/10.47495/okufbed.1653681
AMA 1.Özbaltan M. The Most Probable Path Derivation for Quasi-Birth–Death Processes by Using Symbolic Control. Osmaniye Korkut Ata Üniversitesi Fen Bilimleri Enstitüsü Dergisi. 2026;9(1):238-253. doi:10.47495/okufbed.1653681
Chicago Özbaltan, Mete. 2026. “The Most Probable Path Derivation for Quasi-Birth–Death Processes by Using Symbolic Control”. Osmaniye Korkut Ata Üniversitesi Fen Bilimleri Enstitüsü Dergisi 9 (1): 238-53. https://doi.org/10.47495/okufbed.1653681.
EndNote Özbaltan M (01 Ocak 2026) The Most Probable Path Derivation for Quasi-Birth–Death Processes by Using Symbolic Control. Osmaniye Korkut Ata Üniversitesi Fen Bilimleri Enstitüsü Dergisi 9 1 238–253.
IEEE [1]M. Özbaltan, “The Most Probable Path Derivation for Quasi-Birth–Death Processes by Using Symbolic Control”, Osmaniye Korkut Ata Üniversitesi Fen Bilimleri Enstitüsü Dergisi, c. 9, sy 1, ss. 238–253, Oca. 2026, doi: 10.47495/okufbed.1653681.
ISNAD Özbaltan, Mete. “The Most Probable Path Derivation for Quasi-Birth–Death Processes by Using Symbolic Control”. Osmaniye Korkut Ata Üniversitesi Fen Bilimleri Enstitüsü Dergisi 9/1 (01 Ocak 2026): 238-253. https://doi.org/10.47495/okufbed.1653681.
JAMA 1.Özbaltan M. The Most Probable Path Derivation for Quasi-Birth–Death Processes by Using Symbolic Control. Osmaniye Korkut Ata Üniversitesi Fen Bilimleri Enstitüsü Dergisi. 2026;9:238–253.
MLA Özbaltan, Mete. “The Most Probable Path Derivation for Quasi-Birth–Death Processes by Using Symbolic Control”. Osmaniye Korkut Ata Üniversitesi Fen Bilimleri Enstitüsü Dergisi, c. 9, sy 1, Ocak 2026, ss. 238-53, doi:10.47495/okufbed.1653681.
Vancouver 1.Özbaltan M. The Most Probable Path Derivation for Quasi-Birth–Death Processes by Using Symbolic Control. Osmaniye Korkut Ata Üniversitesi Fen Bilimleri Enstitüsü Dergisi [Internet]. 01 Ocak 2026;9(1):238-53. Erişim adresi: https://izlik.org/JA98AX62RA

23487




196541947019414  

1943319434 19435194361960219721 19784  2123822610 23877

* Uluslararası Hakemli Dergi (International Peer Reviewed Journal)

* Yazar/yazarlardan hiçbir şekilde MAKALE BASIM ÜCRETİ vb. şeyler istenmemektedir (Free submission and publication).

* Yılda Ocak, Mart, Haziran, Eylül ve Aralık'ta olmak üzere 5 sayı yayınlanmaktadır (Published 5 times a year)

* Dergide, Türkçe ve İngilizce makaleler basılmaktadır.

*Dergi açık erişimli bir dergidir.

Creative Commons License

Bu web sitesi Creative Commons Atıf 4.0 Uluslararası Lisansı ile lisanslanmıştır.