Results 161 to 170 of about 683 (202)

Deadlock-freedom in component systems with architectural constraints

Formal Methods in System Design, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mila Majster-Cederbaum   +1 more
exaly   +3 more sources

Freedom from Deadlock of Safe Locking Policies

SIAM Journal on Computing, 1982
The usual method for preserving the consistency of a database when accessed (read and updated) concurrently by several transactions, is by locking the transactions according to some locking policy; a locking policy that guarantees the preservation of consistency of the database is called safe. Furthermore, if no deadlocks can arise the policy is called
exaly   +3 more sources

Deadlock-Freedom in Computational Neuroscience Simulators

IEEE Design and Test, 2022
Vida Sobhani   +2 more
exaly   +2 more sources

A method for verifying deadlock freedom and liveness of petri nets

2008 IEEE International Symposium on Circuits and Systems (ISCAS), 2008
A well-known sufficient condition for a Petri net to be deadlock-free is that every siphon contains a marked trap. This property is called the marked siphon-trap property and it is also sufficient and necessary for characterizing liveness of some subclasses of Petri nets. This paper shows that deadlock freedom of general Petri nets and liveness of some
exaly   +2 more sources

Deadlock-freedom in resource contentions

Acta Informatica, 1985
Processes that compete for the use of scarce resources may maneuver themselves into a deadlock situation. The paper establishes two necessary and sufficient conditions that guarantee the absence of deadlock under the expedient allocation policy. Their equivalence is proved. It is shown that the condition for deadlock-freedom is just another form of the
Chen, M.C., Rem, M.
openaire   +1 more source

Home - About - Disclaimer - Privacy