Voltar
Artigo Acesso aberto Revisado por pares
BIBTEX RIS

ON YEN'S PATH LOGIC FOR PETRI NETS

2011; World Scientific; Volume: 22; Issue: 04 Linguagem: Inglês

10.1142/s0129054111008428

ISSN

1793-6373

Autores

Mohamed Faouzi Atig, Peter Habermehl,

Tópico(s)

Logic, Reasoning, and Knowledge

Resumo

In [19], Yen defines a class of formulas for paths in Petri nets and claims that its satisfiability problem is EXPSPACE-complete. In this paper, we show that in fact the satisfiability problem for this class of formulas is as hard as the reachability problem for Petri nets. Moreover, we salvage almost all of Yen's results by defining a fragment of this class of formulas for which the satisfiability problem is EXPSPACE-complete by adapting his proof.

Referência(s)