Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
The paper presents an extensible Petri Net Markup Language (xPNML), which is an extended version of PNML. The xPNML format overcomes limitations associated with PNML structure for...
This paper considers the model of Time Petri Nets (TPNs) extended with time parameters and its use to perform on-line diagnosis of distributed systems. We propose to base the metho...
Bartosz Grabiec, Louis-Marie Traonouez, Claude Jar...
Business Process Management (BPM) is often a key component of the business change. Business rules, whether embedded within BPM or on their own, have begun playing an ever-increasi...
The aim of this paper is to find the finest `observable' and `implementable' equivalence on concurrent processes. This is a part of a larger programme to develop a theor...