We prove that the reachability relation of two-counter machines with one zero-test and one
reset is Presburger-definable and effectively computable. Our proof is based on the …

Workflow nets are a well-established variant of Petri nets for the modeling of process
activities such as business processes. The standard correctness notion of workflow nets is …

The challenging development of modern systems can be eased through the usage of
appropriate models to simulate, evaluate and validate the system before hand. One well …

This paper deals with formal modeling and verification of reconfigurable hierarchical
discrete-event control systems (RDECSs). The system's behavior is with a dynamic structure …

In recent works we proposed a lazy algorithm for reachability analysis in networks of
automata. This algorithm is optimistic and tries to take into account as few automata as …

In this paper, we examine the synthesis problem from a finite labeled transition system when
the target is the class of weighted nets with (possibly) inhibitor and/or reset links, or some …

Fault prognosis has become a major scope for complex and interconnected systems. Such
significant events as fault events can cause partial or total stop of attempted functionalities …

Trong phát triển phần mềm, việc mô hình hóa và kiểm chứng phần mềm đóng vai trò quan
trọng, nhất là trong các hệ thống phần mềm ứng dụng doanh nghiệp. Trong nhiều nghiên …