Combining finite automata, parallel programs and SDL using Petri nets

Grahlmann, Bernd

doi:10.1007/bfb0054167

Cited by 12 publications

(7 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…statecharts). One approach to combine semantically several specification languages is elaborated in [7].…”

Section: Sdl-example and Discussion Of The Approachmentioning

confidence: 99%

“…7 The description of the refinement capabilities is based upon the set of all types of interface graphs GT and the set of all types of nodes V T which are defined in an application. In the PLC-example the graph types GT = {SystemDiagram, PLCAutomaton, PLCSubAutomaton} and the node types V T = {SystemNode, PLCState} are used.…”

Section: Descriptions Of Generic Hierarchical Graphsmentioning

confidence: 99%

See 1 more Smart Citation

Implementing Hierarchical Graph-Structures

Tapken

1999

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. We present concepts for the implementation of hierarchical graphs, which can be used as basis for the implementation of tools for graphical formal description techniques (gFDT) like SDL or statecharts. Our approach provides a strong modularity of a specification by a loose coupling between different hierarchy levels and it serves for a rapid development of interactive editors for gFDTs by a special technique of describing hierarchy. Furthermore, this technique allows the reuse of graph editors in different applications. Our concepts are explained by means of the graphical design tool Moby/plc for a special class of real-time automata, called PLC-Automata.

show abstract

“…statecharts). One approach to combine semantically several specification languages is elaborated in [7].…”

Section: Sdl-example and Discussion Of The Approachmentioning

confidence: 99%

Section: Descriptions Of Generic Hierarchical Graphsmentioning

confidence: 99%

Implementing Hierarchical Graph-Structures

Tapken

1999

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

show abstract

“…Nevertheless, Those models are not able to model workflow patterns representing parallelism. This problem has been treated and solved in many papers [13] [12] [15] [20] defining an improvement of the Determinist Finite Automata that presents an automaton with capability to execute parallel activities, keeping the complexity at regular level. In spite of this, those systems are no capable to represent time.…”

Section: Related Workmentioning

confidence: 99%

Timed Parallel Automaton: A Mathematical Tool for Defining Highly Expressive Formal Workflows

Fernández-Llatas¹,

Pileggi²,

Benedí

2011

2011 Fifth Asia Modelling Symposium

View full text Add to dashboard Cite

The definition and simulation of processes using Workflow technology is becoming more and more popular. In that way, to standardize and simulate complex processes it is needed high expressive languages able to be automatically executed by computers. Currently, high expressive languages that can be used for simulation and definition of processes are based in Petri Nets technology. Nevertheless, Petri Nets are difficult to understand by processes experts with no computer science training or expertise and are more complex to be executed than other simpler approaches like finite automatons.In this paper an automata based mathematical tool with a high expressivity capacity is presented. This framework is easier to understand also by non computer science experts and its automation is simple in order to allow to experts to define formal workflows that can be easily automated.

show abstract

“…Consequently, by combining dynamic digraph with hybrid automata and applying the parallel composition law between hybrid automata [ 32 , 33 ], we can obtain a new networked model and name it Dynamic Graph Hybrid Automata (DGHA). As an independent model framework, the DGHA can be applied in various dynamic network systems with multi-mode switchings.…”

Section: Introductionmentioning

confidence: 99%

Modeling and Density Estimation of an Urban Freeway Network Based on Dynamic Graph Hybrid Automata

Chen

Guo

Wang

2017

Sensors

View full text Add to dashboard Cite

In this paper, in order to describe complex network systems, we firstly propose a general modeling framework by combining a dynamic graph with hybrid automata and thus name it Dynamic Graph Hybrid Automata (DGHA). Then we apply this framework to model traffic flow over an urban freeway network by embedding the Cell Transmission Model (CTM) into the DGHA. With a modeling procedure, we adopt a dual digraph of road network structure to describe the road topology, use linear hybrid automata to describe multi-modes of dynamic densities in road segments and transform the nonlinear expressions of the transmitted traffic flow between two road segments into piecewise linear functions in terms of multi-mode switchings. This modeling procedure is modularized and rule-based, and thus is easily-extensible with the help of a combination algorithm for the dynamics of traffic flow. It can describe the dynamics of traffic flow over an urban freeway network with arbitrary topology structures and sizes. Next we analyze mode types and number in the model of the whole freeway network, and deduce a Piecewise Affine Linear System (PWALS) model. Furthermore, based on the PWALS model, a multi-mode switched state observer is designed to estimate the traffic densities of the freeway network, where a set of observer gain matrices are computed by using the Lyapunov function approach. As an example, we utilize the PWALS model and the corresponding switched state observer to traffic flow over Beijing third ring road. In order to clearly interpret the principle of the proposed method and avoid computational complexity, we adopt a simplified version of Beijing third ring road. Practical application for a large-scale road network will be implemented by decentralized modeling approach and distributed observer designing in the future research.

show abstract

Combining finite automata, parallel programs and SDL using Petri nets

Cited by 12 publications

References 18 publications

Implementing Hierarchical Graph-Structures

Implementing Hierarchical Graph-Structures

Timed Parallel Automaton: A Mathematical Tool for Defining Highly Expressive Formal Workflows

Modeling and Density Estimation of an Urban Freeway Network Based on Dynamic Graph Hybrid Automata

Contact Info

Product

Resources

About