Sciweavers

4666 search results - page 2 / 934
» Equations on Timed Languages
Sort
View
CSCLP
2006
Springer
13 years 8 months ago
Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
Marc Meister, Khalil Djelloul, Thom W. Frühwi...
ICALP
2004
Springer
13 years 10 months ago
Deciding Knowledge in Security Protocols Under Equational Theories
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
Martín Abadi, Véronique Cortier
JSC
2010
103views more  JSC 2010»
13 years 3 months ago
Anti-patterns for rule-based languages
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. This should be naturally ...
Horatiu Cirstea, Claude Kirchner, Radu Kopetz, Pie...
ECOOP
1993
Springer
13 years 9 months ago
A Timed Calculus for Distributed Objects with Clocks
This paper proposes a formalism for reasoning about distributed object-oriented computations. The formalism is an extension of Milner’s CCS with the notion of local time. It allo...
Ichiro Satoh, Mario Tokoro
BMCBI
2004
121views more  BMCBI 2004»
13 years 4 months ago
Asynchronous adaptive time step in quantitative cellular automata modeling
Background: The behaviors of cells in metazoans are context dependent, thus large-scale multicellular modeling is often necessary, for which cellular automata are natural candidat...
Hao Zhu, Peter Y. H. Pang, Yan Sun, Pawan Dhar