Sciweavers

1724 search results - page 284 / 345
» Models for Concurrency
Sort
View
OPODIS
2004
13 years 10 months ago
A Constraint-Based Formalism for Consistency in Replicated Systems
Abstract. We present a formalism for modeling replication in a distributed system with concurrent users sharing information. It is based on actions, which represent operations requ...
Marc Shapiro, Karthikeyan Bhargavan, Nishith Krish...
POPL
2012
ACM
12 years 4 months ago
Deciding choreography realizability
Since software systems are becoming increasingly more concurrent and distributed, modeling and analysis of interactions among their components is a crucial problem. In several app...
Samik Basu, Tevfik Bultan, Meriem Ouederni
ASPLOS
2006
ACM
14 years 2 months ago
Atomicity and visibility in tiny embedded systems
Visibility is a property of a programming language’s memory model that determines when values stored by one concurrent computation become visible to other computations. Our work...
John Regehr, Nathan Cooprider, David Gay
ACSD
2001
IEEE
91views Hardware» more  ACSD 2001»
14 years 11 days ago
Synthesis of Net Systems with Inhibitor Arcs from Step Transition Systems
We here consider transition systems of Elementary Net Systems with Inhibitor Arcs. There are basically two di erent types of non-interleaving semantics of such Petri nets, the a-po...
Marta Pietkiewicz-Koutny
PRDC
2007
IEEE
14 years 3 months ago
Improving Dependability Using Shared Supplementary Memory and Opportunistic Micro Rejuvenation in Multi-tasking Embedded Systems
We propose a comprehensive solution to handle memory-overflow problems in multitasking embedded systems thereby improving their reliability and availability. In particular, we pro...
Vinaitheerthan Sundaram, Sandip HomChaudhuri, Sach...