Sciweavers

19 search results - page 2 / 4
» csr 2010
Sort
View
CSR
2010
Springer
14 years 10 months ago
The max quasi-independent set Problem
Nicolas Bourgeois, Aristotelis Giannakos, Giorgio ...
75
Voted
CSR
2010
Springer
15 years 3 months ago
Prehistoric Phenomena and Self-referentiality
By terms-allowed-in-types capacity, the Logic of Proofs LP includes formulas of the form t : ϕ(t), which have self-referential meanings. In this paper, “prehistoric phenomena...
Junhua Yu
78
Voted
CSR
2010
Springer
15 years 3 months ago
Equilibria in Quantitative Reachability Games
In this paper, we study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In this framework each player aims at reaching...
Thomas Brihaye, Véronique Bruyère, J...
81
Voted
ENTCS
2007
123views more  ENTCS 2007»
14 years 10 months ago
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
Beatriz Alarcón, Raúl Gutiérr...
74
Voted
CSR
2010
Springer
15 years 3 months ago
Realizability of Dynamic MSC Languages
Abstract. We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can ...
Benedikt Bollig, Loïc Hélouët