Treffer: Timed concurrent constraint programming: Decidability results and their application to LTL

Title:
Timed concurrent constraint programming: Decidability results and their application to LTL
Authors:
VALENCIA, Frank D
Source:
Logic programming (Mumbai, 9-13 December 2003)Lecture notes in computer science. :422-437
Publisher Information:
Berlin: Springer, 2003.
Publication Year:
2003
Physical Description:
print, 25 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Fonctions logiques, booléennes et de commutation, Logical, boolean and switching functions, Analyse comportementale, Behavioral analysis, Análisis conductual, Décidabilité, Decidability, Decidibilidad, 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 logique, Logical programming, Programación lógica, Satisfaisabilité, Satisfiability, Satisfactoriabilidad, Simultanéité informatique, Concurrency, Simultaneidad informatica, Spécification, Specification, Especificación, Système infini, Infinite system, Sistema infinito, Système réactif, Reactive system, Sistema reactivo, Programmation concurrente par contrainte, Concurrent constraint programming, Programación concurrrente con restricción
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Dept. of Information Technology, Uppsala University, Box 337, 751 05 Uppsala, Sweden
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=15758710
Rights:
Copyright 2004 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
Accession Number:
edscal.15758710
Database:
PASCAL Archive

Weitere Informationen

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.