A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Filters
On Verifying Fair Lossy Channel Systems
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. ...
In this paper, we show that fair termination is decidable for a large class of these systems. ...
Strongly fair termination and weakly fair termination are decidable for lossy channel systems without multiplexed channel. ...
doi:10.1007/3-540-45687-2_45
fatcat:zx6c6f6hwfgmhgj3sugfhtolge
Undecidable Verification Problems for Programs with Unreliable Channels
1996
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We consider the class of finite-state systems communicating through unbounded but lossy FIFO channels (called lossy channel systems). ...
In an earlier paper, we showed that the problems of checking reachability, safety properties, and eventuality properties are decidable for lossy channel systems. ...
on channel c, replacing message losses by message receptions, and it performs some additional operations on the new alphabet symbol l. The steps of ?$ are defined by the following five cases. ...
doi:10.1006/inco.1996.0083
fatcat:vefnrgyd6ncgfintje4vkq6y2q
Model Checking Lossy Channels Systems Is Probably Decidable
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
properties over states, and fair termination are decidable for lossy channel systems [Fin94,CFP96,AJ96b,MS02]. ...
Surprisingly, while channel systems are Turing-powerful [BZ83], several verification problems become decidable when one assumes channels are lossy: reachability, safety properties over traces, inevitability ...
Verifying probabilistic lossy channel systems combines issues from the verification of infinite-state systems and from the verification of probabilistic systems 1 . ...
doi:10.1007/3-540-36576-1_8
fatcat:rb2bcsnxivexjorblakumhdhaa
Decidability of Liveness on the TSO Memory Model
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
An important property of concurrent objects is whether they support progress -a special case of liveness-guarantees, which ensure the termination of individual method calls under system fairness assumptions ...
However, the problem of decidability of liveness for finite state concurrent programs running on relaxed memory models remains open. ...
on a close connection of concurrent programs on TSO and lossy channel machines [2, 20] . ...
arXiv:2107.09930v1
fatcat:ey3zjrppdzd23cksyafi3ksw2y
Linking Theorem Proving and Model-Checking with Well-Founded Bisimulation
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
We also show that the alternating bit protocol is a refinement of a non-lossy system. ...
We use theorem proving to show a bisimulation up to stuttering on a-potentially infinite-state-system. ...
Acknowledgments J Moore was always available to discuss ACL2; he also read and commented on substantial parts of the proof script. ...
doi:10.1007/3-540-48683-6_32
fatcat:dgigcrt7ujfodlawdgv5g7rfni
Towards Verified Java Code Generation from Concurrent State Machines
2014
ACM/IEEE International Conference on Model Driven Engineering Languages and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We present work in progress on, verified, transformation of a modeling language based on communicating concurrent state machines, slco, to Java. ...
Some concurrency related challenges, related to atomicity and non-standard fairness issues, are pointed out. We discuss solutions based on Java synchronization concepts. ...
They are connected to the channels via their ports. slco offers three types of channels: synchronous, asynchronous lossless, and asynchronous lossy channels. ...
dblp:conf/models/ZhangBBEHKW14
fatcat:gx2ta4ltpnayxlb3zzueuanuta
Verifying Programs with Unreliable Channels
1996
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We consider the veri cation of a particular class of in nite-state systems, namely systems consisting of nite-state processes that communicate via unbounded lossy FIFO channels. ...
Our results should be contrasted with the well-known fact that these problems are undecidable for systems with unbounded perfect FIFO channels. ...
We make no assumption on fairness in the channels. Thus a system may fail to meet a certain eventuality property because the channels lose all their messages. ...
doi:10.1006/inco.1996.0053
fatcat:jatgzqxe35bedhkpns75iblaoi
Globally Optimal Solutions for Cross-Layer Design in Fast-Fading Lossy Delay-Constrained MANETs
2015
Journal of Korea Multimedia Society
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Finally, simulation results verify that our proposal achieves considerable benefits over the existing method. ...
The non-convex formulated problem is transformed into a convex one, which is solved by exploiting the duality technique. ...
Followed from [4] , each link is modeled as a queuing system. Let be the sum of the transmission delay and queuing delay on link . ...
doi:10.9717/kmms.2015.18.2.168
fatcat:jhsouxwgozanvb2b2cqwwmu22y
Fairness characterization in contemporary IEEE 802.11 deployments with saturated traffic load
2014
Proceedings of 15th Conference of Open Innovations Association FRUCT
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
However, currently used saturation based analysis may be applied only for fair systems, hence, the question arises which system may be considered as fair. ...
So, we propose a novel metric to define fairness. ...
SYSTEM DESCRIPTION AND ANALYSIS IMPROVEMENT In the following, we firstly focus to the lossless system and secondly to the analysis of the lossy one. ...
doi:10.1109/fruct.2014.6872427
dblp:conf/fruct/Ometov14
fatcat:cktfkns42nhivplobko6sknhq4
Decidability of simulation and bisimulation between lossy channel systems and finite state systems
[chapter]
1995
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
is bisimilar to a state in a lossy channel system, and (3) whether a state in a nite transition system weakly simulates a state in a lossy channel system. ...
transition system is weakly bisimilar to a state in a lossy channel system. ...
More precisely, we showed that both model checking and verifying eventuality properties under the assumption that the channels are fair are undecidable. ...
doi:10.1007/3-540-60218-6_25
fatcat:3j2k7zjn6vgndorz5mq4vpf6py
Model-checking web services business activity protocols
2012
International Journal on Software Tools for Technology Transfer (STTT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In order to verify fundamental properties of the protocols we provide formal analyses in the model checker Uppaal. ...
Another important property of communication protocols is that all parties always reach, under certain fairness assumptions, their final states. ...
The claim that a certain communication medium is unbounded can be automatically verified only up to a certain (constant) capacity of the channels. ...
doi:10.1007/s10009-012-0231-4
fatcat:sbrxwgdpujdmnbat5yowrpbto4
Fairness Based Dynamic Routing Technique (FsBDRT) in Wireless Mesh Network
2013
Research Journal of Information Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
In this study we propose a Fairness Based Dynamic Routing Technique (FsBDRT) a dynamic routing mechanism to adapt an optimal path, as well as identification of lossy channel becomes due to congestion. ...
These multiple paths are ultimately figured out using dynamic routing, which not only improves performance but also provides reliability, especially in presence of lossy channels. ...
Mesh routers can be designed on the basis of embedded systems or dedicated computer systems. They can also be developed based on laptop/desktop PCs or generalpurpose computer systems. ...
doi:10.19026/rjit.5.5793
fatcat:p7v6ughx3ndwfeclgqayjxzfli
Using a DSL and Fine-Grained Model Transformations to Explore the Boundaries of Model Verification
2011
2011 Fifth International Conference on Secure Software Integration and Reliability Improvement - Companion
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Traditionally, the state-space explosion problem in model checking is handled by applying abstractions and simplifications to the model that needs to be verified. ...
ACKNOWLEDGEMENTS We would like to thank Anton Wijs and Dragan Bošnački for their valuable feedback on our work. ...
This project is partially supported by the Netherlands Ministry of Economic Affairs under the Embedded Systems Institute (BSIK03021) program. ...
doi:10.1109/ssiri-c.2011.26
dblp:conf/ssiri/AmstelBE11
fatcat:7uk46jwl5ncjfhyxohl3dm5lhy
Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The techniques extend smoothly to questions where fairness restrictions are imposed on the schedulers. ...
NPLCS's are a new model for nondeterministic channel systems where unreliable communication is modeled by probabilistic message losses. ...
However, in lossy systems, arbitrary messages can be lost. ...
doi:10.1007/11888116_17
fatcat:q3cnl2ejnfe4rbdpltbpyw4due
Verification of Flat FIFO Systems
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We also show that reachability is NP-complete for flat lossy FIFO machines and for flat front-lossy FIFO machines. ...
Our results lay the theoretical foundations and open the way to build a verification tool for (general) FIFO machines based on analysis of flat sub-machines. ...
But real systems of FIFO systems are often not reduced to an unique FIFO machine. Let us show how results on flat FIFO machines can be used to verify systems of communicating FIFO machines. ...
arXiv:1908.07282v5
fatcat:6ruu3mg2gzggldlksyywhthbki
« Previous
Showing results 1 — 15 out of 2,434 results