240 search results - page 39 / 48 » Infinite trace equivalence |
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
We investigate the complexity of preorder checking when the specification is a flat finite-state system whereas the implementation is either a non-flat finite-state system or a st...
FORTE
2009
13 years 6 months ago
2009
We propose an epistemic logic for the applied pi calculus, which is a variant of the pi calculus with extensions for modeling cryptographic protocols. In such a calculus, the secur...
JAPLL
2010
13 years 3 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
TON
2012
11 years 11 months ago
2012
—The inherent measurement support in routers (SNMP counters or NetFlow) is not sufficient to diagnose performance problems in IP networks, especially for flow-specific problem...
PARLE
1989
14 years 19 days ago
1989
We explore an algebraic language for networks consisting of a xed number of reactive units, communicating synchronously over a xed linking structure. The language has only two ope...