CinRC / IRDC-CCSK

Java implementation of distributed reversible computation verification
https://spots.augusta.edu/caubert/cinrc/
GNU General Public License v3.0
4 stars 2 forks source link

Picking which label to act upon #5

Closed aubertc closed 2 years ago

aubertc commented 2 years ago

When multiple transitions with the same labels are possible, we should have ways of indicating which one we want to reduce along.

java -jar RCCS-1.0-SNAPSHOT.jar "a.P | a.Q"
Create a.P
Walking... Memory: a
Walking... Memory: a.
Adding a. to prefixes
Walking... Memory: P
Create a.Q
Walking... Memory: a
Walking... Memory: a.
Adding a. to prefixes
Walking... Memory: Q
Formula before complex init and minimization: a.P(|)a.Q

Minimizing and initializing function...
Formula after complex init and minimization: (a.P|a.Q)
(a.P|a.Q)
Please type the label you'd like to act on:
a
(a.P|a.Q) -a-> (P|Q)

We should be able to reduce to either a.P | Q or P | a.Q.

peterbro1 commented 2 years ago

Implemented