A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On Expressive Completeness of Duration and Mean Value Calculi (Extended Abstract)
1997
Electronical Notes in Theoretical Computer Science
This paper compares the expressive power of rst-order monadic logic of order, a fundamental formalism in mathematical logic and the theory of computation, with that of two formalisms for the speci cation of real-time systems, the propositional versions of duration and mean value calculi. Our results show that the propositional mean value calculus is expressively complete for monadic rst-order logic of order. A new semantics for the chop operator used in these real-time formalisms is also
doi:10.1016/s1571-0661(05)80476-1
fatcat:imuhell3zjatbjiuj5yfh5qmje