Conflicting perspectives on forests has for a long time challenged forest policy development in Sweden. Disagreements about forest futures create intractable deadlocks when stakeholders talk past each other. The purpose of this study is to move beyond this situation through the application of participatory backcasting. By comparing visions of the future forest among stakeholder groups, we highl...

The behaviour of a distributed system is largely determined by the use of synchronization primitives and threading policies of the underlying middleware. The inherent parallel nature of distributed systems may cause liveness problems, such as deadlocks and livelocks. An increasing number of distributed systems is built using object middleware. We exploit the fact that modern object middleware o...

We describe the Gadara project, a research effort whose goal is to eliminate certain classes of concurrency bugs in multithreaded software by controlling the execution of programs at run-time. The Gadara process involves three stages: modeling of the source code at compile time in the form of a Petri net, feedback control synthesis, and control logic implementation into the source code. The fee...

The combination of message passing and locking to protect shared state is a useful concurrency pattern. However, programs that employ this pattern are susceptible to deadlock. That is, the execution may reach a state where each thread in a set waits for another thread in that set to release a lock or send a message. This paper proposes a modular verification technique that prevents deadlocks in...

The competition for limited resources can produce deadlocks in flexible manufacturing systems (FMS). Petri nets are an effective way to model, analyze, and control deadlocks in FMS. Our previous work proposes elementary siphons as an important concept in investigating the deadlock problems in Petri nets. This paper presents an elementary siphon-based deadlock prevention method. It then performs...

The success of model checking is based on its ability to uncover errors in designs of software and protocols. Even a small reactive concurrent system can exhibit complex behavior. Such systems may have state-spaces larger than explicit state model checkers can verify. In practice, finding an error with a model checker is more useful than proving a property. Informed search algorithms use heuris...

The state-of-art of the technology focuses on data processing to deal with massive amount of data. Cloud computing is an emerging technology, which enables one to accomplish the aforementioned objective, leading towards improved business performance. It comprises of users requesting for the services of diverse applications from various distributed virtual servers. The cloud should provide resou...

This paper presents a new algorithm for the detection and resolution of communication deadlocks in distributed systems. The algorithm is based on some well known concepts for distributed deadlock detection and adds some new features to reduce message-and space complexity. It was implemented on a transputer network and shown to be more eecient than previously published algorithms.

A common task in business process modelling is the verification of process models regarding syntactical and structural errors. While the former might be checked with low efforts, the latter usually requires a complex state-space analysis to prove properties like deadlock-freedom of the models. In this paper, we address the issue of deadlock detection with a novel approach based on business proc...