Model Checking Temporal Logic Formulas Using Sticker Automata.
As an important complex problem, the temporal logic model checking problem is still far from being fully resolved under the circumstance of DNA computing, especially Computation Tree Logic (CTL), Interval Temporal Logic (ITL), and Projection Temporal Logic (PTL), because there is still a lack of app...
| Published in: | BioMed Research International Vol. 2017; pp. 1 - 34 |
|---|---|
| Main Authors: | , , |
| Format: | algorithm equations & formulas pictorial research tables/charts Journal Article |
| Published: |
Wiley-Blackwell
9/28/2017
|
| Online Access: | View this record in EBSCOhost |