We present specification languages that naturally capture exactly the regular and ω-regular properties that are stutter invariant. Our specification languages are variants of the classical regular expressions and of the core of PSL, a temporal logic, which is widely used in industry and which extends the classical linear-time temporal logic LTL by semi-extended regular expressions.

In this work we investigate the use of propositional linear temporal logic LTL as a speciication language for planning problems and the use of analytic tableaux as a tool for plan search, following the \planning as satissability" approach 11]. We claim that LTL can be a good speciication language for planning problems, because of its rich expressive power and the underlying simple model of time...

Systems with an arbitrary number of homogeneous processes occur in many applications. The Parameterized Model Checking Problem (PMCP) is to determine whether a temporal property is true of every size instance of the system. We consider systems formed by a synchronous parallel composition of a single control process with an arbitrary number of homogeneous user processes, and show that the PMCP i...

Online auctions are vulnerable to shill bidders, who intend to artificially raise bidding prices, causing winning bidders to pay more than they should pay for auctioned items. Detection of such fraudulent behaviors is very difficult, especially when an auction is in progress, or “live”. This paper focuses on a formal technique to detect shilling behaviors in live online auctions. We define a mo...

Timelines interpreting interval temporal logic formulas are segmented into strings which serve as semantic representations for tense and aspect. The strings have bounded but refinable granularity, suitable for analyzing (im)perfectivity, durativity, telicity, and various relations including branching.

This paper defines a generalization of Lamport’s Temporal Logic of Actions. We prove that our logic is stuttering-invariant and give an axiomatization of its propositional fragment. We also show that standard TLA is as expressive as our extension once quantification over flexible propositions is added.

‘Almost-certain eventualities’ are liveness properties that hold with probability 1. ‘Abstract probabilities’ are probabilities in transition systems about which we know only that they are neither 0 nor 1. Vardi [16] showed that almost-certain properties in linear temporal logic depend only on abstract probabilities, rather than on the probabilities’ precise values; we discuss the extent to whi...

We introduce versions of game-theoretic semantics (GTS) for Alternating-Time Temporal Logic (ATL). In GTS, truth is defined in terms of existence of a winning strategy in a semantic evaluation game, and thus the game-theoretic perspective appears in the framework of ATL on two semantic levels: on the object level, in the standard semantics of the strategic operators, and on the meta-level, wher...

An organizational modeling language can be used to specify an agent organization in terms of its roles, organizational structure, norms, etc. Such an organizational specification imposes constraints on agents that play roles in it, and the agents are expected to take this into account when deciding what to do. This means that agents need to have a basic understanding of what it means to comply ...