29 search results - page 6 / 6 » Experimenting Formal Proofs of Petri Nets Refinements |
CIA
2007
Springer
13 years 11 months ago
2007
Springer
When two or more agents interacting, their behaviors are not necessarily matching. Automated ways to overcome con icts in the behavior of agents can make the execution of interacti...
CAV
2005
Springer
13 years 10 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...
CAISE
2008
Springer
13 years 7 months ago
2008
Springer
Quality aspects become increasingly important when business process modeling is used in a large-scale enterprise setting. In order to facilitate a storage without redundancy and an...
OSDI
1996
ACM
13 years 6 months ago
1996
ACM
This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel r...