Journal article

Cycle detection in computation tree logic

Abstract:: We introduce Cycle-CTL, an extension of CTL with cycle quantifications that are able to predicate over cycles. The introduced logic turns out to be very expressive. Indeed, we prove that it strictly extends CTL and is orthogonal to μCalculus. We also give an evidence of its usefulness by providing few examples involving non-regular properties. We extensively investigate both the model-checking and satisfiability problems for Cycle-CTL and some of its variants/fragments.

Publication status:: Published

Peer review status:: Peer reviewed

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Fontaine, G., Mogavero, F., Murano, A., Perelli, G., & Sorrentino, L. (2018). Cycle detection in computation tree logic. Information and Computation, 262(2), 265–279.

MLA Style

Fontaine, G., et al. “Cycle Detection in Computation Tree Logic.” Information and Computation, vol. 262, no. 2, Elsevier, 2018, pp. 265–79.

Chicago Style

Fontaine, G, F Mogavero, A Murano, G Perelli, and L Sorrentino. 2018. “Cycle Detection in Computation Tree Logic.” Information and Computation 262 (2): 265–79.
Share
Print

Access Document

Files:: Article.pdf

(Preview, Accepted manuscript, pdf, 391.5KB, Terms of use)

Publisher copy:: 10.1016/j.ic.2018.09.007

Authors

+ Fontaine, G More by this author

Role:: Author

+ Mogavero, F More by this author

Role:: Author

+ Murano, A More by this author

Role:: Author

+ Perelli, G More by this author

Institution:: University of Oxford
Division:: MPLS
Department:: Computer Science
Role:: Author

+ Sorrentino, L More by this author

Role:: Author

+ European Research Council More from this funder

Funding agency for:: Perelli, G
Grant:: Advanced Grant 291528 (“Race”

Publisher:: Elsevier
Journal:: Information and Computation More from this journal
Volume:: 262
Issue:: 2
Pages:: 265-279
Publication date:: 2018-09-06
Acceptance date:: 2018-01-15
DOI:: 10.1016/j.ic.2018.09.007
ISSN:: 0890-5401

Keywords:: satisfiability

verification

temporal logic

model checking
Pubs id:: pubs:842345
UUID:: uuid:2bf455a1-20f9-4c1b-bc38-dcc6f3a632a8
Local pid:: pubs:842345
Source identifiers:: 842345
Deposit date:: 2018-04-20

Terms of use

Copyright holder:: Elsevier Inc
Copyright date:: 2018
Notes:: Copyright © 2018 Elsevier Inc. This is the accepted manuscript version of the article. The final version is available online from Elsevier at: https://doi.org/10.1016/j.ic.2018.09.007

Licence:: CC Attribution-NonCommercial-NoDerivatives (CC BY-NC-ND)

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP