528 search results - page 75 / 106 » Transition Logic Revisited |
110
click to vote
FORTE
1994
15 years 3 months ago
1994
We discuss four issues concerning the semantics of Message Flow Graphs (MFGs). MFGs are extensively used as pictures of message-passing behavior. One type of MFG, Message Sequence...
156
click to vote
MST
2006
15 years 1 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
103
click to vote
TCAD
2002
15 years 1 months ago
2002
We develop a general methodology to analyze crosstalk effects that are likely to cause errors in deep submicron high speed circuits. We focus on crosstalk due to capacitive coupli...
116
click to vote
IANDC
2010
15 years 13 days ago
2010
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
136
click to vote
CAV
2012
Springer
13 years 4 months ago
2012
Springer
Craig interpolation is a well known method of abstraction successfully used in both hardware and software model checking. The logical strength of interpolants can affect the quali...