On Testing P Systems

作者: Marian Gheorghe , Florentin Ipate

DOI: 10.1007/978-3-540-95885-7_15

关键词: Finite-state machineModel-based testingSimple (abstract algebra)Computer scienceTheoretical computer scienceFormal grammarRule-based machine translationAlgorithm

摘要: This paper presents a basic framework to define testing strategies for some classes of P systems. Techniques based on grammars and finite state machines are developed criteria identified illustrated through simple examples.

参考文章(22)
José Ruiz, Pedro García, A Note on Minimal Cover-Automata for Finite Languages. Bulletin of The European Association for Theoretical Computer Science. ,vol. 83, pp. 193- 199 ,(2004)
Gheorghe Paun, Gabriel Ciobanu, Mario J. Pérez-Jiménez, Applications of Membrane Computing (Natural Computing Series) Springer-Verlag New York, Inc.. ,(2005)
J. Oncina, P. García, INFERRING REGULAR LANGUAGES IN POLYNOMIAL UPDATED TIME WORLD SCIENTIFIC. pp. 49- 61 ,(1992) , 10.1142/9789812797902_0004
Andrei Păun, Nicolae Sântean, Sheng Yu, An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages international conference on implementation and application of automata. pp. 243- 251 ,(2000) , 10.1007/3-540-44674-5_20
Florentin Ipate, W. M. L. Holcombe, Correct Systems: Building a Business Process Solution ,(1998)
Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Bořivoj Melichar, Pierre Peterlongo, Finding Common Motifs with Gaps Using Finite Automata Implementation and Application of Automata. ,vol. 4094, pp. 69- 77 ,(2006) , 10.1007/11812128_8
Heiko Körner, On minimizing cover automata for finite languages in O(n log n) time international conference on implementation and application of automata. pp. 117- 127 ,(2002) , 10.5555/1756384.1756397
Cezar Câmpeanu, Andrei Păun, Jason R. Smith, Incremental construction of minimal deterministic finite cover automata Theoretical Computer Science. ,vol. 363, pp. 135- 148 ,(2006) , 10.1016/J.TCS.2006.07.020
CEZAR CAMPEANU, ANDREI PAUN, SHENG YU, AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES International Journal of Foundations of Computer Science. ,vol. 13, pp. 83- 97 ,(2002) , 10.1142/S0129054102000960
E Mark Gold, Complexity of automaton identification from given data Information & Computation. ,vol. 37, pp. 302- 320 ,(1978) , 10.1016/S0019-9958(78)90562-4