Pages that link to "Item:Q1982961"
From MaRDI portal
The following pages link to Formal verification of cP systems using PAT3 and ProB (Q1982961):
Displaying 13 items.
- Verification of \(\mathrm{EB}^3\) specifications using CADP (Q282110) (← links)
- A sublinear Sudoku solution in cP systems and its formal verification (Q821319) (← links)
- An introduction to \(\mathrm{cP}\) systems (Q1709914) (← links)
- Solving a PSPACE-complete problem with cP systems (Q1982985) (← links)
- Implementation of RSA cryptographic algorithm using SN P systems based on HP/LP neurons (Q1983001) (← links)
- Formal verification of cP systems using Coq (Q2152300) (← links)
- Spiking neural P systems with a flat maximally parallel use of rules (Q2152302) (← links)
- (Q2984655) (← links)
- FORMAL VERIFICATION OF <font>P</font> SYSTEMS USING SPIN (Q3076605) (← links)
- (Q4037133) (← links)
- Sublinear P system solutions to NP-complete problems (Q6038691) (← links)
- Towards automated deduction in cP systems (Q6154793) (← links)
- Programmable and parallel water computing (Q6177125) (← links)