A nondeterministic extension over finitely recursive process model

被引:1
作者
Bose, S
Mukhopadhyay, S
Patra, A
机构
[1] INDIAN INST TECHNOL,DEPT ELECT ENGN,KHARAGPUR 721302,W BENGAL,INDIA
[2] CTR ARTIFICIAL INTELLIGENCE & ROBOT,BANGALORE 560001,KARNATAKA,INDIA
来源
DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS | 1997年 / 7卷 / 03期
关键词
discrete event systems; process algebra models; finitely recursive processes; nondeterminism;
D O I
10.1023/A:1008251930588
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper extends the Finitely Recursive Process framework introduced by Inan and Varaiya for modelling Discrete Event Systems to encompass nondeterministic processes. Nondeterminism has been captured as a set of possible 'deterministic futures' instead of using the standard 'failure' model of Communicating Sequential Processes. In the beginning a general structure of finitely recursive process space is provided with some important modifications. Next, the nondeterministic process space has been introduced as a special case of the general algebraic process space. A collection of operators has been defined over this nondeterministic process space that enables its characterisation in a finitely recursive manner. Finally, the advantages and disadvantages of the proposed model vis-a-vis other nondeterministic models of discrete event systems are discussed.
引用
收藏
页码:243 / 274
页数:32
相关论文
共 14 条
  • [1] A Nondeterministic Extension over Finitely Recursive Process Model
    Supratik Bose
    Siddhartha Mukhopadhyay
    Amit Patra
    Discrete Event Dynamic Systems, 1997, 7 : 243 - 274
  • [2] Boundedness analysis of finitely recursive processes - Part I: Concurrent processes
    Bose, S
    Patra, A
    Mukhopadhyay, S
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1998, 43 (11) : 1514 - 1531
  • [3] Boundedness analysis of finitely recursive processes - Part II: Sequential and hybrid processes
    Bose, S
    Mukhopadhyay, S
    Patra, A
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1998, 43 (11) : 1532 - 1542
  • [4] Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in Coq
    Chappe N.
    He P.
    Henrio L.
    Zakowski Y.
    Zdancewic S.
    Proceedings of the ACM on Programming Languages, 2023, 7 : 1770 - 1800
  • [5] Universality and semicomputability for nondeterministic programming languages over abstract algebras
    Jiang, Wei
    Wang, Yuan
    Zucker, Jeffery
    JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 2007, 71 (01): : 44 - 78
  • [6] Complete model-based equivalence class testing for nondeterministic systems
    Huang, Wen-ling
    Peleska, Jan
    FORMAL ASPECTS OF COMPUTING, 2017, 29 (02) : 335 - 364
  • [7] Model Abstraction of Nondeterministic Finite-State Automata in Supervisor Synthesis
    Su, Rong
    van Schuppen, Jan H.
    Rooda, Jacobus E.
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2010, 55 (11) : 2527 - 2541
  • [8] Strategies to Automatically Derive a Process Model from a Configurable Process Model Based on Event Data
    Arriagada-Benitez, Mauricio
    Sepulveda, Marcos
    Munoz-Gama, Jorge
    Buijs, Joos C. A. M.
    APPLIED SCIENCES-BASEL, 2017, 7 (10):
  • [9] Using Markov Decision Process over Local Modular Supervisors for Planning Problems
    Sarsur, Daniel
    Alves, Lucas V. R.
    Pena, Patricia N.
    IFAC PAPERSONLINE, 2024, 58 (01): : 126 - 131
  • [10] Statistical model checking for stochastic hybrid systems involving nondeterminism over continuous domains
    Ellen, Christian
    Gerwinn, Sebastian
    Fraenzle, Martin
    INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, 2015, 17 (04) : 485 - 504