## Abstract In this paper we give a new proof of Richardson's theorem [31]: a global function __G__~𝔸~ of a cellular automaton 𝔸 is injective if and only if the inverse of __G__~𝔸~ is a global function of a cellular automaton. Moreover, we show a way how to construct the inverse cellular automaton
Applications of propositional logic to workflow analysis
✍ Scribed by Glória Cravo
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 456 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper our main goal is to describe the structure of workflows. A workflow is an abstraction of a business process that consists of one or more tasks to be executed to reach a final objective. In our approach we describe a workflow as a graph whose vertices represent workflow tasks and the arcs represent workflow transitions. Moreover, every arc (t k , t l ) (i.e., a transition) has attributed a Boolean value to specify the execution/non-execution of tasks t k , t l . With this attribution we are able to identify the natural flow in the workflow.
Finally, we establish a necessary and sufficient condition for the termination of workflows. In other words, we identify conditions under which a business process will be complete.
📜 SIMILAR VOLUMES
Real-time decision systems are computer-controlled systems that must react to events in the external environment by making decisions based on sensor inputs and state information sufficiently fast to meet environment-imposed timing constraints. They are used in applications that would require human e