Probabilistic assume-guarantee reasoning is a theoretically feasible way to alleviate the state space explosion problem in stochastic model checking. The key for probabilistic assume-guarantee reasoning is how to generate assumption. At present, a main way to automatically generate assumption is the L* (or symbolic L*) learning algorithm. An important limitation of it is too many intermediate results are produced and needs to be stored. To overcome this, we propose a novel assumption generation method by genetic algorithm, and present a probabilistic assume-guarantee reasoning framework for MDP. Genetic algorithm is a randomized algorithm essentially, there are no intermediate results needs to be stored in the process of assumption generation, except encode of the problem domain and training set. It can obviously reduce the space complexity of probabilistic assume-guarantee reasoning framework. In order to improve the efficiency further, we combine the probabilistic assume-guarantee reasoning framework with interface alphabet refinement orthogonally. Moreover, we employ the diagnostic submodel as counterexample for guidance of augmenting training set. We implement a prototype tool for the probabilistic assume-guarantee reasoning framework and report encouraging results.
30 September 2024 in International Journal of Software Engineering and Knowledge Engineering
Stochastic model checking is the extension and generalization of the classical model checking. Compared with classical model checking, stochastic model checking faces more severe state explosion problem, because it combines classical model checking algorithms and numerical methods for calculating probabilities. For dealing with this, we first apply symmetric assume-guarantee rule symmetric (SYM) for two-component systems and symmetric assume-guarantee rule for n-component systems into stochastic model checking in this paper, and propose a compositional stochastic model checking framework of probabilistic automata based on the NL* algorithm. It optimizes the existed compositional stochastic model checking process to draw a conclusion quickly, in cases the system model does not satisfy the quantitative properties. We implement the framework based on the PRISM tool, and several large cases are used to demonstrate the performance of it.
Recommender systems are data-driven tools designed to assist or automate users’ decision-making. With the growing demand of personalized sequential recommendations in business intelligence or e-commerce, effectively capturing temporal information from massive user-sequence data has become a crucial challenge. State-of-the-art attention-based models often struggle to balance performance with computational cost, while traditional convolutional neural networks suffer from limited receptive fields and rigid architectures that inadequately model dynamic user interests. To address these limitations, this paper proposes TimeWeaver, a time-aware dual-stream network for sequential recommendation, whose core innovations comprise three key components. First, it employs a re-parameterized large-kernel convolution to expand the effective receptive field. Second, we design a Time-Aware Augmentation mechanism that integrates inter-event time-interval information into positional encodings of items. This allows it to perceive the temporal dynamics of user behavior. Finally, we propose a dual-stream architecture to jointly capture dependencies across different time scales. The context stream employs a modern Temporal Convolutional Network (TCN) structure to strengthen the memorization of users’ medium- and long-term interests. In parallel, the dynamic stream leverages an Exponential Moving Average (EMA) mechanism to weight recent behaviors for sensitively capturing users’ immediate interests. This dual-stream design allows TimeWeaver to comprehensively extract both long- and short-term sequential features. Extensive experiments on three public e-commerce datasets demonstrate TimeWeaver’s superiority. Compared to the strongest baseline model, TimeWeaver achieves average relative improvements of 4.62%, 9.59%, and 4.59% across all metrics on the Beauty, Sports, and Toys datasets, respectively.