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

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...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 330; no. 3; pp. 577 - 607
Main Author:	Valencia, Frank D.
Format:	Journal Article Conference Proceeding
Language:	English
Published:	Amsterdam Elsevier B.V 09.02.2005 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Decidability Exact sciences and technology First-order LTL General logic Infinite-state systems Logic and foundations Mathematical logic, foundations, set theory Mathematics Process calculi Programming theory Sciences and techniques of general use Temporal logic Theoretical computing Timed concurrent constraint programming Timed concurrent constraint programming First-order LTL Decidability Temporal logic Infinite-state systems Process calculi Concurrent constraint programming Linear logic Computer theory First order logic Concurrency Verification Infinite system Timed system Satisfiability Process calculus
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!