2003
DOI: 10.1007/3-540-36490-0_2
|View full text |Cite
|
Sign up to set email alerts
|

A Software Simulation of Transition P Systems in Haskell

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
17
0
1

Year Published

2004
2004
2013
2013

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 19 publications
(18 citation statements)
references
References 1 publication
0
17
0
1
Order By: Relevance
“…Each membrane determines a region that encloses a multiset of objects and evolution rules. There are some published deals with parallel implementation of membrane systems ( [7], [8], [9]) and Hardware implementations ( [10], [11]), and software simulations ( [12], [13]). These systems perform its computations through transformation between two consecutive configurations (same as Turing machines model).…”
Section: P Systems Theorymentioning
confidence: 99%
“…Each membrane determines a region that encloses a multiset of objects and evolution rules. There are some published deals with parallel implementation of membrane systems ( [7], [8], [9]) and Hardware implementations ( [10], [11]), and software simulations ( [12], [13]). These systems perform its computations through transformation between two consecutive configurations (same as Turing machines model).…”
Section: P Systems Theorymentioning
confidence: 99%
“…According to this, the investigations are based on the idea of the imitation of the procedures that take place in Nature, and their application to machines, can lead to discover and to develop new computation models which will give place to a new generation of intelligent computers. There are many papers about software tools implementing different Psystem variants [4], [5] and [6]. However, they are very interesting in order to define hardware implementation of these kinds of systems.…”
Section: Theoretical Preliminaries On P-systemsmentioning
confidence: 99%
“…* 2 The Prolog simulator provides the facilities to build automatically the initial configuration and the set of rules for any instance of the SAT problem. Used rules in the step 0: [1] In this step only the first rule has been applied. We follow the evolution.…”
Section: The Prolog Representation Of This Initial Configuration Ismentioning
confidence: 99%
“…p1 :: e1 ec 0 at [] with [d6, d6, d6, d6] at_time 9 p1 :: e2 ec 1 at [1] with [r1_4, r2_4, r1_4, c1] at_time 9 p1 :: e2 ec 1 at [2] with [r1_4, c1] at_time 9 p1 :: e2 ec 1 at [3] with [r2_4, c1] at_time 9 p1 :: e2 ec 1 at [4] with [r1_4, r2_4, r2_4, c1] at_time 9 The synchronization stage has ended. In the next step the checking stage begins; it ends at time 13 (that is, 5n − 1 + 2m) when the element d10 appears in the skin region.…”
Section: The Prolog Representation Of This Initial Configuration Ismentioning
confidence: 99%
See 1 more Smart Citation