We generalize the definition of Proof Labeling Schemes to reactivesystems, that is, systems where the configuration is supposed to keep changing forever. As an example, we address the main classical test case of reac...
详细信息
ISBN:
(数字)9783030643485
ISBN:
(纸本)9783030643478;9783030643485
We generalize the definition of Proof Labeling Schemes to reactivesystems, that is, systems where the configuration is supposed to keep changing forever. As an example, we address the main classical test case of reactive tasks, namely, the task of token passing. Different RPLSs are given for the cases that the network is assumed to be a tree or an anonymous ring, or a general graph, and the sizes of RPLSs' labels are analyzed. We also address the question whether an RPLS exists. Interestingly, for the anonymous ring, it is known that no token passing algorithm is possible even if the number n is known. Nevertheless, we show that an RPLS is possible. We show that if one drops the assumption that n is known, the construction becomes impossible.
This paper describes the analysis, modeling, and simulation of a notional air defense system using SMOOCHES (State Machines for Object-Oriented, Concurrent, Hierarchical Engineering Specifications). SMOOCHES is an obj...
详细信息
This paper describes the analysis, modeling, and simulation of a notional air defense system using SMOOCHES (State Machines for Object-Oriented, Concurrent, Hierarchical Engineering Specifications). SMOOCHES is an object-oriented environment based on hierarchical state machines and extensions to Statecharts, specifically developed as an environment to specify, model, simulate and analyze/evaluate distributed, reactivesystems. Using a high level system specification language, an object-oriented, herarchical state specification of a radar tracking system with realistic constraints is derived. A graphical statechart representation of the tracking system behavior is also derived and implemented within the SMOOCHES environment.
暂无评论