We are interested in implementing a fully automated software development process starting from sequence charts, which have proven their naturalness and usefulness in industry. We show in this paper that even for the simplest variants of sequence charts, there are strong impediments to the implementability of this dream. In the case of a manual development, we have to check the final implementat...

We refine CTLC, a temporal logic of social commitments that extends CTL to allow reasoning about commitments agents create when communicating and their fulfillment. We present axioms of commitments and their fulfillment and provide the associated BDD-based model checking algorithms. We also analyze the time complexity of CTLC model checking in explicit models (i.e., Kripke-like structures) and ...

Satisfying spin-assignments of triangulations of a surface are states of minimum energy of the antiferromagnetic Ising model on triangulations which correspond (via geometric duality) to perfect matchings in cubic bridgeless graphs. In this work we show that it is NP-complete to decide whether or not a triangulation of a surface admits a satisfying spinassignment, and that it is #P-complete to ...

Modeling the effects of robot interaction in multi-robot systems, i.e., the group dynamics, is difficult due to the complexity of such interactions. This article formalizes the concept of group dynamics in the framework of scheduling and presents a proof that multi-robot task allocation (MRTA), in systems with significant performance effects from group dynamics, is an N P-complete problem. As a...

We compare the complexities of the following two model checking problems: checking whether a linear-time formula is satis ed by all paths (which we call universal model checking) and checking whether a formula is satis ed by almost all paths (which we call fair model checking here). For many interesting classes of linear-time formulas, both problems have the same complexity: for instance, they ...

We study the model checking problem, for fixed structures A, over positive equality-free first-order logic – a natural generalisation of the non-uniform quantified constraint satisfaction problem QCSP(A). We prove a complete complexity classification for this problem when A ranges over 1.) boolean structures and 2.) digraphs of size (less than or equal to) three. The former class displays dicho...

Objective: To examine the impact of race and ethnicity on financial charges associated with radical cystectomy (RC). Methods: The Nationwide Inpatient Sample was used to identify patients who underwent RC between January 1 1998 and December 31 2010. The primary outcome was hospital charges adjusted for inflation. Multivariable analysis was performed using a fully-adjusted generalized linear mod...

We develop a timeout based extension of propositional linear temporal logic (which we call TLTL) to specify timing properties of timeout based models of real time systems. TLTL formulas explicitly refer to a running global clock together with static timing variables as well as a dynamic variable abstracting the timeout behavior. We extend LTL with the capability to express timeout constraints. ...

Module checking is a well investigated technique for verifying the correctness of open systems, which are systems characterized by an ongoing interaction with an external environment. In the classical module checking framework, in order to check whether an open system satisfies a required property, we first translate the entire system into an open model (module) that collects all possible behav...