China
Africa
Explore chapters and articles related to this topic
Effective and Efficient Modeling and Simulation with DEVS Variants
Published in Gabriel A. Wainer, Pieter J. Mosterman, Discrete-Event Modeling and Simulation, 2018
Adelinde M. Uhrmacher, Jan Himmelspach, Roland Ewald
Our extensions of DEVS are based on Parallel Discrete Event System Specification (PDEVS); [23] rather than the original DEVS formalism [24]. PDEVS supports a parallel execution of internal and external events that occur at the same simulation time and avoids the need for specifying a select function at the level of the coupled model. As does DEVS, PDEVS assumes a static model structure. However, with the number of flexible and adaptable technical systems, for example, in the area of multiagent systems [25], and thriving application areas like systems biology [26], the need for the specification and analysis of these systems has been growing in the last decade. Variable structure models add structure to the temporal dimension in describing systems. As the relation of bisimulation has been shown to hold between the original DEVS formalism and variable structure variants like dynamic structure system network (DSSN; [27]) and dynamic DEVS (DynDevs; [9]), the question arises, what benefit to expect from such formalisms. It appears that it is less important whether a formalism is able to express certain phenomena—but how easily this can be done is crucial for a discussion [28].
Modeling and Simulation Concepts
Published in Gabriel A. Wainer, Discrete-Event Modeling and Simulation, 2017
The formal language of calculus of communicating systems (CCS) provides primitives for concurrency and parallelism, based on synchronous communications between exactly two components. The language expressions are interpreted as a labeled transition system, and bisimulation can be used to prove equivalence of models [29].
Formal Methods
Published in Janet Woodcock, Software Engineering Mathematics, 1988
In CCS two agents are equivalent if their algebraic descriptions are "similar" enough. This notion of similarity is quite precise: if each agent can simulate the other in the sense that we shall give below, then we say that they are bisimilar. In order to understand this notion of bisimulation, define the relation
Logical Characterizations of Fuzzy Simulations
Published in Cybernetics and Systems, 2022
Linh Anh Nguyen, Ngoc-Thanh Nguyen
Bisimulation is a kind of two-way simulation. It is a well-known notion of equivalence in modal logic and the theory of LTSs (see, e.g., Blackburn, de Rijke, and Venema 2001, and references therein). Two states of two crisp LTSs are in the largest bisimulation relation and said to be bisimilar if they have the same label and each transition for one state can be simulated by a transition with the same label for the other state, leading to successors bisimilar to each other.