Handbook of theoretical computer science (vol. B)
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Hardware Semantics Based on Temporal Intervals
Proceedings of the 10th Colloquium on Automata, Languages and Programming
An Adequate First Order Interval Logic
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
A Duration Calculus with Infinite Intervals
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Complete Proof Systems for First Order Interval Temporal Logic
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Duration Calculus: A Formal Approach to Real-Time Systems (Monographs in Theoretical Computer Science. an Eatcs Seris)
ACM Transactions on Computational Logic (TOCL)
Science of Computer Programming
Towards an algebra of hybrid systems
RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Semiring Neighbours: An Algebraic Embedding and Extension of Neighbourhood Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We extend an earlier algebraic approach to Neighbourhood Logic (NL) from domain semirings to lazy semi-rings yielding lazy semiring neighbours. Furthermore we show three important applications for these. The first one extends NL to intervals with infinite length. The second one applies lazy semiring neighbours in an algebraic semantics of the branching time temporal logic CTL*. The third one sets up a connection between hybrid systems and lazy semiring neighbours.