NSTL国家科技图书文献中心

1. Clock-Dependent Probabilistic Timed Automata with One Clock and No Memory NSTL国家科技图书文献中心

Jeremy Sproston - 《Formal Methods and Software Engineering》 - International Conference on Formal Engineering Methods - 2025, - 70～84 - 共15页

摘要：Clock-dependent probabilistic timed automata | extend probabilistic* timed automata by letting the* | values of clock variables. The probabilistic | reachability problem for clock-dependent probabilistic* timed* | automata has been shown previously to be undecidable. We

关键词： Probabilistic model checking | Timed automata | Parametric markov chains

2. Probabilistic cellular automata simulation of microstructure evolution: the role of model parameters on precision and uncertainty NSTL国家科技图书文献中心

Seyed-Salehi, Majid - 《Modelling and simulation in materials science and engineering》 - 2025,33(1) - 共22页

摘要：Probabilistic cellular automata (PCA) is a | microstructural evolution. In this method, probabilistic* state* | widely used and cost-efficient method for simulating | change rules determine the evolution of cell states at | each time step. However, its stochastic nature

关键词： probabilistic cellular automata | probability distribution function | uncertainty assessment | microstructure evolution

3. A micro-level approach for modeling rumor propagation in online social networks NSTL国家科技图书文献中心

Ebrahim,Sahafizadeh | Saeed,Talatian Azad - 《Soft computing》 - 2025,29(3) - 1667～1675 - 共9页

摘要： model in terms of probabilistic* automata network. To* | Abstract Online social networks have become | the major platforms for information dissemination in | recent years. However, rapid propagation of rumors in | these networks as a special form of information can

关键词： Rumor propagation | Social network | Agent-based model | Probabilistic automata

4. Hierarchical Learning of Generative Automaton Models from Sequential Data NSTL国家科技图书文献中心

Benjamin von Berg | Bernhard K. Aicherni...... - 《Software Engineering and Formal Methods》 - International Conference on Software Engineering and Formal Methods - 2025, - 215～233 - 共19页

摘要：Passive automata* learning is a method for* | to reactive systems with probabilistic* behavior. In* | inferring automaton models from a given collection of | observations of system behavior (traces). It has been applied | particular, IOAlergia is a well known algorithm for

关键词： Generative models | Model inference | Markov decision processes | Passive automata learning | Real driving emissions

5. Probabilistic Automata-Based Method for Enhancing Performance of Deep Reinforcement Learning Systems NSTL国家科技图书文献中心

Min Yang | Guanjun Liu ... - 《IEEE/CAA journal of automatica sinica》 - 2024,11(11) - 2327～2339 - 共13页

摘要： performance improvement framework based on probabilistic | automata, which aims to proactively identify and correct | minimal model modifications. First, a probabilistic | probabilistic decision-making units (PDMUs), and a reverse | automaton is constructed from the historical trajectory of

关键词： Job shop scheduling | Decision making | Automata | Probabilistic logic | Deep reinforcement learning | Real-time systems | Trajectory | Manufacturing | Standards | Monitoring

6. Decidability of Probabilistic Current-State Opacity for Probabilistic Finite Automata NSTL国家科技图书文献中心

Keru Chen | Shaowen Miao ... - 《2024 43rd Chinese Control Conference,[v.1]》 - Chinese Control Conference - 2024, - 1556～1561 - 共6页

摘要： property for probabilistic* finite automata. Specifically* | feasible for probabilistic* finite automata with finite* | , we center our attention on probabilistic* current* | problem of verifying probabilistic* current-state opacity* | stochastic automata. Subsequently, we establish that

关键词： Automata | Observers | Probabilistic logic | Complexity theory

7. Block approximations for probabilistic mixtures of elementary cellular automata NSTL国家科技图书文献中心

Cirillo E.N.M. | Lancia G.... - 《Physica, A. Statistical mechanics and its applications》 - 2024,654 - 共5页

摘要： Automata are a generalization of Cellular Automata | © 2024 Elsevier B.V.Probabilistic Cellular | . Despite their simple definition, they exhibit | fascinating and complex behaviours. The stationary behaviour | of these models changes when model parameters are

关键词： Block approximation | Probabilistic cellular automata | Stationary measures | Synchronization

8. System reduction: an approach based on probabilistic cellular automata NSTL国家科技图书文献中心

Pierre-Alain Toupanc... | Bastien Chopard ... - 《Natural computing》 - 2024,23(1) - 17～29 - 共13页

摘要： automata. We show that theprocedure is expected to | The goal of this paper it to explore the | possibility to simplify a stochastic complex dynamical | system by reducing thenumber of its degrees of freedom | , through a coarse graining procedure. Our objective is to

关键词： Cellular automata | Coarse-graining | Projection | Dynamical systems | Probabilistic dynamics | Voter model | Community

9. An Enhanced Interface-Based Probabilistic Compositional Verification Approach NSTL国家科技图书文献中心

Samir Ouchani | Otmane Ait Mohamed ... - 《Verification and Evaluation of Computer and Communication Systems: 16th International Conference, VECoS 2023, Marrakech, Morocco, October 18-20, 2023, Proceedings》 - International Conference on Verification and Evaluation of Computer and Communication Systems - 2024, - 60～75 - 共16页

摘要：, predominantly modeled as Probabilistic* Automata (PA). This* | -checking processes for Probabilistic* Automata.* | probabilistic behaviors. Our primary strategy to address the | communication interface amongst composed automata. Initially | In this paper, we aim to advance the state of

关键词： Abstraction | Compositional verification | Probabilistic automata | PRISM | PCTL

10. Correction to “Current-State Opacity Formulations in Probabilistic Finite Automata” [Jan 14 120-133] NSTL国家科技图书文献中心

Anooshiravan Saboori | Christoforos N. Hadj... - 《IEEE Transactions on Automatic Control》 - 2024,69(5) - 3480～3481 - 共2页

摘要：This note identifies a flaw in the proof of | Theorem 16 in (Saboori and Hadjicostis, 2014). It also | discusses how the statement of Theorem 16 can be adjusted | and provides the corresponding proof.

摘要：Clock-dependent probabilistic timed automata | extend probabilistic* timed automata by letting the* | values of clock variables. The probabilistic | reachability problem for clock-dependent probabilistic* timed* | automata has been shown previously to be undecidable. We

关键词： Probabilistic model checking | Timed automata | Parametric markov chains

摘要：Probabilistic cellular automata (PCA) is a | microstructural evolution. In this method, probabilistic* state* | widely used and cost-efficient method for simulating | change rules determine the evolution of cell states at | each time step. However, its stochastic nature

关键词： probabilistic cellular automata | probability distribution function | uncertainty assessment | microstructure evolution

摘要： model in terms of probabilistic* automata network. To* | Abstract Online social networks have become | the major platforms for information dissemination in | recent years. However, rapid propagation of rumors in | these networks as a special form of information can

关键词： Rumor propagation | Social network | Agent-based model | Probabilistic automata

摘要：Passive automata* learning is a method for* | to reactive systems with probabilistic* behavior. In* | inferring automaton models from a given collection of | observations of system behavior (traces). It has been applied | particular, IOAlergia is a well known algorithm for

关键词： Generative models | Model inference | Markov decision processes | Passive automata learning | Real driving emissions

关键词： Job shop scheduling | Decision making | Automata | Probabilistic logic | Deep reinforcement learning | Real-time systems | Trajectory | Manufacturing | Standards | Monitoring

摘要： property for probabilistic* finite automata. Specifically* | feasible for probabilistic* finite automata with finite* | , we center our attention on probabilistic* current* | problem of verifying probabilistic* current-state opacity* | stochastic automata. Subsequently, we establish that

关键词： Automata | Observers | Probabilistic logic | Complexity theory

摘要： Automata are a generalization of Cellular Automata | © 2024 Elsevier B.V.Probabilistic Cellular | . Despite their simple definition, they exhibit | fascinating and complex behaviours. The stationary behaviour | of these models changes when model parameters are

关键词： Block approximation | Probabilistic cellular automata | Stationary measures | Synchronization

摘要： automata. We show that theprocedure is expected to | The goal of this paper it to explore the | possibility to simplify a stochastic complex dynamical | system by reducing thenumber of its degrees of freedom | , through a coarse graining procedure. Our objective is to

关键词： Cellular automata | Coarse-graining | Projection | Dynamical systems | Probabilistic dynamics | Voter model | Community

摘要：, predominantly modeled as Probabilistic* Automata (PA). This* | -checking processes for Probabilistic* Automata.* | probabilistic behaviors. Our primary strategy to address the | communication interface amongst composed automata. Initially | In this paper, we aim to advance the state of

关键词： Abstraction | Compositional verification | Probabilistic automata | PRISM | PCTL

摘要：This note identifies a flaw in the proof of | Theorem 16 in (Saboori and Hadjicostis, 2014). It also | discusses how the statement of Theorem 16 can be adjusted | and provides the corresponding proof.

关键词： Eigenvalues and eigenfunctions | Vectors | Probabilistic logic | Automata | Probability distribution | Discrete-event systems | Markov processes

4008-161-200 800-990-8900

国家科技图书文献中心

摘要：Clock-dependent probabilistic timed automata | extend probabilistic timed automata by letting the | values of clock variables. The probabilistic | reachability problem for clock-dependent probabilistic timed | automata has been shown previously to be undecidable. We

关键词： Probabilistic model checking | Timed automata | Parametric markov chains

摘要：Probabilistic cellular automata (PCA) is a | microstructural evolution. In this method, probabilistic state | widely used and cost-efficient method for simulating | change rules determine the evolution of cell states at | each time step. However, its stochastic nature

关键词： probabilistic cellular automata | probability distribution function | uncertainty assessment | microstructure evolution

摘要： model in terms of probabilistic automata network. To | Abstract Online social networks have become | the major platforms for information dissemination in | recent years. However, rapid propagation of rumors in | these networks as a special form of information can

关键词： Rumor propagation | Social network | Agent-based model | Probabilistic automata

摘要：Passive automata learning is a method for | to reactive systems with probabilistic behavior. In | inferring automaton models from a given collection of | observations of system behavior (traces). It has been applied | particular, IOAlergia is a well known algorithm for

关键词： Generative models | Model inference | Markov decision processes | Passive automata learning | Real driving emissions

关键词： Job shop scheduling | Decision making | Automata | Probabilistic logic | Deep reinforcement learning | Real-time systems | Trajectory | Manufacturing | Standards | Monitoring

摘要： property for probabilistic finite automata. Specifically | feasible for probabilistic finite automata with finite | , we center our attention on probabilistic current | problem of verifying probabilistic current-state opacity | stochastic automata. Subsequently, we establish that

关键词： Automata | Observers | Probabilistic logic | Complexity theory

摘要： Automata are a generalization of Cellular Automata | © 2024 Elsevier B.V.Probabilistic Cellular | . Despite their simple definition, they exhibit | fascinating and complex behaviours. The stationary behaviour | of these models changes when model parameters are

关键词： Block approximation | Probabilistic cellular automata | Stationary measures | Synchronization

摘要： automata. We show that theprocedure is expected to | The goal of this paper it to explore the | possibility to simplify a stochastic complex dynamical | system by reducing thenumber of its degrees of freedom | , through a coarse graining procedure. Our objective is to

关键词： Cellular automata | Coarse-graining | Projection | Dynamical systems | Probabilistic dynamics | Voter model | Community

摘要：, predominantly modeled as Probabilistic Automata (PA). This | -checking processes for Probabilistic Automata. | probabilistic behaviors. Our primary strategy to address the | communication interface amongst composed automata. Initially | In this paper, we aim to advance the state of

关键词： Abstraction | Compositional verification | Probabilistic automata | PRISM | PCTL

摘要：This note identifies a flaw in the proof of | Theorem 16 in (Saboori and Hadjicostis, 2014). It also | discusses how the statement of Theorem 16 can be adjusted | and provides the corresponding proof.

关键词： Eigenvalues and eigenfunctions | Vectors | Probabilistic logic | Automata | Probability distribution | Discrete-event systems | Markov processes

4008-161-200 800-990-8900

国家科技图书文献中心

摘要：Clock-dependent probabilistic timed automata | extend probabilistic* timed automata by letting the* | values of clock variables. The probabilistic | reachability problem for clock-dependent probabilistic* timed* | automata has been shown previously to be undecidable. We

摘要：Probabilistic cellular automata (PCA) is a | microstructural evolution. In this method, probabilistic* state* | widely used and cost-efficient method for simulating | change rules determine the evolution of cell states at | each time step. However, its stochastic nature

摘要： model in terms of probabilistic* automata network. To* | Abstract Online social networks have become | the major platforms for information dissemination in | recent years. However, rapid propagation of rumors in | these networks as a special form of information can

摘要：Passive automata* learning is a method for* | to reactive systems with probabilistic* behavior. In* | inferring automaton models from a given collection of | observations of system behavior (traces). It has been applied | particular, IOAlergia is a well known algorithm for

摘要： property for probabilistic* finite automata. Specifically* | feasible for probabilistic* finite automata with finite* | , we center our attention on probabilistic* current* | problem of verifying probabilistic* current-state opacity* | stochastic automata. Subsequently, we establish that

摘要：, predominantly modeled as Probabilistic* Automata (PA). This* | -checking processes for Probabilistic* Automata.* | probabilistic behaviors. Our primary strategy to address the | communication interface amongst composed automata. Initially | In this paper, we aim to advance the state of