The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Communication and concurrency
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
Concurrent constraint programming
Concurrent constraint programming
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)
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
A timed concurrent constraint language
Information and Computation
A logical view of concurrent constraint programming
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]
Operational and Compositional Semantics of Synchronous Automaton Compositions
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
A Temporal Concurrent Constraint Programming Calculus
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Decidability of infinite-state timed CCP processes and first-order LTL
Theoretical Computer Science - Expressiveness in concurrency
On the expressiveness of timed coordination models
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
On the Expressiveness of Timed Coordination via Shared Dataspaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
On the expressive power of recursion, replication and iteration in process calculi
Mathematical Structures in Computer Science
Replication vs. recursive definitions in channel based calculi
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
CC-Pi: a constraint-based language for specifying service level agreements
ESOP'07 Proceedings of the 16th European conference on Programming
On recursion, replication and scope mechanisms in process calculi
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
CCS with replication in the Chomsky hierarchy: the expressive power of divergence
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Concurrent and reactive constraint programming
A 25-year perspective on logic programming
On the expressiveness and decidability of higher-order process calculi
Information and Computation
Bridging the gap between two concurrent constraint languages
WFLP'10 Proceedings of the 19th international conference on Functional and constraint logic programming
| Hi-index | 0.00 |
The tcc paradigm is a formalism for timed concurrent constraint programming. Several tcc languages differing in their way of expressing infinite behavior have been proposed in the literature. In this paper we study the expressive power of some of these languages. In particular, we show that: (1) recursive procedures with parameters can be encoded into parameterless recursive procedures with dynamic scoping, and viceversa. (2) replication can be encoded into parameterless recursive procedures with static scoping, and viceversa. (3) the languages from (1) are strictly more expressive than the languages from (2). Furthermore, we show that behavioral equivalence is undecidable for the languages from (1), but decidable for the languages from (2). The undecidability result holds even if the process variables take values from a fixed finite domain.