3 papers
cs.CC2018
Positive 1-in-3-SAT admits a non-trivial Kernel
Valentin Bura
We illustrate the strength of Algebraic Methods, adapting Gaussian Elimination and Substitution to the problem of Exact Boolean Satisfiability. For 1-in-3 SAT with non-negated lite…
cs.LO2017
Trace Expressiveness of Timed and Probabilistic Automata
Valentin Bura, Tim French, Mark Reynolds
Automata expressiveness is an essential feature in understanding which of the formalisms available should be chosen for modelling a particular problem. Probabilistic and stochastic…
cs.LO2017
Timed Automata with Polynomial Delay and their Expressiveness
Valentin Bura, Tim French, Mark Reynolds
We consider previous models of Timed, Probabilistic and Stochastic Timed Automata, we introduce our model of Timed Automata with Polynomial Delay and we characterize the expressive…