A logical approach to discrete math
A logical approach to discrete math
Systems, models and measures
Relational methods in computer science
Fork algebras in algebra, logic and computer science
Fundamenta Informaticae
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
A Mathematical Toolbox for the Software Architec
IWSSD '96 Proceedings of the 8th International Workshop on Software Specification and Design
Specifying and Verifying Business Processes Using PPML
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
An overview of the mensurae language: specifying business processes
ROOM'00 Proceedings of the 2000 international conference on Rigorous Object-Oriented Methods
Hi-index | 0.00 |
We present a logic for real time systems specification which is an extension of first order dynamic logic by adding (a) arbitrary atomic actions rather than only assignments, (b) variables over actions which allow to specify systems partially, and (c) explicit time. The logic is algebraized using closure fork algebras and a representation theorem for this class is presented. This allows to define an equational (but infinitary) proof system for the algebraization.