—Commitments based on branching time logic are powerful representations for modeling multi-agent interactions. Current approaches into commitments have conceived these representa...
act Interpretation Perspective on Linear vs. Branching Time Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy It is...
This paper considers QLtl, a quantitative analagon of Ltl and presents algorithms for model checking QLtl over quantitative versions of Kripke structures and Markov chains.
We present TECTLK, a logic to specify knowledge and real time in multi-agent systems. We show that the model checking problem is decidable, and we present an algorithm for TECTLK ...