Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ICLP

2003

Springer

2003

Springer

Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a ﬁrst-order linear-temporal logic (LTL) for expressing process speciﬁcations. A typical behavioral observation in ccp is the strongest postcondition (sp). The ntcc sp denotes the set of all inﬁnite output sequences that a given process can exhibit. The veriﬁcation problem is then whether the sequences in the sp of a given process satisfy a given ntcc LTL formula. This paper presents new positive decidability results for timed ccp as well as for LTL. In particular, we shall prove that the following problems are decidable: (1) The sp equivalence for the so-called locally-independent ntcc fragment; unlike other fragments for which similar results have been published, this fragment can specify inﬁnite-state systems. (2) Veriﬁcation for locally-independent processes and negation-free ﬁrst-order formulae of the ntcc LTL. (3) Implication for such formulae. (4) Satisﬁabili...

Related Content

Added |
07 Jul 2010 |

Updated |
07 Jul 2010 |

Type |
Conference |

Year |
2003 |

Where |
ICLP |

Authors |
Frank D. Valencia |

Comments (0)