Counting solutions to Presburger formulas: how and why
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Specifying mode requirements of embedded systems
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Computer
Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Proceedings of the IFIP TC2/WG2.1 Working Conference on Generic Programming
Computation Calculus - Bridging a Formalization Gap
MPC '98 Proceedings of the Mathematics of Program Construction
Duration Calculus: A Formal Approach to Real-Time Systems (Monographs in Theoretical Computer Science. an Eatcs Seris)
Functional declarative language design and predicate calculus: a practical approach
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
A calculus for shapes in time and space
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Hi-index | 0.00 |
Case studies can significantly contribute towards improving the understanding of formalisms and thereby to their applicability in practice. One such case, namely a cascade of the familiar 24-hour timers (in suitably generalized form) provides interesting gedanken experiments and illustrations for presenting, illustrating and comparing various formalisms for modelling real-time behaviour of systems. The timer cascade is first modelled in a general-purpose functional formalism (Funmath) and various properties are derived, including an interesting algebraic monoid structure of timer programs. Then it is described and analyzed in duration calculus, thereby highlighting, similarities and differences in the approach to modelling and reasoning, and also the link between the formalisms. Future work consists in using this case as a running example for exploring the same issues for other formalisms intended for real time and hybrid systems. The underlying idea is that other authors join this effort and contribute towards extending it, finally arriving at a broad comparative survey of such formalisms.