Search results for "dining philosophers"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Srikanth Sastry, Scott M. Pike, Jennifer L. Welch	The weakest failure detector for wait-free dining under eventual weak exclusion.	SPAA	2009	DBLP DOI BibTeX RDF	mutual exclusion, failure detectors, wait-freedom, partial synchrony, dining philosophers
2	Praveen Danturi, Mikhail Nesterenko, Sébastien Tixeuil	Self-stabilizing philosophers with generic conflicts.	TAAS	2009	DBLP DOI BibTeX RDF	Self-stabilization, dining philosophers
2	Scott M. Pike, Yantao Song, Srikanth Sastry	Wait-Free Dining Under Eventual Weak Exclusion.	ICDCN	2008	DBLP DOI BibTeX RDF	Failure Detectors, Wait-Freedom, Dining Philosophers
2	Jayasri Banerjee, Anup Kumar Bandyopadhyay, Ajit Kumar Mandal	Application of Dijkstra's weakest precondition calculus to Dining Philosophers problem.	ACM SIGSOFT Software Engineering Notes	2007	DBLP DOI BibTeX RDF
2	Lee Naish	Resource-Oriented Deadlock Analysis.	ICLP	2007	DBLP DOI BibTeX RDF	deadlock analysis, committed choice nondeterminism, floundering, Concurrency, partial order, dining philosophers, coroutining
2	Jürg Gutknecht	The Dining Philosophers Problem Revisited.	JMLC	2006	DBLP DOI BibTeX RDF
2	Marie Duflot, Laurent Fribourg, Claudine Picaronny	Randomized dining philosophers without fairness assumption.	Distributed Computing	2004	DBLP DOI BibTeX RDF
2	Scott M. Pike, Paolo A. G. Sivilotti	Dining Philosophers with Crash Locality 1.	ICDCS	2004	DBLP DOI BibTeX RDF
2	D. Carvalho, Fábio Protti, Massimo De Gregorio, Felipe M. G. França	A Novel Distributed Scheduling Algorithm for Resource Sharing Under Near-Heavy Load.	OPODIS	2004	DBLP DOI BibTeX RDF	dining philosophers problem, distributed traffic light control, graph dynamics, distributed algorithms, mutual exclusion, resource-sharing
2	Mikhail Nesterenko, Anish Arora	Dining Philosophers that Tolerate Malicious Crashes. (PDF / PS)	ICDCS	2002	DBLP DOI BibTeX RDF
2	Oltea Mihaela Herescu, Catuscia Palamidessi	On the generalized dining philosophers problem.	PODC	2001	DBLP DOI BibTeX RDF
2	Kamel Barkaoui, Claude Kaiser, Jean-François Pradat-Peyre	Petri nets based proofs of Ada 95 solution for preference control.	APSEC	1997	DBLP DOI BibTeX RDF	Petri nets based proofs, preference control, dining philosophers paradigm, entry families, requeue statements, Petri nets, deadlock, colored Petri nets, Ada 95, correctness proofs, starvation, protected objects
2	Benjamin M. Brosgol	The Dining Philosophers in Ada 95.	Ada-Europe	1996	DBLP DOI BibTeX RDF
2	José A. Troyano, Jesús Torres, Miguel Toro	A technique for distributed systems specification.	PDP	1995	DBLP DOI BibTeX RDF	distributed systems specification, object-oriented specification language, dining philosophers problem, formal specification, distributed algorithms, distributed processing, concurrency control, specification languages, distributed programming, object-oriented languages, transition system, algebraic model, algebraic data types, object attributes, transition rules
2	Yih-Kuen Tsay, Rajive Bagrodia	An Algorithm with Optimal Failure Locality for the Dining Philosophers Problem.	WDAG	1994	DBLP DOI BibTeX RDF	Strong, Fault-Tolerance, Synchronization, Resource Allocation, Lower Bounds, Fairness
2	Yih-Kuen Tsay, Rajive Bagrodia	Fault-Tolerant Algorithms for Fair Interprocess Synchronization.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	fair interprocess synchronization, binary interaction problem, strong fairness property, binary interactions, message cost, dining philosophers problem, distributed algorithms, fault tolerant computing, concurrency control, embedding, synchronisation, response time, fault-tolerant algorithms, asynchronous processes
2	Gerald M. Karam, Raymond J. A. Buhr	Temporal Logic-Based Deadlock Analysis For Ada.	IEEE Trans. Software Eng.	1991	DBLP DOI BibTeX RDF	temporal logic-based specification language, deadlock analyzer, Timebench, concurrent system-design environment, COL, linear-time temporal logic, formal basis, axiomatic reasoning, deadlock analysis tool, reasoning power, Ada designs, systemwide deadlock-free, deadlock algorithm, finite systems, worst-case computational complexity, gas station, layered communications system, computational complexity, Ada, logic programming, temporal logic, Prolog, specification language, specification languages, inference mechanisms, system recovery, theorem prover, readers, dining philosophers, writers
2	Baruch Awerbuch, Michael E. Saks	A Dining Philosophers Algorithm with Polynomial Response Time	FOCS	1990	DBLP DOI BibTeX RDF	dynamic job creation, job arrival density, conflicting jobs, asynchronous model, concurrent jobs, maximum execution time, dining philosophers algorithm, polynomial response time, distributed online algorithm, message transmission time, resource allocation, upper bound, job scheduling, resource constraints, resource requirements, arbitrary networks, distribution queue
2	Sudhir Aggarwal, Daniel Barbará, Kalman Z. Meth	A Software Environment for the Specification and Analysis of Problems of Coordination and Concurrency.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	SPANNER software environment, selection/resolution model, cluster variables, simulation, parallel programming, concurrency, distributed computing, specification, coordination, distributed processing, programming environments, concurrent programming, reachability analysis, software environment, dining philosophers, finite-state machine model
2	Haim Gaifman	Modeling concurrency by partial orders and nonlinear transition systems.	REX Workshop	1988	DBLP DOI BibTeX RDF	pomset, causal precedence, concurrent, computation, process, event, deadlock, partial order, action, state, transition system, automaton, shared resource, dining philosophers, simultaneous
2	Daniel J. Lehmann, Michael O. Rabin	On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem.	POPL	1981	DBLP DOI BibTeX RDF
1	Anup Kumar Bandyopadhyay, Nibedita Lenka	Application of TLRO to dining philosophers problem.	ACM SIGSOFT Software Engineering Notes	2010	DBLP DOI BibTeX RDF
1	Zhen You, Jinyun Xue, Shi Ying	Categorial Semantics of a Solution to Distributed Dining Philosophers Problem.	FAW	2010	DBLP DOI BibTeX RDF
1	Suzana Andova, Luuk Groenewegen, Erik P. de Vink	Distributed Adaption of Dining Philosophers.	FACS	2010	DBLP DOI BibTeX RDF
1	Cosimo Laneve, Antonio Vitale	The Expressive Power of Synchronizations.	LICS	2010	DBLP DOI BibTeX RDF	dining philosophers problem, synchronizations, hypercube, Expressive power, process calculi
1	Hagit Attiya, Alex Kogan, Jennifer L. Welch	Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks.	IEEE Trans. Mob. Comput.	2010	DBLP DOI BibTeX RDF	failure locality, Mobile ad hoc networks, dining philosophers
1	Anup Kumar Bandyopadhyay	Fairness and conspiracy concepts in concurrent systems.	ACM SIGSOFT Software Engineering Notes	2009	DBLP DOI BibTeX RDF	conspiracy, fairness, concurrent systems, starvation
1	Claude Kaiser, Jean-François Pradat-Peyre	Weak Fairness Semantic Drawbacks in Java Multithreading.	Ada-Europe	2009	DBLP DOI BibTeX RDF
1	Byung-Chul Kim, Sang-Woo Jun, Dae Joon Hwang, Yong-Kee Jun	Visualizing Potential Deadlocks in Multithreaded Programs.	PaCT	2009	DBLP DOI BibTeX RDF	potential deadlocks, lock-causality graph, visualization, debugging, multithreaded programs
1	Liang Xu, Wei Chen 0018, Yanyan Xu, Wenhui Zhang	Improved Bounded Model Checking for the Universal Fragment of CTL.	J. Comput. Sci. Technol.	2009	DBLP DOI BibTeX RDF	model checking algorithm, ACTL, SAT, software verification, bounded model checking
1	Armando Solar-Lezama, Christopher Grant Jones, Rastislav Bodík	Sketching concurrent data structures.	PLDI	2008	DBLP DOI BibTeX RDF	concurrency, synthesis, sketching, sat, spin
1	Hagit Attiya, Alex Kogan, Jennifer L. Welch	Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks.	ICDCS	2008	DBLP DOI BibTeX RDF
1	Doina Bein, Ajoy Kumar Datta, Chitwan K. Gupta, Lawrence L. Larmore	Local Synchronization on Oriented Rings.	SSS	2008	DBLP DOI BibTeX RDF	Local mutual exclusion, oriented ring, synchronization, transformer, self-stabilization
1	Yantao Song, Scott M. Pike	Eventually k-Bounded Wait-Free Distributed Daemons.	DSN	2007	DBLP DOI BibTeX RDF	self-stabilization, wait-freedom, daemons
1	Pablo F. Castro, T. S. E. Maibaum	An ought-to-do deontic logic for reasoning about fault-tolerance: the diarrheic philosophers.	SEFM	2007	DBLP DOI BibTeX RDF
1	Praveen Danturi, Mikhail Nesterenko, Sébastien Tixeuil	Self-stabilizing Philosophers with Generic Conflicts.	SSS	2006	DBLP DOI BibTeX RDF
1	Scott M. Pike, Yantao Song, Kaustav Ghoshal	Brief Announcement: Wait-Free Dining for Eventual Weak Exclusion.	SSS	2006	DBLP DOI BibTeX RDF
1	David J. Powers	Dining Philosophers: Strategies for Success.	PDPTA	2005	DBLP BibTeX RDF
1	Phuong Hoai Ha, Philippas Tsigas, Mirjam Wattenhofer, Roger Wattenhofer	Efficient multi-word locking using randomization.	PODC	2005	DBLP DOI BibTeX RDF	multi-word locking, shared memory, randomization, dining philosophers
1	Sujatha Kashyap, Vijay K. Garg	Exploiting predicate structure for efficient reachability detection.	ASE	2005	DBLP DOI BibTeX RDF	model checking, reachability, Mazurkiewicz traces
1	Kathrin Hoffmann, Hartmut Ehrig, Till Mossakowski	High-Level Nets with Nets and Rules as Tokens.	ICATPN	2005	DBLP DOI BibTeX RDF	High-level net models, algebraic high-level nets, nets and rules as tokens, integration of net theory and graph transformations, case study: House of Philosophers, graph grammars and Petri net transformations, algebraic specifications
1	Kun Wei, James Heather	Embedding the Stable Failures Model of CSP in PVS.	IFM	2005	DBLP DOI BibTeX RDF	CSP, deadlock, determinism, liveness, theorem prover
1	Shahid Jabbar, Stefan Edelkamp	I/O Efficient Directed Model Checking.	VMCAI	2005	DBLP DOI BibTeX RDF
1	Yifeng Chen, Jeff W. Sanders	Logic of global synchrony.	ACM Trans. Program. Lang. Syst.	2004	DBLP DOI BibTeX RDF	PRAM, reactive programming, Bulk-Synchronous Parallelism
1	Zhengwei Qi, Ruonan Rao, Guangtao Xue, Jinyuan You	A New Formal Model Based on P-System for Mobile Transactions.	IEEE SCC	2004	DBLP DOI BibTeX RDF
1	Dina Q. Goldin, David Keil	Toward Domain-Independent Formalization of Indirect Interaction.	WETICE	2004	DBLP DOI BibTeX RDF
1	Marco Gavanelli, Evelina Lamma, Paola Mello, Paolo Torroni	An Abductive Framework for Information Exchange in Multi-agent Systems.	CLIMA	2004	DBLP DOI BibTeX RDF
1	David Jackson	A Practical Approach to Evolving Concurrent Programs.	EuroGP	2004	DBLP DOI BibTeX RDF
1	Dániel Varró	Automated formal verification of visual modeling languages by model checking.	Software and System Modeling	2004	DBLP DOI BibTeX RDF	Model checking, Formal verification, Model transformation, Metamodeling, Graph transformation
1	Stefan Edelkamp	Promela Planning.	SPIN	2003	DBLP DOI BibTeX RDF
1	Marie Duflot, Laurent Fribourg, Claudine Picaronny	Randomized Dining Philosophers without Fairness Assumption.	IFIP TCS	2002	DBLP BibTeX RDF
1	Mikhail Nesterenko, Anish Arora	Tolerance to Unbounded Byzantine Faults.	SRDS	2002	DBLP DOI BibTeX RDF
1	Yonit Kesten, Amir Pnueli, Elad Shahar, Lenore D. Zuck	Network Invariants in Action.	CONCUR	2002	DBLP DOI BibTeX RDF
1	E. Allen Emerson, Vineet Kahlon	Model Checking Large-Scale and Parameterized Resource Allocation Systems.	TACAS	2002	DBLP DOI BibTeX RDF
1	Oltea Mihaela Herescu, Catuscia Palamidessi	On the generalized dining philosophers problem	CoRR	2001	DBLP BibTeX RDF
1	Paola Inverardi, Massimo Tivoli	Automatic synthesis of deadlock free connectors for COM/DCOM applications.	ESEC / SIGSOFT FSE	2001	DBLP DOI BibTeX RDF
1	Patrick Keane, Mark Moir	A General Resource Allocation Synchronization Problem.	ICDCS	2001	DBLP DOI BibTeX RDF
1	Paolo Baldan, Andrea Corradini, Barbara König	A Static Analysis Technique for Graph Transformation Systems.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Yifeng Chen, Jeff W. Sanders	Logic of Global Synchrony.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Tom Holvoet, Pierre Verbaeten	Using Petri Nets for Specifying Active Objects and Generative Communication.	Concurrent Object-Oriented Programming and Petri Nets	2001	DBLP DOI BibTeX RDF
1	Christophe Sibertin-Blanc	CoOperative Objects: Principles, Use and Implementation.	Concurrent Object-Oriented Programming and Petri Nets	2001	DBLP DOI BibTeX RDF
1	George Varghese, Mahesh Jayaram	The fault span of crash failures.	J. ACM	2000	DBLP DOI BibTeX RDF
1	Bengi Karaçali, Kuo-Chung Tai, Mladen A. Vouk	Deadlock Detection of EFSMs Using Simultaneous Reachability Analysis.	DSN	2000	DBLP DOI BibTeX RDF	Simultaneous Reachability Analysis, Extended Finite State Machine Model, Race Conditions, Deadlock Detection
1	Tsuyoshi Ohta, Tadanori Mizuno	Towards an Algorithmic Debugging for Distributed Programs.	APSEC	1999	DBLP DOI BibTeX RDF	debug, programming environment, distributed programs
1	Jun Zhou, Kuo-Chung Tai	Deadlock Analysis of Synchronous Message-Passing Programs. (PDF / PS)	PDSE	1999	DBLP DOI BibTeX RDF	LTS, Deadlock, CCS, Observational Equivalence
1	Annabelle McIver	Quantitative Program Logic and Performance in Probabilistic Distributed Algorithms.	ARTS	1999	DBLP DOI BibTeX RDF
1	Mikhail Nesterenko, Anish Arora	Stabilization-Preserving Atomicity Refinement.	DISC	1999	DBLP DOI BibTeX RDF
1	Injong Rhee	A Modular Algorithm for Resource Allocation.	Distributed Computing	1998	DBLP DOI BibTeX RDF	Modular construction, Message passing distributed systems, Concurrency, Resource allocation, Dining philosophers
1	Deepinder P. Sidhu, Alexander L. Wijesinha	Performance analysis of a constrained resource sharing system.	Queueing Syst.	1998	DBLP DOI BibTeX RDF	performance analysis, operating systems, performance measures, resource sharing, queueing models
1	Manhoi Choy, Ambuj K. Singh	Localizing Failures in Distributed Synchronization.	IEEE Trans. Parallel Distrib. Syst.	1996	DBLP DOI BibTeX RDF	fault-tolerance, distributed algorithms, Concurrency, synchronization, lower bounds
1	A. W. Roscoe, Paul H. B. Gardiner, Michael Goldsmith, J. R. Hulance, D. M. Jackson, J. B. Scattergood	Hierarchical Compression for Model-Checking CSP or How to Check 1020 Dining Philosophers for Deadlock.	TACAS	1995	DBLP DOI BibTeX RDF
1	Injong Rhee, Jennifer L. Welch	On the Time Complexity of the Dining Philosophers Problem.	PDPTA	1995	DBLP BibTeX RDF
1	Hans Fuss	True Simulation of Real Parallel Processes is Impossible. A Proof by the Five Dining Philosophers.	EUROSIM	1995	DBLP BibTeX RDF
1	Manhoi Choy, Ambuj K. Singh	Efficient Fault-Tolerant Algorithms for Distributed Resource Allocation.	ACM Trans. Program. Lang. Syst.	1995	DBLP DOI BibTeX RDF	committee coordination, failure locality, dining philosophers, distributed resource allocation
1	Keiichi Yasumoto, Teruo Higashino, Toshio Matsuura, Kenichi Taniguchi	Protocol visualization using LOTOS multi-rendezvous mechanism.	ICNP	1995	DBLP DOI BibTeX RDF
1	Giuseppe Persiano	An Optimal Algorithm for the Dining Philosophers Problem.	Parallel Processing Letters	1994	DBLP BibTeX RDF
1	Stephen J. Hartley	Animating operating systems algorithms with XTANGO.	SIGCSE	1994	DBLP DOI BibTeX RDF	X-Window, SR
1	Kamel Barkaoui, Claude Dutheillet, Serge Haddad	An Efficient Algorithm for Finding Structural Deadlocks in Colored Petri Nets.	Application and Theory of Petri Nets	1993	DBLP DOI BibTeX RDF
1	Manhoi Choy, Ambuj K. Singh	Distributed Job Scheduling Using Snapshots.	WDAG	1993	DBLP DOI BibTeX RDF
1	Debra Hoover, Joseph Poole	A Distributet Self-Stabilizing Solution to the Dining Philosophers Problem.	Inf. Process. Lett.	1992	DBLP DOI BibTeX RDF
1	John G. Vaughan	The dining philosophers problem and its decentralisation.	Microprocessing and Microprogramming	1992	DBLP DOI BibTeX RDF
1	Michael B. Feldman	The portable dining philosophers: a movable feast of concurrency and software engineering.	SIGCSE	1992	DBLP DOI BibTeX RDF	Ada
1	Stephen J. Hartley	Experience with the language SR in an undergraduate operating systems course.	SIGCSE	1992	DBLP DOI BibTeX RDF	SR
1	Elizabeth B. Weidman, Ivor P. Page, William J. Pervin	Explicit dynamic exclusion algorithm.	SPDP	1991	DBLP DOI BibTeX RDF
1	George H. Roberts	From Recursive Ascent to Recursive Descent: Via Compiler Optimizations.	SIGPLAN Notices	1990	DBLP DOI BibTeX RDF
1	Chung-Kuo Chang	Bidding Against Competitors.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	probability of winning, software engineering, software engineering, distributed processing, probability, bidding, mutual exclusion problem
1	Bruce Martin	Concurrent programming vs. concurrency control: shared events or shared data.	SIGPLAN Notices	1989	DBLP DOI BibTeX RDF
1	Kelly I. Morrison	GRASP: an executable specification language for Ada tasking.	ACM Conference on Computer Science	1988	DBLP DOI BibTeX RDF	Ada, GRASP
1	Patrick M. Lenders	Distributed microprogramming.	MICRO	1987	DBLP DOI BibTeX RDF
1	S. P. Rana, D. K. Banerji	An optimal distributed solution to the dining philosophers problem.	International Journal of Parallel Programming	1986	DBLP DOI BibTeX RDF
1	Deepinder P. Sidhu, Robert H. Pollack	A Robust Distributed Solution to the Generalized Dining Philosophers' Problem.	ICDE	1984	DBLP BibTeX RDF
1	Marie-Paule Flé, Gérard Roucairol	Fair serializability of iterated transactions using FIFO-nets.	European Workshop on Applications and Theory in Petri Nets	1984	DBLP DOI BibTeX RDF	maximal serializability, Petri-nets (FIFO-Nets), concurrency, fair
1	John H. Reif, Paul G. Spirakis	Probabilistic Bidding Gives Optimal Distributed Resource Allocation.	ICALP	1984	DBLP DOI BibTeX RDF
1	Thomas A. Cargill	A Robust Distributed Solution to the Dining Philosophers Problem.	Softw., Pract. Exper.	1982	DBLP DOI BibTeX RDF
1	S. P. Rana	Triple-Handed Dining Philosophers.	Operating Systems Review	1982	DBLP DOI BibTeX RDF
1	Horst Wedde	A Starvation-Free Solution of the Dining Philosopher's Problem by Use of Interaction Systems.	MFCS	1981	DBLP DOI BibTeX RDF
1	Hans-Jörg Kreowski	A Comparison Between Petri-Nets and Graph Grammars.	WG	1980	DBLP DOI BibTeX RDF