Result: Decidability of infinite-state timed CCP processes and first-order LTL

Title:
Decidability of infinite-state timed CCP processes and first-order LTL
Authors:
VALENCIA, Frank D
Source:
Expressiveness in ConcurrencyTheoretical computer science. 330(3):577-607
Publisher Information:
Amsterdam: Elsevier, 2005.
Publication Year:
2005
Physical Description:
print, 44 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Logique mathématique, fondements, théorie des ensembles, Mathematical logic, foundations, set theory, Logique et fondements, Logic and foundations, Logique générale, General logic, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Théorie programmation, Programming theory, Décidabilité, Decidability, Decidibilidad, Informatique théorique, Computer theory, Informática teórica, Logique linéaire, Linear logic, Lógica lineal, Logique ordre 1, First order logic, Lógica orden 1, Logique temporelle, Temporal logic, Lógica temporal, Programmation concurrente par contrainte, Concurrent constraint programming, Programación concurrrente con restricción, Satisfiabilité, Satisfiability, Satisfactibilidad, Simultanéité informatique, Concurrency, Simultaneidad informatica, Système infini, Infinite system, Sistema infinito, Système temporisé, Timed system, Sistema temporizado, Vérification, Verification, Verificación, 03B44, 03B47, 68N19, 68Q60, 68Q85, Calcul processus, Process calculus, Concurrence
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
CNRS, LIX Ecole Polytechnique de Paris, Rue de Saclay, 91128 Palaiseau, France
ISSN:
0304-3975
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=16531113
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Mathematics
Accession Number:
edscal.16531113
Database:
PASCAL Archive

Further Information

The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifications. A typical behavioral observation in ccp is the strongest postcondition (sp). The ntcc sp denotes the set of all infinite output sequences that a given process can exhibit. The verification 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 infinite-state systems, (2) verification for locally-independent processes and negation-free first-order formulae of the ntcc LTL, (3) implication for such formulae, (4) Satisfiability for a first-order fragment of Manna and Pnueli's LTL. The purpose of the last result is to illustrate the applicability of ccp to well-established formalisms for concurrency.