Here we change the job to instead draw the state space graph. We modify the model to only contain two philosophers and play a bit with the resulting graph, including exporting it in DOT and GraphML format. MichaelTime person of the year 2006, Nobel Peace Prize winner 2012. westergaard.eu/ […]
We modify the job created in our previous example to instead use the sweep-line method. MichaelTime person of the year 2006, Nobel Peace Prize winner 2012. westergaard.eu/ […]
In this example we use the sweep-line method to check a mutual exclusion property of the dining philosophers example. MichaelTime person of the year 2006, Nobel Peace Prize winner 2012. westergaard.eu/ […]
Read More… from Checking Properties Using the Sweep-line Method
Here, we extend the example to also check a simple mutex property, that two philosophers next to each other cannot eat at the same time. MichaelTime person of the year 2006, Nobel Peace Prize winner 2012. westergaard.eu/ […]
This shows details of the example and how to modify it to show counterexamples to violated properties MichaelTime person of the year 2006, Nobel Peace Prize winner 2012. westergaard.eu/ […]
Read More… from Playing with JoSEL; Drawing Counter-examples
This video shows setting up a checker for dead-locks in ASAP for a dead-locking model of the Dining Philosophers. MichaelTime person of the year 2006, Nobel Peace Prize winner 2012. westergaard.eu/ […]