Sciweavers

201 search results - page 13 / 41
» On the Decidability of Model-Checking for P Systems
Sort
View
POPL
2007
ACM
16 years 2 hour ago
On the analysis of interacting pushdown systems
Pushdown Systems (PDSs) has become an important paradigm for program analysis. Indeed, recent work has shown a deep connection between inter-procedural dataflow analysis for seque...
Vineet Kahlon, Aarti Gupta
CMSB
2010
Springer
14 years 6 months ago
Action-based analysis of discrete regulatory networks with short-term stimuli
To incorporate instant effects and different timescales within a single biological system, an extension of discrete regulatory networks with short-term stimuli is proposed. By mai...
Christian Krause, Carola Krause, Erik P. de Vink
ICFEM
2009
Springer
15 years 6 months ago
Approximate Model Checking of PCTL Involving Unbounded Path Properties
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
Samik Basu, Arka P. Ghosh, Ru He
ICTAC
2005
Springer
15 years 5 months ago
Stochastic Analysis of Graph Transformation Systems: A Case Study in P2P Networks
In distributed and mobile systems with volatile bandwidth and fragile connectivity, non-functional aspects like performance and reliability become more and more important. To forma...
Reiko Heckel
ENTCS
2007
113views more  ENTCS 2007»
14 years 11 months ago
On the Decidability of the Safety Problem for Access Control Policies
An access control system regulates the rights of users to gain access to resources in accordance with a specified policy. The rules in this policy may interact in a way that is n...
E. Kleiner, T. Newcomb