Search

• < Previous
• 1
• Next >

---

A lower bound on web services composition

Anca Muscholl ; Igor Walukiewicz.

A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web services; where the construction is understood as a simulation of the specification by a fully asynchronous product of the&nbsp;[&hellip;]

---

Weak Alternating Timed Automata

Pawel Parys ; Igor Walukiewicz.

Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for these automata is decidable. This result implies new decidability results for fragments of timed temporal logics. It is also shown that,&nbsp;[&hellip;]

---

Wreath Products of Forest Algebras, with Applications to Tree Logics

Mikolaj Bojanczyk ; Igor Walukiewicz ; Howard Straubing.

We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These include the temporal logics CTL and EF, and first-order logic over the ancestor relation. While the characterizations are in&nbsp;[&hellip;]

---