Login / Signup
Adding the Relation Meets to the Temporal Logic of Prefixes and Infixes makes it EXPSPACE-Complete.
Laura Bozzelli
Angelo Montanari
Adriano Peron
Pietro Sala
Published in:
GandALF (2021)
Keyphrases
</>
temporal logic
model checking
satisfiability problem
pspace complete
modal logic
concurrent systems
verification method
mazurkiewicz traces
computation tree logic
belief revision
domain specific
transition systems
automata theoretic
search algorithm
symbolic model checking