A symbolic constraint automaton is encoded, in Promela, as a proctype. A Promela proctype has a name, a signature, and a body. The Spin model checker executes ...
To demonstrate the executability property, we provide a translation scheme from symbolic constraint automata to Promela, the language of the model checker Spin.
To demonstrate the executability property, we provide a translation scheme from symbolic constraint automata to Promela, the language of the model checker Spin.
From Symbolic Constraint Automata to Promela | Request PDF
www.researchgate.net › publication › 36...
To demonstrate the executability property, we provide a translation scheme from symbolic constraint automata to Promela, the language of the model checker Spin.
From symbolic constraint automata to Promela. https://doi.org/10.1016/j.jlamp.2022.100794. Journal: Journal of Logical and Algebraic Methods in Programming ...
We introduce and evaluate a method for symbolically expressing and solving constraints over automata, including subset constraints.
Missing: Promela. | Show results with:Promela.
We introduce Symbolic Alternating Finite Automata (s-AFA) as a succinct and decidable model for describ- ing sets of finite sequences over arbitrary alphabets.
We introduce and evaluate a method for symbolically expressing and solv- ing constraints over automata, including subset constraints. Our method uses techniques ...
Missing: Promela. | Show results with:Promela.
p2b is a research tool that translates Promela programs to boolean representations of the automata associated with them. These representations con- form to the ...
A regular expression or pattern is transformed into a symbolic finite automaton having transitions that are labeled by formulas that denote sets of characters ( ...