Skip to main content

Creating first Application in Appian BPM

Appian is well-equipped with Business Process Management (BPM) and Case Management capabilities. From a viewpoint it’s also pretty efficient like its counter parts such as  Pegasystems, TIBCO, INFOR etc.

We will be going through a series of features, tips and the practices which may be helpful in giving a better insight.

To Kick off, let’s have a look on how to kick off an application in Appian within seconds.

Now In Appian there are 3 ways you can create an application.
1. From Scratch
2. Using Application Builder (Basic)
3. Using Application Builder (Full)


When we create from Scratch then we need to give “Name” and “Description”. It’s like Appian will just create a placeholder to create and build related objects.

When using builder we need to give “Data Source” beforehand.


 


In addition to process model and interfaces, this full application option will also create objects related to reporting documentation and task etc.







It has created around 79 objects. All folders:-

1.  Groups
2.  Constants
3.  Record Type
4.  Expression Rules
5.  Data Types
6.  Folders
7.  Site
8.  Basic Process Models
9.  Data Store
10. Interfaces
11. Process Reports
12. Feed
13. Reports

It will also publish the application and create an action as well.

Creating all might take a while for the developer. Thanks to the #Appian creators, it’s just a click now. And below are some of the great resources to go in depth.
 
Sources:
Appian Documentation
Appian Community
Labels:

Comments

Post a Comment

Popular posts from this blog

Solution Python QnA #1

Solution for Python QnA for November 14, 2018. # OUTPUT****************************************** >>> x = input () 12 >>> y = int ( input ( 'Please enter a number' )) Please enter a number45 >>> x + y Traceback (most recent call last): File "<stdin>" , line 1 , in < module > TypeError : must be str , not int >>> y + y 90 >>> x + x '1212' In this (x+y); addition of integer and string is not allowed. hence we get the TypeError.
Post a Comment
Read more

Picking the structure!!

Use of arrays, rather sorted arrays or a linked list is somewhat difficult because both have their pros and cons.  Arrays excel when we have to perform a binary search while it’s faster to add and remove elements from linked lists.  A tree is one structure where there is ONLY ONE path to reach to a node. This can be explained further as “Nodes cannot be in closed loop” . Also there is a hierarchical relationship of parent and child. The average complexity varies from logarithmic to linear time. Now coming further to a data structure BSTs aka Binary Search Trees . Points to be remembered here:- Maximum two children. Left child is smaller than parent. Right one is greater than parent. Traversals :-   In order Traversal Ascending Sort; left subtree + root+ right subtree. So the above tree will look like:  4, 12, 16, 25, 28, 32 Pre order Traversal Root + left subtree + right subtree recursively. Eg: 25, 12, 4, 16, 32, 28 Po...
Post a Comment
Read more

Swapping of variables

There are a couple of classical ways to do it. Let the variables be:- a = 5 b = 10 1. By using temporary variable "temp" (name as per your convenience). temp = a a = b b = temp 2. Without "temp" or any extra variable a = a + b   // 15 b = a - b   // b becomes 5 a = a - b   // a becomes 10 3. In Python like a Boss!! :D a, b = b, a
Post a Comment
Read more