Kernel P Systems Modelling, Testing and Verification - Sorting Case Study

DOI10.1007/978-3-319-54072-6_15zbMath1483.68118OpenAlexW2588402377MaRDI QIDQ2975916

Florentin Ipate, Savas Konur, Marian Gheorghe, Rodica Ceterchi

Publication date: 12 April 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-319-54072-6_15

Mathematics Subject Classification ID

Searching and sorting (68P10) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (1)

Spiking neural P systems: matrix representation and formal verification

Uses Software

• SPIN
• NuSMV

Cites Work

• Bounded sequence testing from deterministic finite state machines
• Computing with membranes
• Finite state based testing of P systems
• An Integrated Model Checking Toolset for Kernel P Systems
• A formalization of membrane systems with dynamically evolving structures
• 3-Col problem modelling using simple kernel P systems
• Testing Software Design Modeled by Finite-State Machines
• On Testing P Systems
• RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
• Simulating the Bitonic Sort Using P Systems
• A Formal Framework for Static (Tissue) P Systems
• Minimal cover-automata for finite languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Kernel P Systems Modelling, Testing and Verification - Sorting Case Study