1679 search results - page 104 / 336 » Strong order equivalence |
CCCG
2008
13 years 11 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
OSDI
2000
ACM
13 years 11 months ago
2000
ACM
The tradeoffs between consistency, performance, and availability are well understood. Traditionally, however, designers of replicated systems have been forced to choose from eithe...
QEST
2010
IEEE
13 years 8 months ago
2010
IEEE
Information hiding is a general concept which refers to the goal of preventing an adversary to infer secret information from the observables. Anonymity and Information Flow are exa...
ETFA
2008
IEEE
14 years 4 months ago
2008
IEEE
The dater equalities constitute a well-known tool which allows the description of Timed Event Graphs in the field of (max, +) algebra. This paper gives an equivalent model in the...
ACSD
2007
IEEE
14 years 4 months ago
2007
IEEE
In this paper we introduce executions of place/transition Petri nets with weighted inhibitor arcs (PTI-net) as enabled labeled stratified order structures (LSOs) and present a po...