A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Deriving Petri Nets from Finite Transition Systems
IEEE Transactions on Computers
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Engineering digital design (2nd ed.)
Engineering digital design (2nd ed.)
Distributed Algorithms
Polynomial Algorithms for the Synthesis of Bounded Nets
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Stubborn sets for reduced state space generation
Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
An n log n algorithm for minimizing states in a finite automaton
An n log n algorithm for minimizing states in a finite automaton
Workflow mining: a survey of issues and approaches
Data & Knowledge Engineering
Correcting Deadlocking Service Choreographies Using a Simulation-Based Graph Edit Distance
BPM '08 Proceedings of the 6th International Conference on Business Process Management
A Region-Based Algorithm for Discovering Petri Nets from Event Logs
BPM '08 Proceedings of the 6th International Conference on Business Process Management
Deciding Substitutability of Services with Operating Guidelines
Transactions on Petri Nets and Other Models of Concurrency II
Automatic Test Case Generation for Interacting Services
Service-Oriented Computing --- ICSOC 2008 Workshops
The Computer Journal
Operating guidelines for finite-state services
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
A feature-complete Petri net semantics for WS-BPEL 2.0
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
A trace-based view on operating guidelines
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Ensuring reachability by design
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Hi-index | 0.00 |
Operating guidelines characterize correct interaction (e. g., deadlock freedom) with a service. They can be stored in a service registry. They are typically represented as an annotated transition system where the annotations are Boolean formulae attached to the states. The core result of this article is to propose an alternative representation of operating guidelines where, instead of a Boolean formula, only a few bits need to be stored with a state. This way, we safe one order of magnitude in the space complexity of the representation. Moreover, we demonstrate that the new representation yields efficiency gains in several algorithms which involve operating guidelines. Finally we show that the new representation permits the translation of the transition system representing the operating guidelines into a Petri net which typically yields further gains concerning the space for storing operating guidelines.