Satisfiability and Feasibility in a Relationship-Based Workflow Authorization Model

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-33167-1_7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2016English

Pattern Backtracking Algorithm for the Workflow Satisfiability Problem With User-Independent Constraints

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Model-Based Diagnosis of Hybrid Systems Using Satisfiability Modulo Theory

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

Formal Policy Based Authorization Model for Ubiquitous Enterprise Computing Environment

International Journal of Computer Applications
2013English

Smten With Satisfiability-Based Search

2014English

Supporting Authorization Reasoning Based on Role and Resource Hierarchies in an Ontology-Enriched XACML Model

International Journal of Computer and Communication Engineering
2014English

Workflow Model With Version Change Based on Task-Relationships

2015English

Capability-Based Authorization for HEP

EPJ Web of Conferences
AstronomyPhysics
2019English

Formal Model Based Specification of Authorization Framework for Ubiquitous Enterprise Computing Environment

International Journal of Computer Applications
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy