Sciweavers

525 search results - page 18 / 105
» Model Checking Systems of Replicated Processes with Spin
Sort
View
FSTTCS
2010
Springer
13 years 6 months ago
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
Matthew Hague, Anthony Widjaja To
CSL
2004
Springer
14 years 2 months ago
Parameterized Model Checking of Ring-Based Message Passing Systems
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems,  ¢¡ , comprised of finite, but arbitrarily many,...
E. Allen Emerson, Vineet Kahlon
FUIN
2002
80views more  FUIN 2002»
13 years 8 months ago
P Systems with Replicated Rewriting and Stream X-Machines (Eilenberg Machines)
Abstract. The aim of this paper is to show how the P systems with replicated rewriting can be modeled by X-machines (also called Eilenberg machines). In the first approach, the par...
Joaquin Aguado, Tudor Balanescu, Anthony J. Cowlin...
APCCM
2010
13 years 10 months ago
A conceptually rich model of business process compliance
In this paper we extend the preliminary work developed elsewhere and investigate how to characterise many aspects of the compliance problem in business process modeling. We first ...
Guido Governatori, Antonino Rotolo
TOPNOC
2008
13 years 8 months ago
TAPAs: A Tool for the Analysis of Process Algebras
Process Algebras are formalisms for modelling concurrent systems that permit mathematical reasoning with respect to a set of desired properties. TAPAs is a tool that can be used to...
Francesco Calzolai, Rocco De Nicola, Michele Loret...