Sciweavers

201 search results - page 25 / 41
» On the Decidability of Model-Checking for P Systems
Sort
View
AMAST
2006
Springer
15 years 3 months ago
State Space Reduction of Rewrite Theories Using Invisible Transitions
Abstract. State space explosion is the hardest challenge to the effective application of model checking methods. We present a new technique for achieving drastic state space reduct...
Azadeh Farzan, José Meseguer
ICDT
2009
ACM
248views Database» more  ICDT 2009»
16 years 12 days ago
Automatic verification of data-centric business processes
We formalize and study business process systems that are centered around "business artifacts", or simply "artifacts". This approach focuses on data records, kn...
Alin Deutsch, Richard Hull, Fabio Patrizi, Victor ...
ICAC
2005
IEEE
15 years 5 months ago
Myrrh: A Transaction-Based Model for Autonomic Recovery
As software comes under increasing scrutiny for its lack of safety and reliability, numerous static and partially dynamic tools (including model checking) have been proposed for v...
Guy Eddon, Steven P. Reiss
AADEBUG
2005
Springer
15 years 5 months ago
Specifying and checking component usage
One of today’s challenges is producing reliable software in the face of an increasing number of interacting components. Our system CHET lets developers define specifications des...
Steven P. Reiss
SAC
2010
ACM
14 years 12 months ago
Data-aware design and verification of service compositions with Reo and mCRL2
Service-based systems can be modeled as stand-alone services coordinated by external connectors. Reo is a channelbased coordination language with well-defined semantics that enabl...
Natallia Kokash, Christian Krause, Erik P. de Vink