Monodirectional P Systems

We investigate the in uence that the ow of information in membrane systems has on their computational complexity. In particular, we analyse the behaviour of P systems with active membranes where communication only happens from a membrane towards its parent, and never in the opposite direction. We prove that these \monodirectional P systems" are, when working in polynomial time and under standard complexity-theoretic assumptions, much less powerful than unrestricted ones: indeed, they characterise classes of problems de ned by polynomial-time Turing machines with NP oracles, rather than the whole class PSPACE of problems solvable in polynomial space

Simulating counting oracles with cooperation

We prove that monodirectional shallow chargeless P systems with active membranes and minimal cooperation working in polynomial time precisely characterise P#P k , the complexity class of problems solved in polynomial time by deterministic Turing machines with a polynomial number of parallel queries to an oracle for a counting problem

Dynamic Characterization of the Crew Module Uprighting System for NASAs Orion Crew Module

The Orion Crew Module Uprighting System is a set of five airbag that are responsible for the uprighting of the crew module in the case of an inverted splashdown. A series of tests during the Underway Recovery Test 7 (URT-7) were run in preparation for the Artemis I mission, where the dynamic characterization of the CMUS in an ocean wave environment was performed. A Datawell Waverider DWR-G4 wave buoy was deployed to the characterize the wave environment during these tests. The heave measurements from this buoy were projected to the Orion Crew Module Buoyancy Test Article location by two different methods: (1) directly time-shifting the data, and (2) performing a frequency-domain, phase-shifting operation. Results demonstrate that the phase-shifting operation led to better correlation with the true crew module response to wave excitation as compared with the purely time-shifted method. Additionally, a novel approach to localize an object in a bidirectional wave field based on its heave response is presented and validated with URT- 7 data. Given a wave measurement device at a known location, one can estimate the relative distance to another object based solely off its heave response. Results show that if signals have sufficiently good correlation, this method can be used to estimate the relative separation between two objects in the same wave field

Characterizing PSPACE with Shallow Non-Confluent P Systems

In P systems with active membranes, the question of understanding the power of non-confluence within a polynomial time bound is still an open problem. It is known that, for shallow P systems, that is, with only one level of nesting, non-con uence allows them to solve conjecturally harder problems than con uent P systems, thus reaching PSPACE. Here we show that PSPACE is not only a bound, but actually an exact characterization. Therefore, the power endowed by non-con uence to shallow P systems is equal to the power gained by con uent P systems when non-elementary membrane division and polynomial depth are allowed, thus suggesting a connection between the roles of non-confluence and nesting depth

Characterizing PSPACE with Shallow Non-Confluent P Systems

In P systems with active membranes, the question of understanding the power of non-confluence within a polynomial time bound is still an open problem. It is known that, for shallow P systems, that is, with only one level of nesting, non-con uence allows them to solve conjecturally harder problems than con uent P systems, thus reaching PSPACE. Here we show that PSPACE is not only a bound, but actually an exact characterization. Therefore, the power endowed by non-con uence to shallow P systems is equal to the power gained by con uent P systems when non-elementary membrane division and polynomial depth are allowed, thus suggesting a connection between the roles of non-confluence and nesting depth

Subroutines in P Systems and Closure Properties of Their Complexity Classes

The literature on membrane computing describes several variants of P systems whose complexity classes C are "closed under exponentiation", that is, they satisfy the inclusion PC C, where PC is the class of problems solved by polynomial-time Turing machines with oracles for problems in C. This closure automatically implies closure under many other operations, such as regular operations (union, concatenation, Kleene star), intersection, complement, and polynomial-time mappings, which are inherited from P. Such results are typically proved by showing how elements of a family of P systems can be embedded into P systems simulating Turing machines, which exploit the elements of as subroutines. Here we focus on the latter construction, abstracting from the technical details which depend on the speci c variant of P system, in order to describe a general strategy for proving closure under exponentiation