Creating Buchi Automaton to Accept Property

  • Thread starter Thread starter dork
  • Start date Start date
AI Thread Summary
The discussion focuses on creating a Büchi automaton that accepts a property where either proposition p is true forever or p is true until proposition q becomes true. The proposed solution involves three states: S0 as the start state, S1 and S2 as accepting states. Transitions are defined such that S0 moves to S1 if p is true and q is false, while S1 transitions to S2 if either p is false and q is true or p is true and q is true. S1 loops when p is true and q is false, and S2 loops for all conditions. The user seeks validation of their solution and invites corrections if necessary.
dork
Messages
4
Reaction score
0

Homework Statement



Give a buchi automaton that accepts the following property
either p is true forever, or p is true until q becomes true

Homework Equations



check my answer if its right and correct if wrong


The Attempt at a Solution



Three states. Goes to p it loops and its final state.
or goes p then loops and if then goes q its final state and accepted
 
Physics news on Phys.org
Three states.
S0, S1 AND S2.
S1 AND S2 ACCEPT STATES
FROM S0 TO S1 IF IT IS P AND NOT Q . FROM S1 TO S2 IF IT IS( P NOT Q) OR (NOT P AND Q)

FROM S0 TO S2 IF IT IS P AND Q .
ON S1 IT LOOPS IF IT IS P AND NOT Q.
S2 LOOPS FOR EVERYTHING
 
S0 Is The Start State

Hope I Solved Everything Right.please Correct Me
 

Similar threads

Replies
10
Views
2K
Replies
11
Views
2K
Replies
11
Views
2K
Replies
9
Views
2K
Replies
5
Views
2K
Replies
10
Views
2K
Replies
9
Views
3K
Back
Top