Model Checking Synchronized Products of Infinite Transition Systems

Authors:
Stefan Wohrle;Wolfgang Thomas
Affiliations:
RWTH Aachen, Germany;RWTH Aachen, Germany
Venue:
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Year:
2004

Citing 0
Cited 6

On compositionality and its limitations

ACM Transactions on Computational Logic (TOCL)
The Compositional Method and Regular Reachability

Electronic Notes in Theoretical Computer Science (ENTCS)
Unary automatic graphs: An algorithmic perspective

Mathematical Structures in Computer Science
Compositional failure detection in structured transition systems

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Some perspectives of infinite-state verification

ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
LTL-Model-Checking via model composition

RP'12 Proceedings of the 6th international conference on Reachability Problems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a concise and natural encoding of the spi-calculus into the more basic 驴-calculus and establish its correctness with respect to a formal notion of testing.This is particularly relevant for security protocols modelled in spi since the tests ...