Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
Concurrent constraint programming
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Specifying real-time properties with metric temporal logic
Real-Time Systems
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 temporal calculus of communicating systems
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
Transition system specifications with negative premises
Theoretical Computer Science
A process algebra for timed systems
Information and Computation
Timing and causality in process algebra
Acta Informatica
Timed default concurrent constraint programming
Journal of Symbolic Computation - Special issue: executable temporal logics
A process algebra of communicating shared resources with dense time and priorities
Theoretical Computer Science
A process algebraic view of Linda coordination primitives
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
A model and proof system for asynchronous networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Linda-based applicative and imperative process algebras
Theoretical Computer Science
A timed concurrent constraint language
Information and Computation
The Failure of Failures in a Paradigm for Asynchronous Communication
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Modeling Coordination via Asynchronous Communication
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
Selected Papers from Constraint Programming: Basics and Trends
On Blocks: Locality and Asynchronous Communication (Extended Abstract)
Proceedings of the REX Workshop on Sematics: Foundations and Applications
IBM Systems Journal
Proving Correctness of Timed Concurrent Constraint Programs
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
A Timed Linda Language and its Denotational Semantics
Fundamenta Informaticae
Towards a real-time coordination model for mobile computing
Proceedings of the 12th Monterey conference on Reliable systems on unreliable networked platforms
Compositional verification of asynchronous processes via constraint solving
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A Timed Linda Language and its Denotational Semantics
Fundamenta Informaticae
| Hi-index | 0.00 |
In [5] we introduced a Timed Linda language (T-Linda) whic hwas obtained by a natural timed interpretation of the usual constructs of the Linda model and by including a simple primitive for specifying time-outs. Here we define a denotational model for T-Linda which is based on timed reactive sequences. The correctness of this model is proved w.r.t a notion of observ ables which include finite traces of actions and input/output pairs.