The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Alternating automata on infinite trees
Theoretical Computer Science
Communication and concurrency
Theoretical Computer Science
The family of concurrent logic programming languages
ACM Computing Surveys (CSUR)
Kernel Andorra Prolog and its computation model
Logic programming
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
Concurrent constraint programming
Concurrent constraint programming
Default timed concurrent constraint programming
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Nondeterminism and infinite computations in constraint programming
Selected papers of the workshop on Topology and completion in semantics
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Timed default concurrent constraint programming
Journal of Symbolic Computation - Special issue: executable temporal logics
Proving concurrent constraint programs correct
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing with continuous change
Science of Computer Programming - Special issue on concurrent constraint programming
Stochastic processes as concurrent constraint programs
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Distributed concurrent constraint programming
Fundamenta Informaticae - Special issue on foundations of constraint programming
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
A timed concurrent constraint language
Information and Computation
On the expressive power of temporal concurrent constraint programming languages
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Temporal concurrent constraint programming: denotation, logic and applications
Nordic Journal of Computing
Temporal Concurrent Constraint Programming: Applications and Behavior
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
A Temporal Concurrent Constraint Programming Calculus
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Synchronous Programming of Reactive Systems
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Model Checking LTL Using Constraint Programming
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Timed Concurrent Constraint Programming for Analysing Biological Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A Framework for Timed Concurrent Constraint Programming with External Functions
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
An Overview of FORCES: An INRIA Project on Declarative Formalisms for Emergent Systems
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A declarative framework for security: secure concurrent constraint programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
| Hi-index | 0.00 |
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.