#### Filter Results:

- Full text PDF available (75)

#### Publication Year

1993

2017

- This year (7)
- Last 5 years (30)
- Last 10 years (47)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin
- J. ACM
- 2006

Motivated by reasoning tasks for XML languages, the satisfiability problem of logics on <i>data trees</i> is investigated. The nodes of a data tree have a <i>label</i> from a finite set and a <i>data value</i> from a possibly infinite set. It is shown that satisfiability for two-variable first-order logic is decidable if the tree structure can be accessed… (More)

- Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David
- 21st Annual IEEE Symposium on Logic in Computer…
- 2006

In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semistructured data, timed automata and extended temporal logics. It is shown that satisfiability for the two-variable first-order logic FO<sup>2</sup>(~,<,+1) is decidable over finite… (More)

- Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun
- J. Comput. Syst. Sci.
- 2002

We consider three natural classes of infinite-state HMSCs: globally-cooperative, locally-cooperative and local-choice HMSCs. We show first that model-checking for globally-cooperative and locally-cooperative HMSCs is of the same complexity as for the class of finite state HMSCs. Surprisingly, model-checking local-choice HMSCs turns out to be exponentially… (More)

- Anca Muscholl, Igor Walukiewicz
- FoSSaCS
- 2007

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 given services. We show an EXPTIME-lower bound for this… (More)

- Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin
- ACM Trans. Comput. Log.
- 2011

In a <i>data word</i> each position carries a label from a finite alphabet and a data value from some infinite domain. This model has been already considered in the realm of semistructured data, timed automata, and extended temporal logics.
This article shows that satisfiability for the two-variable fragment FO<sup>2</sup>(∼,<,+1) of first-order… (More)

- Anca Muscholl, Doron A. Peled
- MFCS
- 1999

Message sequence charts (MSC) are a graphical speciica-tion language widely used for designing communication protocols. Our starting point are two decision problems concerning the correctness and the consistency of a design based by MSC graphs. Both problems are shown to be undecidable, in general. Using a natural connectivity assumption from Mazurkiewicz… (More)

- Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl
- ICALP
- 2004

It is known that MSO logic for ordered unranked trees is undecidable if Presburger constraints are allowed at children of nodes. We show here that a decidable logic is obtained if we use a modal fixpoint logic instead. We present a characterization of this logic by means of deterministic Presburger tree automata and show how it can be used to express… (More)

- Werner Ebinger, Anca Muscholl
- Theor. Comput. Sci.
- 1993

- Anca Muscholl, Doron A. Peled, Zhendong Su
- FoSSaCS
- 1998

Message sequence charts (MSC) are commonly used in designing communication systems. They allow describing the communication skeleton of a system and can be used for nding design errors. First, a speciication formalism that is based on MSC graphs, combining nite message sequence charts, is presented. We present then an automatic validation algorithm for… (More)

- Ahmed Bouajjani, Anca Muscholl, Tayssir Touili
- LICS
- 2001

We propose a natural subclass of regular languages (Alphabetic Pattern Constraints, APC) which is effectively closed under permutation rewriting, i.e., under iterative application of rules of the form ab ! ba. It is well-known that regular languages do not have this closure property, in general. Our result can be applied for example to regular model… (More)