19 search results - page 2 / 4 » Model Checking Lossy Channels Systems Is Probably Decidable |
LICS
1993
IEEE
13 years 9 months ago
1993
IEEE
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. T...
CAV
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
QEST
2008
IEEE
13 years 11 months ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
IFM
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. 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 ...
CORR
2011
Springer
13 years 5 days ago
2011
Springer
: Much of the current theory of networked control systems uses simple point-to-point communiodels as an abstraction of the underlying network. As a result, the controller has very ...