Towards a correct and efficient implementation of simulation and verification tools for probabilistic ntcc
Abstract
We extended our simulation tool Ntccrt for probabilistic ntcc (pntcc) models. In addition, we developed a verification tool for pntcc models. Using this tool we can prove properties such as the system will go to a successful state with probability p under t discrete time- units. Currently, we are facing a few problems. We can only verify pntcc models using a finite domain constraint system and the encoding of cells ( mathematical entities that can update their value ) is experimental. In addition, in order to reduce the states generated during the verification process we need to implement a procedure to calculate whether two processes are equivalent. In the future, we want to provide multiple interfaces for the tools (e.g., a web ap- plication, a graphical interface and command line interface). We also want to support constraint systems over trees, graph and sets. We want to show the relevance of our tool to model biological and multimedia interaction systems in our tool, verify some properties about them, and simulate such systems in our real-time capable interpreter.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.