Sciweavers

949 search results - page 10 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
DALT
2004
Springer
14 years 26 days ago
A Lightweight Coordination Calculus for Agent Systems
The concept of a social norm is used in multi-agent systems to specify behaviours required of agents interacting in a given social context. We describe a method for specifying soci...
David Robertson
STACS
2001
Springer
13 years 12 months ago
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra
It is well known that finite square matrices over a Kleene algebra again form a Kleene algebra. This is also true for infinite matrices under suitable restrictions. One can use t...
Dexter Kozen
JLP
2006
155views more  JLP 2006»
13 years 7 months ago
A formally grounded software specification method
One of the goals of software engineering is to provide what is necessary to write relevant, legible, useful descriptions of the systems to be developed, which will be the basis of...
Christine Choppy, Gianna Reggio
FORMATS
2007
Springer
13 years 11 months ago
Combining Formal Verification with Observed System Execution Behavior to Tune System Parameters
Resource limited DRE (Distributed Real-time Embedded) systems can benefit greatly from dynamic adaptation of system parameters. We propose a novel approach that employs iterative t...
Minyoung Kim, Mark-Oliver Stehr, Carolyn L. Talcot...
CONCUR
1991
Springer
13 years 11 months ago
Real Space Process Algebra
We propose a process algebra obtained by adapting the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, 2002, Chap....
Jos C. M. Baeten, Jan A. Bergstra