The Experts below are selected from a list of 4149 Experts worldwide ranked by ideXlab platform
Rong Su - One of the best experts on this subject based on the ideXlab platform.
-
technical communique discrete event modeling of multi agent systems with broadcasting based Parallel Composition
Automatica, 2013Co-Authors: Rong SuAbstract:Multi-agent systems have been widely used in logistics and manufacturing. In this paper we develop an automaton-based modeling framework for a special type of multi-agent systems, where agents are instantiated from a finite number of finite-state automaton templates, and interactions among agents are characterized via cooperative synchronization and broadcasting. To describe the Compositional behavior of all agents, we propose a novel broadcasting-based Parallel Composition rule and show that it is commutative and associative. The effectiveness of this modeling framework and the Parallel Composition rule is illustrated in a simple multi-agent system.
-
Discrete-event modeling of multi-agent systems with broadcasting-based Parallel Composition
Automatica, 2013Co-Authors: Rong SuAbstract:Multi-agent systems have been widely used in logistics and manufacturing. In this paper we develop an automaton-based modeling framework for a special type of multi-agent systems, where agents are instantiated from a finite number of finite-state automaton templates, and interactions among agents are characterized via cooperative synchronization and broadcasting. To describe the Compositional behavior of all agents, we propose a novel broadcasting-based Parallel Composition rule and show that it is commutative and associative. The effectiveness of this modeling framework and the Parallel Composition rule is illustrated in a simple multi-agent system. © 2013 Elsevier Ltd. All rights reserved.
Bernhard Steffen - One of the best experts on this subject based on the ideXlab platform.
-
Composition, deComposition and model checking of pushdown processes
Nordic Journal of Computing, 1995Co-Authors: Olaf Burkart, Bernhard SteffenAbstract:In this paper, we consider a strict generalization of context-free processes, the pushdown processes, which are particularly interesting for three reasons: First, they are closed under Parallel Composition with finite state systems. This is shown by proving a new expansion theorem, whose implied 'representation explosion' is no worse than for finite state systems. Second, they axe the smallest extension of context-free processes allowing Parallel Composition with finite state processes, which we prove by showing that every pushdown process is bisimilar to a (relabelled) Parallel Composition of a context-free process (namely a stack) with some finite process. Third, they can be model checked by means of an elegant adaptation to pushdown automata of the second order model checker known for context-free processes. As arbitrary Parallel Composition between context-free processes provides Turing power, and therefore destroys every hope for automatic verification, pushdown processes can be considered as the appropriate generalization of context-free processes for frameworks for automatic verification.
-
pushdown processes Parallel Composition and model checking
International Conference on Concurrency Theory, 1994Co-Authors: Olaf Burkart, Bernhard SteffenAbstract:In this paper, we consider a strict generalization of context-free processes, the pushdown processes, which are particularly interesting for three reasons: First, in contrast to context-free processes that do not support the construction of distributed systems, they are closed under Parallel Composition with finite state systems. Second, they are the smallest extension of context-free processes allowing Parallel Composition with finite state processes. Third, they can be model checked by means of an elegant adaptation to pushdown automata of the second order model checker introduced in [BuS92]. As arbitrary Parallel Composition between context-free processes provides Turing power, and therefore destroys every hope for automatic verification, pushdown processes can be considered as the appropriate generalization of context-free processes for frameworks for automatic verification.
-
CONCUR - Pushdown Processes: Parallel Composition and Model Checking
CONCUR '94: Concurrency Theory, 1994Co-Authors: Olaf Burkart, Bernhard SteffenAbstract:In this paper, we consider a strict generalization of context-free processes, the pushdown processes, which are particularly interesting for three reasons: First, in contrast to context-free processes that do not support the construction of distributed systems, they are closed under Parallel Composition with finite state systems. Second, they are the smallest extension of context-free processes allowing Parallel Composition with finite state processes. Third, they can be model checked by means of an elegant adaptation to pushdown automata of the second order model checker introduced in [BuS92]. As arbitrary Parallel Composition between context-free processes provides Turing power, and therefore destroys every hope for automatic verification, pushdown processes can be considered as the appropriate generalization of context-free processes for frameworks for automatic verification.
Olaf Burkart - One of the best experts on this subject based on the ideXlab platform.
-
Composition, deComposition and model checking of pushdown processes
Nordic Journal of Computing, 1995Co-Authors: Olaf Burkart, Bernhard SteffenAbstract:In this paper, we consider a strict generalization of context-free processes, the pushdown processes, which are particularly interesting for three reasons: First, they are closed under Parallel Composition with finite state systems. This is shown by proving a new expansion theorem, whose implied 'representation explosion' is no worse than for finite state systems. Second, they axe the smallest extension of context-free processes allowing Parallel Composition with finite state processes, which we prove by showing that every pushdown process is bisimilar to a (relabelled) Parallel Composition of a context-free process (namely a stack) with some finite process. Third, they can be model checked by means of an elegant adaptation to pushdown automata of the second order model checker known for context-free processes. As arbitrary Parallel Composition between context-free processes provides Turing power, and therefore destroys every hope for automatic verification, pushdown processes can be considered as the appropriate generalization of context-free processes for frameworks for automatic verification.
-
pushdown processes Parallel Composition and model checking
International Conference on Concurrency Theory, 1994Co-Authors: Olaf Burkart, Bernhard SteffenAbstract:In this paper, we consider a strict generalization of context-free processes, the pushdown processes, which are particularly interesting for three reasons: First, in contrast to context-free processes that do not support the construction of distributed systems, they are closed under Parallel Composition with finite state systems. Second, they are the smallest extension of context-free processes allowing Parallel Composition with finite state processes. Third, they can be model checked by means of an elegant adaptation to pushdown automata of the second order model checker introduced in [BuS92]. As arbitrary Parallel Composition between context-free processes provides Turing power, and therefore destroys every hope for automatic verification, pushdown processes can be considered as the appropriate generalization of context-free processes for frameworks for automatic verification.
-
CONCUR - Pushdown Processes: Parallel Composition and Model Checking
CONCUR '94: Concurrency Theory, 1994Co-Authors: Olaf Burkart, Bernhard SteffenAbstract:In this paper, we consider a strict generalization of context-free processes, the pushdown processes, which are particularly interesting for three reasons: First, in contrast to context-free processes that do not support the construction of distributed systems, they are closed under Parallel Composition with finite state systems. Second, they are the smallest extension of context-free processes allowing Parallel Composition with finite state processes. Third, they can be model checked by means of an elegant adaptation to pushdown automata of the second order model checker introduced in [BuS92]. As arbitrary Parallel Composition between context-free processes provides Turing power, and therefore destroys every hope for automatic verification, pushdown processes can be considered as the appropriate generalization of context-free processes for frameworks for automatic verification.
Joseph Boudou - One of the best experts on this subject based on the ideXlab platform.
-
iteration free pdl with storing recovering and Parallel Composition a complete axiomatization
Journal of Logic and Computation, 2018Co-Authors: Philippe Balbiani, Joseph BoudouAbstract:We devote this paper to the axiomatization/completeness of PRSPDL0 - a variant of iteration-free PDL with Parallel Composition. Our results are based on the following: although the program operation of Parallel Composition is not modally definable in the ordinary language of PDL, it becomes definable in a modal language strengthened by the introduction of propositional quantifiers. Instead of using axioms to define the program operation of Parallel Composition in the language of PDL enlarged with propositional quantifiers, we add an unorthodox rule of proof that makes the canonical model standard for the program operation of Parallel Composition and we use large programs for the proof of the Truth Lemma.
-
IJCAR - Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition
Automated Reasoning, 2016Co-Authors: Joseph BoudouAbstract:PPDL det extends propositional dynamic logic PDL with Parallel Composition of programs. This new construct has separation semantics: to execute the Parallel program $$\alpha \,||\,\beta $$ the initial state is separated into two substates and the programs $$\alpha $$ and $$\beta $$ are executed on these substates. By adapting the elimination of Hintikka sets procedure, we provide a decision procedure for the satisfiability problem of PPDL det. We prove that this decision procedure can be executed in deterministic exponential time, hence that the satisfiability problem of PPDL det is EXPTIME-complete.
-
exponential size model property for pdl with separating Parallel Composition
Mathematical Foundations of Computer Science, 2015Co-Authors: Joseph BoudouAbstract:Propositional dynamic logic is extended with a Parallel program having a separating semantic: the program \((\alpha \Parallel \beta )\) executes \(\alpha \) and \(\beta \) on two substates of the current state. We prove that when the Composition of two substates is deterministic, the logic has the exponential-size model property. The proof is by a piecewise filtration using an adaptation of the Fischer-Ladner closure. We conclude that the satisfiability of the logic is decidable in NEXPTIME.
-
tableaux methods for propositional dynamic logics with separating Parallel Composition
Conference on Automated Deduction, 2015Co-Authors: Philippe Balbiani, Joseph BoudouAbstract:PRSPDL is a propositional dynamic logic with an operator for Parallel Compositions of programs. We first give a complexity upper bound for this logic. Then we focus on the class of \(\vartriangleleft \)-deterministic frames and give tableaux methods for two fragments of PRSPDL over this class of frames.
Ekaterina Shirokova - One of the best experts on this subject based on the ideXlab platform.
-
EWDTS - Checking Robustness of Web Services Based on the Parallel Composition of Partial Timed Finite State Machines
2018 IEEE East-West Design & Test Symposium (EWDTS), 2018Co-Authors: Ekaterina ShirokovaAbstract:In this paper, we discuss how the robustness of the web service can be checked using the Parallel Composition of partial timed finite state machines. We propose a technique for checking this property. In fact, we check whether there are no deadlocks in the Composition. If deadlocks can happen, then we propose ways to solve this problem. We also discuss selecting the server implementation that can robustly work with the given client application.
-
Checking Robustness of Web Services Based on the Parallel Composition of Partial Timed Finite State Machines
2018 IEEE East-West Design & Test Symposium (EWDTS), 2018Co-Authors: Ekaterina ShirokovaAbstract:In this paper, we discuss how the robustness of the web service can be checked using the Parallel Composition of partial timed finite state machines. We propose a technique for checking this property. In fact, we check whether there are no deadlocks in the Composition. If deadlocks can happen, then we propose ways to solve this problem. We also discuss selecting the server implementation that can robustly work with the given client application.
