Normed simulations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1427 LNCS, Issue , 1998, Pages 332-344

  Griffioen, David ^a,b   Vaandrager, Frits ^b  

^a CWI   (Netherlands)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; SEMANTICS;

HIGH-LEVEL SYSTEMS; LEADER ELECTION ALGORITHM; LOW-LEVEL SYSTEMS; NON-DETERMINISM; PROOF METHODS; SEMANTIC LEVELS; SIMULATION RELATION; SPECIFICATION LOGIC;

COMPUTER AIDED ANALYSIS;

EID: 84863893604     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0028756     Document Type: Conference Paper

References (19)

1. M. Abadi and L. Lamport. The exist ence of refinement mappings. Theoretical Computer Science, 82(2):253-284, 1991.
2. S. Bensalem, Y. Lakhnech, and H. Saidi. Powerful techniques for the automatic generation of invariants. In Proc. CAV'96, LNCS 1102, pp 323-335. Springer, 1996. (Pubitemid 126101292)
3. M. Browne, E. Clarke, and O. Grümberg. Characterizing finite Kripke structures in prepositional temporal logic. Theoretical Comp. Sci., 59(1,2):115-131, 1988.
4. R. De Nicola and F. Vaandrager. Three logics for branching bisimulation. Journal of the ACM, 42(2):458-487, 1995.
5. M. Devillers, W. Griffioen, and O. Müller. Possibly infinite sequences: A comparative case study. In Proc. TPHOLs'97, LNCS 1275, pp 89-104. Springer, 1997. (Pubitemid 127112658)
6. M. Devillers, W. Griffioen, J. Romijn, and F. Vaandrager. Verification of a leader election protocol - formal methods applied to IEEE 1394. Technical Report CSI-R9728, University of Nijmegen, 1997.
7. S. Garland, N. Lynch, and M. Vaziri. IOA: A language for specifiying, programming, and validating distributed systems, September 1997. Available through http://larch.les.mit.edu:8001/~garland/ioaLanguage.html.
8. th ICALP, LNCS 820. Springer, 1994. A full version appears as MIT Technical Report MIT/LCS/TR-587.
9. R. van Glabbeek and W. Weijland. Branching time and abstraction in bisimulation semantics. Journal of the ACM, 43(3):555-600, 1996. (Pubitemid 126607643)
10. J. Groote and J. Springintveld. Focus points and convergent process operators - a proof strategy for protocol verification. Report CS-R9566, CWI, 1995.
11. L. Helmink, M. Sellink, and F. Vaandrager. Proof-checking a data link protocol. In Proc. TYPES'93, LNCS 806, pp 127-165. Springer, 1994.
12. IEEE Computer Society. IEEE Standard for a High Performance Serial Bus. Std 1394-1995, August 1996.
13. N. Lynch and F. Vaandrager. Forward and backward simulations, I: Untimed systems. Information and Computation, 121(2):214-233, 1995.
14. K. Namjoshi. A simple characterization of stuttering bisimulation. In Proc. FST & TCS'97, LNCS 1346, pp 284-296. Springer, 1997. (Pubitemid 128006682)
15. T. Nipkow and K. Slind. I/O automata in IsabeEe/HOL. In Types for Proofs and Programs, LNCS 996, pp 101-119. Springer, 1995.
16. S. Owre, J. Rushby, N. Shankar, and F. von Henke. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2):107-125, 1995.
17. A. Sistla. Proving correctness with respect to nondeterministic safety specifications. Information Processing Letters, 39(1):45-49, 1991. (Pubitemid 21713668)
18. J. Søgaard-Andersen, S. Garland, J. Guttag, N. Lynch, and A. Pogosyants. Computer-assisted simulation proofs. In Proc. CAV'93, LNCS 697, pp 305-319. Springer, 1993.
19. J. Søgaard-Andersen, N. Lynch, and B. Lampson. Correctness of communication protocols - a case study. Report MIT/LCS/TR-589, MIT, Cambridge, MA, 1993.