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.
Filters
Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
NPLCS's are a new model for nondeterministic channel systems where unreliable communication is modeled by probabilistic message losses. ...
The symbolic procedure underlying our decidability proofs has been implemented and used to study a simple protocol handling two-way transfers in an unreliable setting. ...
This prompted us to introduce NPLCS's, i.e., channel systems where message losses are probabilistic and actions are nondeterministic [13, 14] . ...
doi:10.1007/11888116_17
fatcat:q3cnl2ejnfe4rbdpltbpyw4due
Liveness and Fairness in Process-Algebraic Verification
[chapter]
2001
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 2017; you can also visit the original URL.
The file type is application/pdf.
Although liveness and fairness have been used for a long time in classical model checking, with process-algebraic methods they have seen far less use. ...
One problem is combining fairness with the compositionality of process algebra. In this article we analyse this problem, and then present an approach for using a class of fairness constraints. ...
Acknowledgements This work has been funded by the TISE Graduate School and the Academy of Finland, projects "Unifying Action-Based and State-Based Verification Techniques" and "Compositional Verification ...
doi:10.1007/3-540-44685-0_14
fatcat:kzvnvtkphre2lmx7f6zso6iv6y
The Verification of Probabilistic Lossy Channel Systems
[chapter]
2004
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 2017; you can also visit the original URL.
The file type is application/pdf.
Several probabilistic versions of these systems have been proposed in recent years, with the two aims of modeling more faithfully the losses of messages, and circumventing undecidabilities by some kind ...
Lossy channel systems (LCS's) are systems of finite state automata that communicate via unreliable unbounded fifo channels. ...
Then, any message is lost with probability p loss (and kept with probability 1 − p loss ). 4. ...
doi:10.1007/978-3-540-24611-4_13
fatcat:3pnljttk2rhsrpl2q5jdgjqsum
Formal Specification and Verification of Communication in Network-On-Chip: An Overview
2018
International Journal of Recent Contributions from Engineering, Science & IT
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.
Network-On-Chip (NOC) is an emerging paradigm to surmount traditional bus based Systems-On-Chip (SOC) limits especially scalability and communication performances. ...
In this paper we try to giva an overview of the most famous formal methods applied to the verification of communication inside NOCs. ...
Using PRISM, the OASIS NOC behaves as a message buffer; receiving and delivering flits without any losses. ...
doi:10.3991/ijes.v6i4.9416
fatcat:7fljmcayfvdgpd7v3d4vt7lkvu
A Review of Verification and Validation for Space Autonomous Systems
2021
Current Robotics Reports
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.
In this paper, we discuss a number of approaches from the literature that are relevant or directly applied to the verification and validation of systems in space, with an emphasis on autonomy. ...
In particular, we focus on reporting the use of these techniques for the verification and validation of systems in space with an emphasis on autonomy, as well as more general techniques (such as in the ...
Some papers were identified via our work in the FAIR-SPACE Hub 1 and our interaction with the space research community. ...
doi:10.1007/s43154-021-00058-1
fatcat:srnbz3rlnvb25nootjukqbdvyi
The 10,000 Facets of MDP Model Checking
[chapter]
2019
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 2020; you can also visit the original URL.
The file type is application/pdf.
We discuss in particular the manifold facets of this field of research by surveying the verification of various MDP extensions, rich classes of properties, and their applications. ...
We survey the basic ingredients of MDP model checking and discuss its enormous developments since the seminal works by Courcoubetis and Yannakakis in the early 1990s. ...
Countably infinite variants of MDPs include probabilistic lossy channel systems [7] where message losses have a probabilistic behavior while the component finite-state processes behave nondeterministically ...
doi:10.1007/978-3-319-91908-9_21
fatcat:yjsuwb5ibjff3cq3niatu6sbxq
Modeling and Efficient Verification of Broadcasting Actors
[chapter]
2015
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 2020; you can also visit the original URL.
The file type is application/pdf.
However, the actor model for concurrent and distributed systems does not directly support this kind of communication. ...
In such cases, a broadcast must be modeled as multiple unicasts which leads to loss of modularity and state space explosion for any non-trivial system. ...
Rebecs communicate with other rebecs only through message-passing which is fair and asynchronous. ...
doi:10.1007/978-3-319-24644-4_5
fatcat:jrhgl7v5kzfw7mubrnvnk6qz7q
Twenty Years of Rewriting Logic
[chapter]
2010
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 2014; you can also visit the original URL.
The file type is application/pdf.
and verification, security, real-time and cyber-physical systems, probabilistic systems, bioinformatics and chemical systems. ...
Rewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality. ...
I thank the organizers of WRLA 2010 for giving me the opportunity and the stimulus to do some reflecting, surveying, and guessing about rewriting logic at this point, when twenty years have passed since ...
doi:10.1007/978-3-642-16310-4_2
fatcat:ho7s76r67nc63bndpoptbh5k4e
Twenty years of rewriting logic
2012
The Journal of Logic and Algebraic Programming
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.
and verification, security, real-time and cyber-physical systems, probabilistic systems, bioinformatics and chemical systems. ...
Rewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality. ...
I thank the organizers of WRLA 2010 for giving me the opportunity and the stimulus to do some reflecting, surveying, and guessing about rewriting logic at this point, when twenty years have passed since ...
doi:10.1016/j.jlap.2012.06.003
fatcat:5tx4a5uxlvapfpf5fajozkbboi
Automatic Synthesis of Distributed Protocols
2017
ACM SIGACT News
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.
Traditionally a distributed protocol is modeled as a set of communicating finite-state processes. The correctness is specified by both safety and liveness requirements. ...
model of the environment, and given a set of safety and liveness requirements, find a completion of the FSMs for the processes such that the composition satisfies all the requirements. ...
We would also like to thank Milo Martin, Mukund Raghothaman, Christos Stergiou, and Abhishek Udupa, our co-authors of earlier work [6] upon which this paper is based. ...
doi:10.1145/3061640.3061652
fatcat:qgpyesxc3jcrfaztpag4zqb4e4
Simulating perfect channels with probabilistic lossy channels
2005
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 2017; you can also visit the original URL.
The file type is application/pdf.
Under assumptions of "sufficiently high" probability of loss, Baier and Engelen have shown how to check whether a property holds of probabilistic lossy channel system with probability 1. ...
We focus our attention on the model of probabilistic lossy channel systems consisting of finite-state processes that communicate over unbounded lossy FIFO channels. ...
Given that we are dealing with imperfections in the communication medium it is then natural to consider models of communicating processes where the probability of message loss is taken into account. ...
doi:10.1016/j.ic.2004.12.001
fatcat:yqkdeqcyknablkw5h47lh5ppke
On Model Checking Techniques for Randomized Distributed Systems
[chapter]
2010
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 automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision process and a formalization of ...
In particular, all possible interleavings and resolutions of other nondeterministic choices in the system model are taken into account. ...
unreliable fifo channel that looses or corrupts messages with some small (fixed) probability. ...
doi:10.1007/978-3-642-16265-7_1
fatcat:eqero55ks5aqfgergnodjxcpay
From software verification to 'everyware' verification
2013
Computer Science - Research and Development
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 2016; you can also visit the original URL.
The file type is application/pdf.
The research involves investigating the fundamentals of quantitative verification, development of algorithms and prototype implementations, and experimenting with case studies. ...
In this paper we describe the objectives and initial progress of the research aimed at extending the capabilities of quantitative, probabilistic verification to challenging ubiquitous computing scenarios ...
Probabilistic modelling and verification constitute a useful framework to enable quantitative analysis of risks and the impact of component failures and communication delays on implantable devices. ...
doi:10.1007/s00450-013-0249-1
fatcat:yijv5tfqwjb5rlopsnmy6gpsf4
Model Checking Round-Based Distributed Algorithms
2010
2010 15th IEEE International Conference on Engineering of Complex Computer 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 2016; you can also visit the original URL.
The file type is application/pdf.
We can manage to transform their state spaces into finite by maintaining such relations in a proper way, and thus make automatic verification of these algorithms possible. ...
We apply this idea to several algorithms and present their verification results in the model checker Spin. ...
Failures of these systems can be potentially disastrous, and cause the loss of a huge amount of money or even human lives. ...
doi:10.1109/iceccs.2010.38
dblp:conf/iceccs/AnP10
fatcat:rxelymrewjc5dkfvnjvvjrud2y
A tool for model-checking Markov chains
2003
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 2017; you can also visit the original URL.
The file type is application/pdf.
Markov chains are widely used in the context of the performance and reliability modeling of various systems. ...
Model checking of such chains with respect to a given (branching) temporal logic formula has been proposed for both discrete [10, 34] and continuous time settings [7, 12] . ...
The co-operation between the research groups in Twente and Erlangen-Nürnberg takes place in the context of the project Validation of Stochastic Systems which is funded by the Dutch NWO and the German DFG ...
doi:10.1007/s100090100072
fatcat:4esvw6acwjbljayyljaxa4g4ru
« Previous
Showing results 1 — 15 out of 1,418 results