activity
20072019
most citedGuarded Variable Automata over Infinite Alphabets

4 citations · 14 across the 13 of their papers we have counts for

collaborators
Showing cs.LOShow all

7 papers · 1 filter

cs.LO2019

Unification and combination of iterative insertion strategies with rudimentary traversals and failure

Walid Belkhir, Nicolas Ratier, Duy Duc Nguyen Michel Lenczner

We introduce a new class of extensions of terms that consists in navigation strategies and insertion of contexts. We introduce an operation of combination on this class which is as…

cs.LO2019

Unification and combination of a class of traversal strategies made with pattern matching and fixed-points

Walid Belkhir, Nicolas Ratier, Duy Duc Nguyen +1

Motivated by an ongoing project on computer aided derivation of asymptotic models governed by partial differential equations, we introduce a class of term transformations that cons…

cs.LO2012★ 4 cited

Lazy AC-Pattern Matching for Rewriting

Walid Belkhir, Alain Giorgetti

We define a lazy pattern-matching mechanism modulo associativity and commutativity. The solutions of a pattern-matching problem are stored in a lazy list composed of a first substi…

cs.LO2009

From Causal Semantics To Duration Timed Models

Walid Belkhir

The interleaving semantics is not compatible with both action refinement and durational actions. Since many true concurrency semantics are congruent w.r.t. action refinement, notab…

cs.LO2009

The Star Height Hierarchy Vs. The Variable Hierarchy

Walid Belkhir

The star height hierarchy (resp. the variable hierarchy) results in classifying -terms into classes according to the nested depth of fixed point operators (resp. to the number o…

cs.LO2007

The Variable Hierarchy for the Games mu-Calculus

Walid Belkhir, Luigi Santocanale

Parity games are combinatorial representations of closed Boolean mu-terms. By adding to them draw positions, they have been organized by Arnold and one of the authors into a mu-cal…