47 search results - page 9 / 10 » Decidability Problems in Petri Nets with Names and Replicati... |
CAV
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
APN
2008
Springer
14 years 11 months ago
2008
Springer
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the...
ACNS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We propose a novel framework named Hidden Colored PetriNet for Alert Correlation and Understanding (HCPN-ACU) in intrusion detection system. This model is based upon the ...
DAC
1996
ACM
15 years 1 months ago
1996
ACM
This paper proposes a state encoding method for asynchronous circuits based on the theory of regions. A region in a Transition System is a set of states that "behave uniforml...
79
Voted
EDOC
2006
IEEE
15 years 3 months ago
2006
IEEE
The correctness of business process models is of paramount importance for the application on an enterprise level. A severe problem is that several languages for business process m...