On Testing P Systems

DOI10.1007/978-3-540-95885-7_15zbMath1196.68090OpenAlexW1582545188MaRDI QIDQ5191169

Florentin Ipate, Marian Gheorghe

Publication date: 28 July 2009

Published in: Membrane Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-95885-7_15

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)

Related Items (7)

Kernel P systems: from modelling to verification and testing ⋮ A model learning based testing approach for spiking neural P systems ⋮ A model learning based testing approach for kernel P systems ⋮ Kernel P Systems Modelling, Testing and Verification - Sorting Case Study ⋮ An empirical evaluation of P system testing techniques ⋮ Test generation from P systems using model checking ⋮ Testing based on identifiable P systems using cover automata and X-machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Incremental construction of minimal deterministic finite cover automata
• A rewriting logic framework for operational semantics of membrane systems
• Computing with membranes
• AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
• Complexity of automaton identification from given data
• A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
• Membrane Computing
• Minimal cover-automata for finite languages

This page was built for publication: On Testing P Systems