66 search results - page 6 / 14 » Diagnosability of bounded Petri nets |
APN
2007
Springer
14 years 1 months ago
2007
Springer
Most information systems that are driven by process models (e.g., workflow management systems) record events in event logs, also known as transaction logs or audit trails. We cons...
ASP
2001
Springer
14 years 2 days ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier w...
ENTCS
2008
13 years 7 months ago
2008
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
TII
2011
13 years 2 months ago
2011
Abstract—Software systems that do not meet their timing constraints can cause risks. In this work, we propose a comprehensive method for assessing the risk of timing failure by e...
ATVA
2007
Springer
13 years 11 months ago
2007
Springer
