We introduce a new class of Petri nets, simple logic Petri nets (SLPN). We show how this type of nets can be efficiently mapped into logic programs with negation: the corresponding answer sets describe interleaved executions of the underlying Petri nets. We also show how to model and specify AgentSpeak agents with SLPN’s. This allows us to solve the task of model checking AgentSpeak agents by c...

secure electronic transaction (set) protocol is an open protocol, which has the potential to emerge as a powerful tool in securing of electronic transactions. the quality of a design of an ecommerce protocols has a great influence on achieving non-functional requirements (nfrs) to the system. an increasingly important non-functional attribute of complex software systems is adaptability. softwar...

We show that there are Σ3-complete languages of infinite words accepted by non-deterministic Petri nets with Büchi acceptance condition, or equivalently by Büchi blind counter automata. This shows that ω-languages accepted by non-deterministic Petri nets are topologically more complex than those accepted by deterministic Petri nets.

Scheduling problems have been approached several times by Petri nets. Indeed, the usage of a net model guarantees feasibility candidate solutions, but it does not provide an accurate evaluation time required to complete considered workshop. For this purpose, class timed nets, namely structured is defined and encoding structure information such nets as tree presented. This encoding, in combinati...