The Experts below are selected from a list of 12639 Experts worldwide ranked by ideXlab platform
Jacques Tisseau - One of the best experts on this subject based on the ideXlab platform.
-
formal validation of Asynchronous Interaction agents algorithms for reaction diffusion problems
Workshop on Parallel and Distributed Simulation, 2007Co-Authors: Pascal Redou, Sebastien Kerdelo, Gireg Desmeulles, Jeanfrancois Abgrall, Vincent Rodin, Jacques TisseauAbstract:In the context of biological complex systems multi-agent simulation, we present an Interaction-agentmodel for reaction-diffusion problems that enables Interaction with the simulation during the execution, and we establish a mathematical validation for our model. We use two types of Interaction-agents: on one hand, in a chemical reactor with no spatial dimension -e.g. a cell-, a reaction-agent represents an autonomous chemical reaction between several reactants, and modifies the concentration of reaction products. On the other hand, we use interface-agents in order to take into account the spatial dimension that appears with diffusion : interface-agents achieve the matching transfer of reactants between cells. This approach, where the simulation engine makes agents intervene in a chaotic and Asynchronous way, is an alternative to the classical model - which is not relevant when the limits conditions are frequently modified- based on partial derivative equations. We enounciate convergence results for our Interaction-agent methods, and illustrate our model with an example about coagulation inside a blood vessel.
-
PADS - Formal Validation of Asynchronous Interaction-Agents Algorithms for Reaction-Diffusion Problems
21st International Workshop on Principles of Advanced and Distributed Simulation (PADS'07), 2007Co-Authors: Pascal Redou, Sebastien Kerdelo, Gireg Desmeulles, Jeanfrancois Abgrall, Vincent Rodin, Jacques TisseauAbstract:In the context of biological complex systems multi-agent simulation, we present an Interaction-agentmodel for reaction-diffusion problems that enables Interaction with the simulation during the execution, and we establish a mathematical validation for our model. We use two types of Interaction-agents: on one hand, in a chemical reactor with no spatial dimension -e.g. a cell-, a reaction-agent represents an autonomous chemical reaction between several reactants, and modifies the concentration of reaction products. On the other hand, we use interface-agents in order to take into account the spatial dimension that appears with diffusion : interface-agents achieve the matching transfer of reactants between cells. This approach, where the simulation engine makes agents intervene in a chaotic and Asynchronous way, is an alternative to the classical model - which is not relevant when the limits conditions are frequently modified- based on partial derivative equations. We enounciate convergence results for our Interaction-agent methods, and illustrate our model with an example about coagulation inside a blood vessel.
Jens-wolfhard Schicke - One of the best experts on this subject based on the ideXlab platform.
-
Synchrony vs Causality in the Asynchronous Pi-Calculus
Electronic Proceedings in Theoretical Computer Science, 2011Co-Authors: Kirstin Peters, Jens-wolfhard Schicke, Uwe NestmannAbstract:We study the relation between process calculi that differ in their either synchronous or Asynchronous Interaction mechanism. Concretely, we are interested in the conditions under which synchronous Interaction can be implemented using just Asynchronous Interactions in the pi-calculus. We assume a number of minimal conditions referring to the work of Gorla: a "good" encoding must be compositional and preserve and reflect computations, deadlocks, divergence, and success. Under these conditions, we show that it is not possible to encode synchronous Interactions without introducing additional causal dependencies in the translation.
-
Symmetric and Asymmetric Asynchronous Interaction
Electronic Notes in Theoretical Computer Science, 2009Co-Authors: Rob Van Glabbeek, Ursula Goltz, Jens-wolfhard SchickeAbstract:We investigate classes of systems based on different Interaction patterns with the aim of achieving distributability. As our system model we use Petri nets. In Petri nets, an inherent concept of simultaneity is built in, since when a transition has more than one preplace, it can be crucial that tokens are removed instantaneously. When modelling a system which is intended to be implemented in a distributed way by a Petri net, this built-in concept of synchronous Interaction may be problematic. To investigate the problem we assume that removing tokens from places can no longer be considered as instantaneous. We model this by inserting silent (unobservable) transitions between transitions and their preplaces. We investigate three different patterns for modelling this type of Asynchronous Interaction. Full asynchrony assumes that every removal of a token from a place is time consuming. For symmetric asynchrony, tokens are only removed slowly in case of backward branched transitions, hence where the concept of simultaneous removal actually occurs. Finally we consider a more intricate pattern by allowing to remove tokens from preplaces of backward branched transitions Asynchronously in sequence (asymmetric asynchrony). We investigate the effect of these different transformations of instantaneous Interaction into Asynchronous Interaction patterns by comparing the behaviours of nets before and after insertion of the silent transitions. We exhibit for which classes of Petri nets we obtain equivalent behaviour with respect to failures equivalence. It turns out that the resulting hierarchy of Petri net classes can be described by semi-structural properties. In case of full asynchrony and symmetric asynchrony, we obtain precise characterisations; for asymmetric asynchrony we obtain lower and upper bounds. We briefly comment on possible applications of our results to Message Sequence Charts.
-
Symmetric and Asymmetric Asynchronous Interaction
arXiv: Logic in Computer Science, 2008Co-Authors: Rob Van Glabbeek, Ursula Goltz, Jens-wolfhard SchickeAbstract:We investigate classes of systems based on different Interaction patterns with the aim of achieving distributability. As our system model we use Petri nets. In Petri nets, an inherent concept of simultaneity is built in, since when a transition has more than one preplace, it can be crucial that tokens are removed instantaneously. When modelling a system which is intended to be implemented in a distributed way by a Petri net, this built-in concept of synchronous Interaction may be problematic. To investigate this we consider Asynchronous implementations of nets, in which removing tokens from places can no longer be considered as instantaneous. We model this by inserting silent (unobservable) transitions between transitions and some of their preplaces. We investigate three such implementations, differing in the selection of preplaces of a transition from which the removal of a token is considered time consuming, and the possibility of collecting the tokens in a given order. We investigate the effect of these different transformations of instantaneous Interaction into Asynchronous Interaction patterns by comparing the behaviours of nets before and after insertion of the silent transitions. We exhibit for which classes of Petri nets we obtain equivalent behaviour with respect to failures equivalence. It turns out that the resulting hierarchy of Petri net classes can be described by semi-structural properties. For two of the classes we obtain precise characterisations; for the remaining class we obtain lower and upper bounds. We briefly comment on possible applications of our results to Message Sequence Charts.
-
On Synchronous and Asynchronous Interaction in Distributed Systems
arXiv: Logic in Computer Science, 2008Co-Authors: Rob Van Glabbeek, Ursula Goltz, Jens-wolfhard SchickeAbstract:When considering distributed systems, it is a central issue how to deal with Interactions between components. In this paper, we investigate the paradigms of synchronous and Asynchronous Interaction in the context of distributed systems. We investigate to what extent or under which conditions synchronous Interaction is a valid concept for specification and implementation of such systems. We choose Petri nets as our system model and consider different notions of distribution by associating locations to elements of nets. First, we investigate the concept of simultaneity which is inherent in the semantics of Petri nets when transitions have multiple input places. We assume that tokens may only be taken instantaneously by transitions on the same location. We exhibit a hierarchy of `Asynchronous' Petri net classes by different assumptions on possible distributions. Alternatively, we assume that the synchronisations specified in a Petri net are crucial system properties. Hence transitions and their preplaces may no longer placed on separate locations. We then answer the question which systems may be implemented in a distributed way without restricting concurrency, assuming that locations are inherently sequential. It turns out that in both settings we find semi-structural properties of Petri nets describing exactly the problematic situations for Interactions in distributed systems.
-
MFCS - On Synchronous and Asynchronous Interaction in Distributed Systems
Lecture Notes in Computer Science, 2008Co-Authors: Rob Van Glabbeek, Ursula Goltz, Jens-wolfhard SchickeAbstract:When considering distributed systems, it is a central issue how to deal with Interactions between components. In this paper, we investigate the paradigms of synchronous and Asynchronous Interaction in the context of distributed systems. We investigate to what extent or under which conditions synchronous Interaction is a valid concept for specification and implementation of such systems. We choose Petri nets as our system model and consider different notions of distribution by associating locations to elements of nets. First, we investigate the concept of simultaneity which is inherent in the semantics of Petri nets when transitions have multiple input places. We assume that tokens may only be taken instantaneously by transitions on the same location. We exhibit a hierarchy of `Asynchronous' Petri net classes by different assumptions on possible distributions. Alternatively, we assume that the synchronisations specified in a Petri net are crucial system properties. Hence transitions and their preplaces may no longer placed on separate locations. We then answer the question which systems may be implemented in a distributed way without restricting concurrency, assuming that locations are inherently sequential. It turns out that in both settings we find semi-structural properties of Petri nets describing exactly the problematic situations for Interactions in distributed systems.
Pascal Redou - One of the best experts on this subject based on the ideXlab platform.
-
formal validation of Asynchronous Interaction agents algorithms for reaction diffusion problems
Workshop on Parallel and Distributed Simulation, 2007Co-Authors: Pascal Redou, Sebastien Kerdelo, Gireg Desmeulles, Jeanfrancois Abgrall, Vincent Rodin, Jacques TisseauAbstract:In the context of biological complex systems multi-agent simulation, we present an Interaction-agentmodel for reaction-diffusion problems that enables Interaction with the simulation during the execution, and we establish a mathematical validation for our model. We use two types of Interaction-agents: on one hand, in a chemical reactor with no spatial dimension -e.g. a cell-, a reaction-agent represents an autonomous chemical reaction between several reactants, and modifies the concentration of reaction products. On the other hand, we use interface-agents in order to take into account the spatial dimension that appears with diffusion : interface-agents achieve the matching transfer of reactants between cells. This approach, where the simulation engine makes agents intervene in a chaotic and Asynchronous way, is an alternative to the classical model - which is not relevant when the limits conditions are frequently modified- based on partial derivative equations. We enounciate convergence results for our Interaction-agent methods, and illustrate our model with an example about coagulation inside a blood vessel.
-
PADS - Formal Validation of Asynchronous Interaction-Agents Algorithms for Reaction-Diffusion Problems
21st International Workshop on Principles of Advanced and Distributed Simulation (PADS'07), 2007Co-Authors: Pascal Redou, Sebastien Kerdelo, Gireg Desmeulles, Jeanfrancois Abgrall, Vincent Rodin, Jacques TisseauAbstract:In the context of biological complex systems multi-agent simulation, we present an Interaction-agentmodel for reaction-diffusion problems that enables Interaction with the simulation during the execution, and we establish a mathematical validation for our model. We use two types of Interaction-agents: on one hand, in a chemical reactor with no spatial dimension -e.g. a cell-, a reaction-agent represents an autonomous chemical reaction between several reactants, and modifies the concentration of reaction products. On the other hand, we use interface-agents in order to take into account the spatial dimension that appears with diffusion : interface-agents achieve the matching transfer of reactants between cells. This approach, where the simulation engine makes agents intervene in a chaotic and Asynchronous way, is an alternative to the classical model - which is not relevant when the limits conditions are frequently modified- based on partial derivative equations. We enounciate convergence results for our Interaction-agent methods, and illustrate our model with an example about coagulation inside a blood vessel.
Sebastien Kerdelo - One of the best experts on this subject based on the ideXlab platform.
-
formal validation of Asynchronous Interaction agents algorithms for reaction diffusion problems
Workshop on Parallel and Distributed Simulation, 2007Co-Authors: Pascal Redou, Sebastien Kerdelo, Gireg Desmeulles, Jeanfrancois Abgrall, Vincent Rodin, Jacques TisseauAbstract:In the context of biological complex systems multi-agent simulation, we present an Interaction-agentmodel for reaction-diffusion problems that enables Interaction with the simulation during the execution, and we establish a mathematical validation for our model. We use two types of Interaction-agents: on one hand, in a chemical reactor with no spatial dimension -e.g. a cell-, a reaction-agent represents an autonomous chemical reaction between several reactants, and modifies the concentration of reaction products. On the other hand, we use interface-agents in order to take into account the spatial dimension that appears with diffusion : interface-agents achieve the matching transfer of reactants between cells. This approach, where the simulation engine makes agents intervene in a chaotic and Asynchronous way, is an alternative to the classical model - which is not relevant when the limits conditions are frequently modified- based on partial derivative equations. We enounciate convergence results for our Interaction-agent methods, and illustrate our model with an example about coagulation inside a blood vessel.
-
PADS - Formal Validation of Asynchronous Interaction-Agents Algorithms for Reaction-Diffusion Problems
21st International Workshop on Principles of Advanced and Distributed Simulation (PADS'07), 2007Co-Authors: Pascal Redou, Sebastien Kerdelo, Gireg Desmeulles, Jeanfrancois Abgrall, Vincent Rodin, Jacques TisseauAbstract:In the context of biological complex systems multi-agent simulation, we present an Interaction-agentmodel for reaction-diffusion problems that enables Interaction with the simulation during the execution, and we establish a mathematical validation for our model. We use two types of Interaction-agents: on one hand, in a chemical reactor with no spatial dimension -e.g. a cell-, a reaction-agent represents an autonomous chemical reaction between several reactants, and modifies the concentration of reaction products. On the other hand, we use interface-agents in order to take into account the spatial dimension that appears with diffusion : interface-agents achieve the matching transfer of reactants between cells. This approach, where the simulation engine makes agents intervene in a chaotic and Asynchronous way, is an alternative to the classical model - which is not relevant when the limits conditions are frequently modified- based on partial derivative equations. We enounciate convergence results for our Interaction-agent methods, and illustrate our model with an example about coagulation inside a blood vessel.
Gireg Desmeulles - One of the best experts on this subject based on the ideXlab platform.
-
formal validation of Asynchronous Interaction agents algorithms for reaction diffusion problems
Workshop on Parallel and Distributed Simulation, 2007Co-Authors: Pascal Redou, Sebastien Kerdelo, Gireg Desmeulles, Jeanfrancois Abgrall, Vincent Rodin, Jacques TisseauAbstract:In the context of biological complex systems multi-agent simulation, we present an Interaction-agentmodel for reaction-diffusion problems that enables Interaction with the simulation during the execution, and we establish a mathematical validation for our model. We use two types of Interaction-agents: on one hand, in a chemical reactor with no spatial dimension -e.g. a cell-, a reaction-agent represents an autonomous chemical reaction between several reactants, and modifies the concentration of reaction products. On the other hand, we use interface-agents in order to take into account the spatial dimension that appears with diffusion : interface-agents achieve the matching transfer of reactants between cells. This approach, where the simulation engine makes agents intervene in a chaotic and Asynchronous way, is an alternative to the classical model - which is not relevant when the limits conditions are frequently modified- based on partial derivative equations. We enounciate convergence results for our Interaction-agent methods, and illustrate our model with an example about coagulation inside a blood vessel.
-
PADS - Formal Validation of Asynchronous Interaction-Agents Algorithms for Reaction-Diffusion Problems
21st International Workshop on Principles of Advanced and Distributed Simulation (PADS'07), 2007Co-Authors: Pascal Redou, Sebastien Kerdelo, Gireg Desmeulles, Jeanfrancois Abgrall, Vincent Rodin, Jacques TisseauAbstract:In the context of biological complex systems multi-agent simulation, we present an Interaction-agentmodel for reaction-diffusion problems that enables Interaction with the simulation during the execution, and we establish a mathematical validation for our model. We use two types of Interaction-agents: on one hand, in a chemical reactor with no spatial dimension -e.g. a cell-, a reaction-agent represents an autonomous chemical reaction between several reactants, and modifies the concentration of reaction products. On the other hand, we use interface-agents in order to take into account the spatial dimension that appears with diffusion : interface-agents achieve the matching transfer of reactants between cells. This approach, where the simulation engine makes agents intervene in a chaotic and Asynchronous way, is an alternative to the classical model - which is not relevant when the limits conditions are frequently modified- based on partial derivative equations. We enounciate convergence results for our Interaction-agent methods, and illustrate our model with an example about coagulation inside a blood vessel.