Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same "AGEF" properties: temporal logic...
We provide an automata-theoretic solution to one of the main open questions about the UML standard, namely how to assign a formal semantics to a set of sequence diagrams without c...
We design and analyze a simple optimistic fair non-repudiation protocol. Our protocol is considerably simpler and more efficient than current proposals, due mainly to the avoidanc...
J. G. Cederquist, Ricardo Corin, Muhammad Torabi D...
Abstract. This paper aims at providing a rigorous definition of selforganization, one of the most desired properties for dynamic systems (e.g., peer-to-peer systems, sensor networ...