Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
Pattern analysis consists in determining the shape of the set of solutions of the constraint store at some program points. Our basic claim is that pattern analyses can all be desc...
An operational and a denotational semantic model are presented for a real-time programming language incorporating the concept of integration. This concept of integration, which ha...
The paper presents sufficient conditions for modular (supervisory) control synthesis to equal global control synthesis. In modular control synthesis a supervisory control is synth...
Jan Komenda, Jan H. van Schuppen, Benoit Gaudin, H...
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...