Sciweavers

2465 search results - page 209 / 493
» Automata on Linear Orderings
Sort
View
CONCUR
2005
Springer
14 years 4 months ago
The Individual and Collective Token Interpretations of Petri Nets
Starting from the opinion that the standard firing rule of Petri nets embodies the collective token interpretation of nets rather than their individual token interpretation, I pro...
Rob J. van Glabbeek
RTA
2005
Springer
14 years 4 months ago
Intruder Deduction for AC-Like Equational Theories with Homomorphisms
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
Pascal Lafourcade, Denis Lugiez, Ralf Treinen
WDAG
2005
Springer
90views Algorithms» more  WDAG 2005»
14 years 4 months ago
Proving Atomicity: An Assertional Approach
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Jos...
ICTAI
2000
IEEE
14 years 3 months ago
Designing a learning-automata-based controller for client/server systems: a methodology
Abstract— Polling policies have been introduced to simplify the accessing process in client/server systems by a centralized control access scheme. This paper considers a client/s...
Georgios I. Papadimitriou, Athena Vakali, Andreas ...
IPPS
1998
IEEE
14 years 3 months ago
An Enhanced Co-Scheduling Method Using Reduced MS-State Diagrams
Instruction scheduling methods based on the construction of state diagrams (or automata) have been used for architectures involving deeply pipelined function units. However, the s...
Ramaswamy Govindarajan, N. S. S. Narasimha Rao, Er...