Sciweavers

3207 search results - page 362 / 642
» A Semantics for HTN Methods
Sort
View
130
Voted
SBIA
2004
Springer
15 years 10 months ago
Towards to Similarity Identification to Help in the Agents' Negotiation
Abstract. Enterprise delegates Agents’ Negotiation is a simpler task if the enterprises involved in the transaction have homogeneous representation structures as well as the same...
Andreia Malucelli, Eugénio C. Oliveira
131
Voted
ECOOP
2010
Springer
15 years 10 months ago
Essential AOP: The A Calculus
Abstract. Aspect-oriented programming (AOP) has produced interesting language designs, but also ad hoc semantics that needs clarification. We contribute to this clarification wit...
Bruno De Fraine, Erik Ernst, Mario Südholt
FM
2001
Springer
108views Formal Methods» more  FM 2001»
15 years 9 months ago
Improvements in BDD-Based Reachability Analysis of Timed Automata
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer
CONCUR
1999
Springer
15 years 9 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea
ACSD
1998
IEEE
105views Hardware» more  ACSD 1998»
15 years 9 months ago
Visual Formalisms Revisited
The development of an interactive application is a complex task that has to consider data, behavior, intercommunication, architecture and distribution aspects of the modeled syste...
Radu Grosu, Gheorghe Stefanescu, Manfred Broy