3,566 Hits in 2.9 sec

Dining philosophers revisited

Armando R. Gingras
1990 ACM SIGCSE Bulletin  
Solution Requirement s Any acceptable solution to the Dining Philosophers problem must meet several minimum criteria .  ...  [6 ] [3 ] [ 2 ] [ 1 ] Dining Philosophers Revisite d Armando R. Gingras Metropolitan State Colleg e Denver, Colorad o 2 1 Abstrac t TABLE . .  ... 
doi:10.1145/101085.101091 fatcat:hqr6q4emmfhcjdj2hetxtijol4

Search algorithms for automated validation

Tom A.N. Engels, Jan Friso Groote, Muck J. van Weerdenburg, Tim A.C. Willemse
2009 The Journal of Logic and Algebraic Programming  
The next best choice is a random search, while depth-first search is always outperformed.  ...  The search technique relies on a highway simulation which takes several homogeneous walks through a (possibly infinite) state space.  ...  Dining Philosophers The dining philosophers problem is a problem that clearly illustrates the subtleties and complexity of synchronisation in concurrency.  ... 
doi:10.1016/j.jlap.2008.11.003 fatcat:ab6fjhzo3fgx7aumdzljzd4aiu

Generalised Dining Philosophers as Feedback Control [article]

Venkatesh Choppella, Kasturi Viswanath, Arjun Sanjeev
2018 arXiv   pre-print
We revisit the Generalised Dining Philosophers problem through the perspective of feedback control.  ...  In each case, solving the Generalised Dining Philosophers reduces to designing an appropriate feedback controller.  ...  We revisit the Generalised Dining Philosophers problem through the perspective of feedback control.  ... 
arXiv:1805.02010v1 fatcat:ssnlptu5mndmbp4soydxlfo25i

On Randomization Versus Synchronization in Distributed Systems [chapter]

Hagen Völzer
2004 Lecture Notes in Computer Science  
Background: • this problem inherently contains the possibility of conspiracy • fairness and randomization is not enough to "implement away" conspiracy Conspiracy Dining philosophers with keys (forks)  ...  is hungry then it eventually becomes critical even if right crashes Second result Theorem: Crash-tolerant dining philosophers cannot be solved with probability 1 through fairness + randomization.  ... 
doi:10.1007/978-3-540-27836-8_100 fatcat:fezw4u3stjb2vicmjc2efcmekm

Using model checkers in an introductory course on operating systems

Roelof Hamberg, Frits Vaandrager
2008 ACM SIGOPS Operating Systems Review  
The course uses model checkers as a tool to explain, visualize and solve concurrency problems.  ...  During the last three years, we have been experimenting with the use of the Uppaal model checker in an introductory course on operating systems for first-year Computer Science students at the Radboud University  ...  Dining Philosophers Revisited Several textbooks present a solution to the classical dining philosophers problem with a monitor, for instance Stallings [20] , Nutt [17] and Silberschatz & Galvin [19  ... 
doi:10.1145/1453775.1453793 fatcat:g7pl5ijv5vbutnyisqtazrrh3a

Stanley Cavell at Amherst College

Thomas Dumm
2019 Conversations The Journal of Cavellian Studies  
(I had nominated him for the lectureship the previous year, and he had been approved by a College committee and the president of the College at the time, Tom Gerety, who was himself a legal philosopher  ...  (The first McCloy lecturer had been Fred Korematsu, who had unsuccessfully sued the U.S. government during World War II to end the Japanese internment program.  ...  The following week Stanley returned, and again delivered himself of a major lecture, this time revisiting the themes of Austin, the philosopher who, when Stanley was a graduate student at Harvard, had  ... 
doi:10.18192/cjcs.vi7.4290 fatcat:acgqso2qwrdo5bdlkzssx55piu

Quantitative Program Logic and Performance in Probabilistic Distributed Algorithms [chapter]

Annabelle K. McIver
1999 Lecture Notes in Computer Science  
We illustrate the methods with an analysis of performance of the probabilistic dining philosophers [10] .  ...  We show that overall performance can be formulated directly in the logic and that it can be derived from local properties of components.  ...  Acknowledgements This paper reports work carried out at Oxford within a project supported by the EPSRC -Carroll Morgan and Jeff Sanders are also members of that project.  ... 
doi:10.1007/3-540-48778-6_2 fatcat:oblrgrjcbndebasdxy4nlmi6fe

Page 3640 of Mathematical Reviews Vol. , Issue 95f [page]

1995 Mathematical Reviews  
This is illustrated by extending the well-known example of ‘dining philoso- phers’ to a ‘restaurant of dining philosophers’.  ...  priority-ordering problem.  ... 

"To Store or Not To Store" Reloaded: Reclaiming Memory on Demand [chapter]

Moritz Hammer, Michael Weber
2007 Lecture Notes in Computer Science  
Behrmann et al. posed the question whether "To Store or Not To Store" [1] states during reachability analysis, in order to counter the effects of the well-known state space explosion problem in explicitstate  ...  We are careful to minimize revisits, and I/O overhead, and also stay sound, i.e. on termination it is guaranteed that the full state space has been explored.  ...  Table 1 shows the efficiency of different reclaiming strategies for a Dining Philosophers model with 9 philosophers, and a model of Lunar routing protocol scenario 4(b) [7] .  ... 
doi:10.1007/978-3-540-70952-7_4 fatcat:7unohgb3vzejljgljulf5pq4yi

Learning to Prove Safety over Parameterised Concurrent Systems (Full Version) [article]

Yu-Fang Chen, Chih-Duo Hong, Anthony W. Lin, Philipp Ruemmer
2017 arXiv   pre-print
We revisit the classic problem of proving safety over parameterised concurrent systems, i.e., an infinite family of finite-state concurrent systems that are represented by some finite (symbolic) means.  ...  An example of such an infinite family is a dining philosopher protocol with any number n of processes (n being the parameter that defines the infinite family).  ...  Rümmer was supported by the Swedish Research Council under grant 2014-5484.  ... 
arXiv:1709.07139v2 fatcat:qk4zvwgbsbcvdbkietnyxul744

Improving distributed memory applications testing by message perturbation

Richard Vuduc, Martin Schulz, Dan Quinlan, Bronis de Supinski, Andreas Sæbjørnsen
2006 Proceeding of the 2006 workshop on Parallel and distributed systems: testing and debugging - PADTAD '06  
Using carefully designed model problems, we show that these techniques aid testing for problems that are often not easily reproduced when running on small fractions of the machine.  ...  These techniques improve the coverage of possible message orderings in MPI applications that rely on nondeterministic point-to-point communication and work with small processor counts to alleviate the  ...  Dining philosophers We implemented the symmetric MPI dining philosophers protocol as described in Section 2.3.  ... 
doi:10.1145/1147403.1147409 dblp:conf/issta/VuducSQSS06 fatcat:n4m2llt65zgg3fvvsjbpba64we

Modelling and Verifying an Object-Oriented Concurrency Model in GROOVE [article]

Claudio Corrodi
2015 arXiv   pre-print
We present an implementation of the model in the state-of-the-art model checker GROOVE, which can be used to simulate programs and verify concurrency and consistency properties, such as the impossibility  ...  Several approaches to verifying SCOOP programs have been proposed in the past, but none of them operate directly on the source code without modifications or annotations.  ...  We start by we revisiting the dining philosophers problem one last time and show how the implementation behaves using our toolchain.  ... 
arXiv:1505.05265v1 fatcat:3do6ltbic5fydaimj7uzggwnoy

Oclets – Scenario-Based Modeling with Petri Nets [chapter]

Dirk Fahland
2009 Lecture Notes in Computer Science  
We prove the correctness of our results.  ...  A scenario-based model describes the system behavior in terms of partial runs, called scenarios.  ...  Our tool Greta, which substantially helped developing the concepts would not have been possible without the work of Manja Wolf. Dirk Fahland is funded by the DFG-Graduiertenkolleg 1324 "METRIK".  ... 
doi:10.1007/978-3-642-02424-5_14 fatcat:n6tplyczzzgodfud4mhszgog5e

Learning to prove safety over parameterised concurrent systems

Yu-Fang Chen, Chih-Duo Hong, Anthony W. Lin, Philipp Rummer
2017 2017 Formal Methods in Computer Aided Design (FMCAD)  
We revisit the classic problem of proving safety over parameterised concurrent systems, i.e., an infinite family of finite-state concurrent systems that are represented by some finite (symbolic) means.  ...  An example of such an infinite family is a dining philosopher protocol with any number n of processes (n being the parameter that defines the infinite family).  ...  Dining Cryptographers and Dining Philosophers). c) Organisation: The notations are defined in Section II.  ... 
doi:10.23919/fmcad.2017.8102244 dblp:conf/fmcad/ChenHLR17 fatcat:vvswunfutffj5hh6gtp2xgt2o4

GSTE is partitioned model checking

Roberto Sebastiani, Eli Singerman, Stefano Tonetta, Moshe Y. Vardi
2007 Formal methods in system design  
Verifying whether an ω-regular property is satisfied by a finite-state system is a core problem in model checking.  ...  In this paper, we show that the GSTE algorithms are essentially a partitioned version of standard symbolic model-checking (SMC) algorithms, where the partitioning is driven by the property under verification  ...  The first example is a dining-philosophers protocol [Dij72] . Concurrency is modeled with the interleaving semantics.  ... 
doi:10.1007/s10703-007-0036-3 fatcat:pn374h2fjjbajf3x4kwaqli3ey
« Previous Showing results 1 — 15 out of 3,566 results