On model-checking of p systems

Authors:
Zhe Dang;Oscar H. Ibarra;Cheng Li;Gaoyan Xie
Affiliations:
School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA;Department of Computer Science, University of California, Santa Barbara, CA;School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA;School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA
Venue:
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Year:
2005

Citing 11
Cited 4

Automatic verification of finite-state concurrent systems using temporal logic specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
A practical algorithm for exact array dependence analysis

Communications of the ACM
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results

ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking

Model checking
Computing with membranes

Journal of Computer and System Sciences
Membrane Computing: An Introduction

Membrane Computing: An Introduction
A guide to membrane computing

Theoretical Computer Science - Natural computing
P Systems without Priorities Are Computationally Universal

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Computationally universal P systems without priorities: two catalysts are sufficient

Theoretical Computer Science - Descriptional complexity of formal systems
Executable specifications of p systems

WMC'04 Proceedings of the 5th international conference on Membrane Computing

On the Qualitative Analysis of Conformon P Systems

Membrane Computing
On the decidability of model-checking for P systems

Journal of Automata, Languages and Combinatorics
On bounded symport/antiport P systems

DNA'05 Proceedings of the 11th international conference on DNA Computing
Formal verification of p systems with active membranes through model checking

CMC'11 Proceedings of the 12th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computing model, namely a P system, from natural phenomena of cell evolutions and chemical reactions. Because of the nature of maximal parallelism inherent in the model, P systems have a great potential for implementing massively concurrent systems in an efficient way that would allow us to solve currently intractable problems. In this paper, we look at various models of P systems and investigate their model-checking problems. We identify what is decidable (or undecidable) about model-checking these systems under extended logic formalisms of CTL. We also report on some experiments on whether existing conservative (symbolic) model-checking techniques can be practically applied to handle P systems with a reasonable size.