528 search results - page 33 / 106 » Transition Logic Revisited |
132
click to vote
ESAS
2004
Springer
15 years 7 months ago
2004
Springer
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...
132
Voted
LOGCOM
2002
15 years 1 months ago
2002
One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if...
137
click to vote
MOVEP
2000
15 years 5 months ago
2000
We survey principles of model checking techniques for the automatic analysis of reactive systems. The use of model checking is exemplified by an analysis of the Needham-Schroeder p...
140
click to vote
FOSSACS
1999
Springer
15 years 6 months ago
1999
Springer
This paper presents a mu-calculus-based modal logic for describing properties of reactive probabilistic labeled transition systems (RPLTSs) and develops a modelchecking algorithm ...
116
click to vote
ACSD
2004
IEEE
15 years 5 months ago
2004
IEEE
The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of...