Towards a general theory of action and time
Artificial Intelligence
The mutual exclusion problem: part I—a theory of interprocess communication
Journal of the ACM (JACM)
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
The logical basis for computer programming: vol. 2, deductive systems
The logical basis for computer programming: vol. 2, deductive systems
Synthesis of Communicating Processes from Temporal Logic Specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Maintaining knowledge about temporal intervals
Communications of the ACM
ICSE '87 Proceedings of the 9th international conference on Software Engineering
On the Specification and Synthesis of Communicating Processes
IEEE Transactions on Software Engineering
An Insider's Evaluation of PAISLey
IEEE Transactions on Software Engineering
Real-time specification and modeling with joint actions
IWSSD '91 Proceedings of the 6th international workshop on Software specification and design
The completeness of a natural system for reasoning with time intervals
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
Models of axioms for time intervals
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Models of axioms for time intervals
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Hi-index | 0.00 |
There is a need to incorporate reasoning about time dependencies into program synthesis systems. Such dependencies have often been phrased in terms of temporal logic systems. We present an alternative method of specifying time dependencies, in a calculus of binary relations between time intervals [Lad86.1, Lad86.2]. We show how the interval calculus may be used to give very-high-level specifications of concurrent process protocols, and how these specifications may be automatically refined using interval calculus into a target specification language. We indicate how the target language may be executed, under certain sequencing assumptions.