Cargando…
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...
Autores principales: | Zhu, Weijun, Feng, Changwei, Wu, Huanmei |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5651143/ https://www.ncbi.nlm.nih.gov/pubmed/29119114 http://dx.doi.org/10.1155/2017/7941845 |
Ejemplares similares
-
Action-Based Model Checking: Logic, Automata, and Reduction
por: Siegel, Stephen F., et al.
Publicado: (2020) -
Bounded Model Checking for Metric Temporal Logic Properties of Timed Automata with Digital Clocks †
por: Zbrzezny, Agnieszka M., et al.
Publicado: (2022) -
Logic automata and algorithms
por: Ajzerman, Mark A, et al.
Publicado: (1971) -
Logic and Automata: History and Perspectives
por: Flum, Jorg, et al.
Publicado: (2007) -
CERN stickers
por: Mobs, Esma
Publicado: (2017)