Sciweavers

493 search results - page 62 / 99
» Bounded LTL Model Checking with Stable Models
Sort
View
APN
2007
Springer
15 years 4 months ago
History-Dependent Petri Nets
Most information systems that are driven by process models (e.g., workflow management systems) record events in event logs, also known as transaction logs or audit trails. We cons...
Kees M. van Hee, Alexander Serebrenik, Natalia Sid...
FUIN
2000
115views more  FUIN 2000»
14 years 9 months ago
Constructing the Least Models for Positive Modal Logic Programs
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
Linh Anh Nguyen
CCS
2008
ACM
14 years 12 months ago
Stale-safe security properties for group-based secure information sharing
Attribute staleness arises due to the physical distribution of authorization information, decision and enforcement points. This is a fundamental problem in virtually any secure di...
Ram Krishnan, Jianwei Niu, Ravi S. Sandhu, William...
ASPDAC
1999
ACM
144views Hardware» more  ASPDAC 1999»
15 years 2 months ago
Model Order Reduction of Large Circuits Using Balanced Truncation
A method is introduced for model order reduction of large circuits extracted from layout. The algorithm, which is based on balanced realization, can be used for reducing the order ...
Payam Rabiei, Massoud Pedram
FAC
2008
114views more  FAC 2008»
14 years 10 months ago
Specification of communicating processes: temporal logic versus refusals-based refinement
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
Gavin Lowe