Abs t r ac t . We present the foundations of an approach for exploiting the partial ordering of events ,in the verification of concurrent systems. The main objective of the approach is to avoid the state explosion that is due to the use of the standard interleaving semantics of concurrency. The approach has been applied successfully to the verification of complex hardware and software systems s...

Keywords A Note on Inequality Criteria absolute differentials ordering relative differentials ordering Lorenz ordering JEL classiication March 2001 The (ADO) and the (RDO) have been introduced as suitable alternative inequality criteria to (LO). We provide two new alternative proofs that ADO and RDO are sub-orderings of LO. Furthermore , we point out some paradoxical situationss, where these tw...

A convenient method for defining a quasi-ordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasi-orderings satisfying some desired traits. Unfortunately, a minimum in terms of set inclusion can be non-existent even when an intuitive “minimum” exists. We suggest an alternative to set inclusion, called “leanness”, show that leanness is a parti...

We propose a probabilistic generative model for unsupervised semantic role induction, which integrates local role assignment decisions and a global role ordering decision in a unified model. The role sequence is divided into intervals based on the notion of primary roles, and each interval generates a sequence of secondary roles and syntactic constituents using local features. The global role o...

Timestamping is a common method of totally ordering events in concurrent programs. However, for applications requiring access to the global state, a total ordering is inappropriate. This paper presents algorithms for timestamping events in both synchronous and asynchronous n1essage-passing programs that allow for access to the partial ordering inherent in a parallel system. The algorithms do no...

Résumé We give an axiomatization of Recursive Path Orders in the Calculus of Inductive Constructions. Then, we show that they are monotonic strict partial orders, and that they are well-founded. The proof of the well-foundedness is particularly short and elementary. Finally, we produce three relations that are proved to model the axiomatization: the Multiset Path Ordering, the Lexicographic Pat...

Scenario based requirements specifications are the industry norm for defining communication protocols. Basic scenarios captured as UML sequence diagrams, Message Sequence Charts (MSCs) or Live Sequence Charts (LSC) have partial order semantics that characterize system traces by restricting the possible order of events within those traces. The semantic partial order of the scenario specification...