Abstract | ||
---|---|---|
P systems are the computational models introduced in the context of membrane computing, a computational paradigm within the more general area of unconventional computing. Kernel P (kP) systems are defined to unify the specification of different variants of P systems, motivated by challenging theoretical aspects and the need to model different problems. kP systems are supported by a software framework, called kPWORKBENCH, which integrates a set of related simulation and verification methodologies and tools. In this paper, we present an extension to kPWORKBENCH with a new model checking framework supporting the formal verification of kP system models. This framework supports both LTL and CTL properties. To make the property specification an easier task, we propose a property language, composed of natural language statements. We demonstrate our proposed methodology with an example. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1007/978-3-319-28475-0_11 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Kernel (linear algebra),Model checking,Unconventional computing,Computer science,Theoretical computer science,Computational model,Natural language,Membrane computing,Software framework,Formal verification | Conference | 9504 |
ISSN | Citations | PageRank |
0302-9743 | 3 | 0.40 |
References | Authors | |
13 | 6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Marian Gheorghe | 1 | 893 | 74.31 |
Savas Konur | 2 | 131 | 13.40 |
Florentin Ipate | 3 | 419 | 43.20 |
Laurentiu Mierla | 4 | 35 | 3.64 |
Mehmet E. Bakir | 5 | 12 | 3.77 |
Mike Stannett | 6 | 83 | 19.67 |