Sciweavers

2025 search results - page 306 / 405
» Minimal-Cut Model Composition
Sort
View
AI
2008
Springer
13 years 9 months ago
Properties of tree convex constraints
It is known that a tree convex network is globally consistent if it is path consistent. However, if a tree convex network is not path consistent, enforcing path consistency on it ...
Yuanlin Zhang, Eugene C. Freuder
CORR
2010
Springer
77views Education» more  CORR 2010»
13 years 9 months ago
Sound Bisimulations for Higher-Order Distributed Process Calculus
Abstract. While distributed systems with transfer of processes have become pervasive, methods for reasoning about their behaviour are underdeveloped. In this paper we develop a bis...
Adrien Piérard, Eijiro Sumii
ECEASST
2008
106views more  ECEASST 2008»
13 years 9 months ago
Controlling resource access in Directed Bigraphs
: We study directed bigraph with negative ports, a bigraphical framework for representing models for distributed, concurrent and ubiquitous computing. With respect to previous vers...
Davide Grohmann, Marino Miculan
ENTCS
2008
105views more  ENTCS 2008»
13 years 9 months ago
Checking Equivalence for Reo Networks
Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of...
Tobias Blechmann, Christel Baier
DEDS
2006
119views more  DEDS 2006»
13 years 9 months ago
Diagnosability of Discrete Event Systems with Modular Structure
The diagnosis of unobservable faults in large and complex discrete event systems modeled by parallel composition of automata is considered. A modular approach is developed for diag...
Olivier Contant, Stéphane Lafortune, Demost...