Sciweavers

366 search results - page 45 / 74
» Synthesis: Words and Traces
Sort
View
ICALP
2000
Springer
15 years 1 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
PDPTA
2003
14 years 11 months ago
Subway: Peer-to-Peer Clustering Of Clients for Web Proxy
Many cooperated web cache systems and protocols have been proposed. But, these systems need the expensive resources, such as core-link bandwidth and proxy cpu or storage, and need...
Kyungbaek Kim, Daeyeon Park
ENTCS
2006
122views more  ENTCS 2006»
14 years 9 months ago
Combining Aspect-Oriented and Strategic Programming
Properties such as logging, persistence, debugging, tracing, distribution, performance monitoring and exception handling occur in most programming paradigms and are normally very ...
Karl Trygve Kalleberg, Eelco Visser
ENTCS
2006
162views more  ENTCS 2006»
14 years 9 months ago
Continuous Functions on Final Coalgebras
It can be traced back to Brouwer that continuous functions of type StrA B, where StrA is the type of infinite streams over elements of A, can be represented by well founded, Abra...
Neil Ghani, Peter Hancock, Dirk Pattinson
TCS
2008
14 years 9 months ago
True-concurrency probabilistic models: Markov nets and a law of large numbers
We introduce the model of Markov nets, a probabilistic extension of safe Petri nets under the true-concurrency semantics--this means that traces, not firing sequences, are given a...
Samy Abbes, Albert Benveniste