Signaling P systems and verification problems

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 1462-1473

  Li, Cheng ^a   Dang, Zhe ^a   Ibarra, Oscar H ^b   Yen, Hsu Chun ^c  

^a Washington State University   (United States)

^b University of California   (United States)

^c NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CELLS; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBLEM SOLVING; SIGNALING;

COMPUTING SYSTEMS; NON-COOPERATIVE P SYSTEMS; SIGNALING SYSTEMS;

COMPUTER SCIENCE;

EID: 26444487339     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_118     Document Type: Conference Paper

References (22)

1. R. Alur and D. L. Dill. A theory of timed automata. TCS, 126(2):183-235, April 1994.
2. Ioan I. Ardelean, Matteo Cavaliere, and Dragos Sburlan. Computing using signals: From cells to P Systems. In Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February 2-7 2004, pages 60-73, Sevilla, Spain, February 2-7 2004.
3. W. M. Becker, L. J. Kleinsmith, and J. Hardin. The World of the Cell (5th Edition). Benjamin Cummings (San Francisco), 2003.
4. P. Bottoni, C. Martin-Vide, Gh. Paun, and G. Rozenberg. Membrane systems with promoters/inhibitors. Acta Informatica, 38(10):695-720, 2002.
5. T. Bultan, R. Gerber, and W. Pugh. Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results. TOPLAS, 21(4):747-789, 1999.
6. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. TOPLAS, 8(2):244-263, April 1986.
7. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999.
8. Z. Dang, O. H. Ibarra, C. Li, and G. Xie. On model-checking of P systems. 2005 (submitted).
9. Javier Esparza. Decidability and complexity of Petri net problems - an introduction. In Petri Nets, pages 374-428, 1996.
10. R. Freund, L. Kari, M. Oswald, and P. Sosik. Computationally universal P systems without priorities: two catalysts are sufficient. Available at http://psystems.disco.unimib.it, 2003.
11. R. Freund and Gh. Paun. On deterministic P systems. Available at http://psystems. disco.unimib.it. 2003.
12. O. H. Ibarra. The number of membranes matters. In WMC'03, volume 2933 of Lecture Notes in Computer Science, pages 218-231, Springer, 2004.
13. O. H. Ibarra, Z. Dang, and O. Egecioglu. Catalytic P systems, semilinear sets, and vector addition systems. Theoretical Computer Science, 312(2-3):379-399, 2004.
14. O. H. Ibarra, H. Yen, and Z. Dang. The power of maximal parallelism in P systems. In DLT'04, volume 3340 of Lecture Notes in Computer Science, pages 212-224, Springer, 2004.
15. M. Ito, C. Martin-Vide, and Gh. Paun. A characterization of Parikh sets of ETOL languages in terms of P systems. In Words, Semigroups, and Transducers, pages 239-254. World Scientific.
16. C. Martin-Vide and Gh. Paun. Computing with membranes (P systems): universality results. In MCU'01, volume 2055 of LNCS, pages 82-101. Springer, 2001.
17. Y. V. Matiyasevich. Hubert's Tenth Problem. MIT Press, 1993.
18. Gh. Paun. Computing with membranes. JCSS, 61(1):108-143, 2000.
19. Gh. Paun. Membrane Computing: An Introduction. Springer, 2002.
20. Gh. Paun and G. Rozenberg. A guide to membrane computing. TCS, 287(1):73-100, 2002.
21. P. Sosik. P systems versus register machines: two universality proofs. In WMC'02, volume 2597 of LNCS, pages 371-382, Springer, 2003.
22. P. Sosik and R. Freund. P systems without priorities are computationally universal. In WMC'02, volume 2597 of LNCS, pages 400-409. Springer, 2003.