191 search results - page 32 / 39 » Transition systems, link graphs and Petri nets |
TCS
2002
13 years 7 months ago
2002
This paper explores the application of rewriting logic to the executable formal modeling of real-time and hybrid systems. We give general techniques by which such systems can be s...
APN
2008
Springer
13 years 10 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...
GG
2008
Springer
2008
Springer
Semantical Correctness and Completeness of Model Transformations Using Graph and Rule Transformation
13 years 9 months ago
An important requirement of model transformations is the preservation of the behavior of the original model. A model transformation is semantically correct if for each simulation r...
INFSOF
2008
13 years 8 months ago
2008
The Business Process Execution Language for Web Services (BPEL) has emerged as the de-facto standard for implementing processes. Although intended as a language for connecting web ...
CAV
2005
Springer
14 years 1 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...