Artificial Intelligence
Modeling concurrency with partial orders
International Journal of Parallel Programming
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Petri net models for algebraic theories of concurrency
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Towards action-refinement in process algebras
Proceedings of the Fourth Annual Symposium on Logic in computer science
Concurrent constraint programming
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A fully abstract model for concurrent constraint programming
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
A fully abstract semantics for a first-order functional language with logic variables
ACM Transactions on Programming Languages and Systems (TOPLAS)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Concurrent constraint programming
Concurrent constraint programming
Proving concurrent constraint programs correct
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modular Construction and Partial Order Semantics of Petri Nets
Modular Construction and Partial Order Semantics of Petri Nets
A Theory of Process with Localities (Extended Abstract)
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Model-Based Computing: Using Concurrent Constraint Programming for Modeling and Model Compilation
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
A Causal Semantics for Timed Default Concurrent Constraint Programming
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
| Hi-index | 5.23 |
We study "causality" relationships in Concurrent Constraint Programming: what is observed is not just the conjunction of constraints deposited in the store, but also the causal dependencies between these constraints. We describe a denotational semantics for cc that is fully abstract with respect to observing this "causality" relation on constraints. This semantics preserves more fine-grained structure of computation; in particular the Interleaving Law is not verified ( is indeterminate choice). Relationships between such a denotational approach to true concurrency and different powerdomain constructions are explored.