scholarly journals The Perspective on Data and Control Flow Analysis in Topological Functioning Models by Petri Nets

2014 ◽  
Vol 16 (1) ◽  
pp. 77-84
Author(s):  
Erika Asnina ◽  
Begoña Cristina Pelayo García-Bustelo
Keyword(s):  
Petri Nets ◽  
Software Design ◽  
Algebraic Topology ◽  
Research Result ◽  
Flow Analysis ◽  
Control Flow ◽  
Colored Petri Nets ◽  
Data Flows ◽  
Definition Of ◽  
And Control

Abstract The perspective on integration of two mathematical formalisms, i.e., Colored Petri Nets (CPNs) and Topological Functioning Model (TFM), is discussed in the paper. The roots of CPNs are in modeling system functionality. The TFM joins principles of system theory and algebraic topology, and formally bridges the solution domain with the problem domain. It is a base for further automated construction of software design models. The paper discusses a perspective on check of control and data flows in the TFM by CPNs formalism. The research result is definition of mappings from TFMs to CPNs.

A REUSE-ORIENTED WORKFLOW DEFINITION LANGUAGE

2003 ◽  
Vol 12 (01) ◽  
pp. 1-36 ◽  
Author(s):  
MARIE JOSÉ BLIN ◽  
JACQUES WAINER ◽  
CLAUDIA BAUZER MEDEIROS
Keyword(s):  
Programming Languages ◽  
Building Blocks ◽  
Database Systems ◽  
Exception Handling ◽  
Control Flow ◽  
New Formalism ◽  
Definition Of ◽  
High Level ◽  
And Control ◽  
High Degree

This paper presents a new formalism for workflow process definition, which combines research in programming languages and in database systems. This formalism is based on creating a library of workflow building blocks, which can be progressively combined and nested to construct complex workflows. Workflows are specified declaratively, using a simple high level language, which allows the dynamic definition of exception handling and events, as well as dynamically overriding workflow definition. This ensures a high degree of flexibility in data and control flow specification, as well as in reuse of workflow specifications to construct other workflows. The resulting workflow execution environment is well suited to supporting cooperative work.

scholarly journals Flow Analysis of Lambda Expressions

1981 ◽  
Vol 10 (128) ◽  
Author(s):  
Neil D. Jones
Keyword(s):  
Programming Languages ◽  
Flow Analysis ◽  
Lambda Calculus ◽  
Control Flow ◽  
Point Of View ◽  
Approximate Description ◽  
Interprocedural Analysis ◽  
And Control ◽  
Lambda Expression ◽  
Parameter Transmission

<p>We describe a method to analyze the data and control flow during mechanical evaluation of lambda expressions. The method produces a finite approximate description of the set of all states entered by a call-by-value lambda-calculus interpreter; a similar approach can easily be seen to work for call-by-name. A proof is given that the approximation is ''safe'' i.e. that it includes descriptions of every intermediate lambda-expression which occurs in the evaluation.</p><p>From a programming languages point of view the method extends previously developed interprocedural analysis methods to include both local and global variables, call-by-name or call-by-value parameter transmission and the use of procedures both as arguments to other procedures and as the results returned by them.</p>

Abstract allocation as a unified approach to polyvariance in control-flow analyses

2018 ◽  
Vol 28 ◽  
Author(s):  
THOMAS GILRAY ◽  
MICHAEL D. ADAMS ◽  
MATTHEW MIGHT
Keyword(s):  
Design Space ◽  
Flow Analysis ◽  
Operational Semantics ◽  
Control Flow ◽  
Unified Approach ◽  
Abstract Machine ◽  
Abstract Machines ◽  
History Of ◽  
Concrete Operational ◽  
And Control

AbstractIn higher order settings, control-flow analysis aims to model the propagation of both data and control by finitely approximating program behaviors across all possible executions. The polyvariance of an analysis describes the number of distinct abstract representations, or variants, for each syntactic entity (e.g., functions, variables, or intermediate expressions). Monovariance, one of the most basic forms of polyvariance, maintains only a single abstract representation for each variable or expression. Other polyvariant strategies allow a greater number of distinct abstractions and increase analysis complexity with the aim of increasing analysis precision. For example, k-call sensitivity distinguishes flows by the most recent k call sites, k-object sensitivity by a history of allocation points, and argument sensitivity by a tuple of dynamic argument types. From this perspective, even a concrete operational semantics may be thought of as an unboundedly polyvariant analysis. In this paper, we develop a unified methodology that fully captures this design space. It is easily tunable and guarantees soundness regardless of how tuned. We accomplish this by extending the method of abstracting abstract machines, a systematic approach to abstract interpretation of operational abstract-machine semantics. Our approach permits arbitrary instrumentation of the underlying analysis and arbitrary tuning of an abstract-allocation function. We show that the design space of abstract allocators both unifies and generalizes existing notions of polyvariance. Simple changes to the behavior of this function recapitulate classic styles of analysis and yield novel combinations and variants.

scholarly journals Formulation of Cell Petri Nets

2013 ◽  
Vol 21 (4) ◽  
pp. 241-247
Author(s):  
Mitsuru Jitsukawa ◽  
Pauline N. Kawamoto ◽  
Yasunari Shidama
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Colored Petri Nets ◽  
Colored Petri Net ◽  
Neighborhood Relationship ◽  
Definition Of

Abstract Based on the Petri net definitions and theorems already formalized in the Mizar article [13], in this article we were able to formalize the definition of cell Petri nets. It is based on [12]. Colored Petri net has already been defined in [11]. In addition, the conditions of the firing rule and the colored set to this definition, that defines the cell Petri nets are further extended to CPNT.i further. The synthesis of two Petri nets was introduced in [11] and in this work the definition is extended to produce the synthesis of a family of colored Petri nets. Specifically, the extension to a CPNT family is performed by specifying how to link the outbound transitions of each colored Petri net to the place elements of other nets to form a neighborhood relationship. Finally, the activation of colored Petri nets was formalized.

Sign in / Sign up

Export Citation Format

Share Document