September 2002
Intermediate to advanced
560 pages
13h 16m
English
book
VRRP: Increasing Reliability and Failover with the Virtual Router Redundance Protocol
by Ayikudy Srikanth, Adnan Adam Onart
Content preview from VRRP: Increasing Reliability and Failover with the Virtual Router Redundance Protocol
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
E.8. List of Symbolic Assertions and Norms
Not only the preciseness, but also the conciseness of the logical language is a major advantage, since it enables us to see the essential principles of a certain domain. To take advantage of this feature of logical symbolism, we include in this section the list of assertions and norms we have discussed in their symbolic forms:
Ownership and Priority
| A-(1) | ∀x (O(x) → prio(x) = 255) |
| A-(2) | ∀x (prio(x) = 255 → O(x)) |
| A-(3) | ∀x (O(x) ↔ prio(x) = 255) |
| A-(4) | ∀x (¬O(x) ↔ prio(x) ≠ 255) |
| A-(5) | ∀x ∀y[(O(x) ∧ O(y) )→ x = y] |
| A-(6) | ∀x ∀y[(prio(x) = 255 ∧ prio(y) = 255)→ x = y] |
| A-(7) | ∀x (∃y (O(y) ∧ y t x) → ¬∀z(prio(x) > prio(z) ) |
Backing up
| A-(8) | ∀x (∃yB(y, x) → O(x) ) |
| A-(9) | ∀x ∀y ∀z ∀w{ [B(x, y) ∧ B(w, z)] → y = z ... |
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.