Interactive State-Space Analysis of Concurrent Systems

Morgan, E. Timothy; Razouk, Rami R.

doi:10.1109/tse.1987.232850

Cited by 58 publications

(7 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…However, the generation of all possible states is a well-known NP-problem, which imposes severe burdens on the development of tools to solve real problems. One possible way to circumvent this sort of difficulty is to reduce the complete state space to a simpler, more manageable representation, applying the following techniques (Morgan and Razouk 1987):…”

Section: State Space Representationmentioning

confidence: 99%

“…As Hwang et al (1991) argue, the choice of state-space representation relies primarily on the use of the model, mainly for aspects of computational simplicity, model reduction and characterizations of systems invariants. The main advantage of representing a system in state space form is that the reduced dimensional models of the system can be readily obtained by direct procedures, such as selection, projection and reduction (Morgan and Razouk 1987). However, the generation of all possible states is a well known NP-hard problem (Kochikar and Narendran 1993), which imposes severe burdens on the development of tools to solve real problems.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

State space representation of manufacturing operation plans in the presence of flexible routing capability

Borenstein¹,

Becker²

2004

International Journal of Computer Integrated Manufacturing

View full text Add to dashboard Cite

Manufacturing process planning in flexible manufacturing environments requires a highly efficient computerized representation, since the number of different alternatives grows rapidly as the level of flexibility of the manufacturing systems increases. Furthermore, in order to recommend a good manufacturing plan, it is necessary to be capable of generating all feasible alternatives. This paper describes a state space to represent manufacturing operation plans, which generates a compact representation of all possible manufacturing operation sequences and routes that can be applied to a certain part. The state space representation is a state transition graph in which the nodes represent the manufacturing operation states of the system, and the arcs the transitions between them. Such a representation forms the basis for efficient planning algorithms that enable the manufacturing system to select a course of action according to current factory conditions. Computational experiments demonstrate the effectiveness of the proposed representation.

show abstract

Section: State Space Representationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

State space representation of manufacturing operation plans in the presence of flexible routing capability

Borenstein¹,

Becker²

2004

International Journal of Computer Integrated Manufacturing

View full text Add to dashboard Cite

show abstract

“…Estas representações são obtidas pela projeção do espaço de estados completo de um sistema de manufatura. Projeção é uma técnica de redução do espaço de estados, baseada na agregação de estados, seguindo critérios predefinidos, de forma a preservar certos aspectos comportamentais do sistema, enquanto ignora outros (Morgan e Razouk, 1987). O objetivo é reduzir o completo espaço de estados de um sistema de manufatura, um clássico problema nãodeterminístico polinomial (classe NP) (Kochikar e Narendran, 1992), em um outro espaço mais simples e tratável.…”

Section: Representação Em Espaço De Estados Para a Flexibilidade De Runclassified

Representação em espaço de estados para a flexibilidade de roteamento

Rohde

Borenstein

2004

Gest. Prod.

View full text Add to dashboard Cite

Este artigo descreve uma representação em espaço de estados para a flexibilidade de roteamento em sistemas de manufatura. A flexibilidade de roteamento é representada em três níveis de detalhamento, como segue: (i) grafo de precedências; (ii) grafo de transição de estados para a flexibilidade de seqüência; e (iii) grafo de transição de estados para a flexibilidade de roteamento. A terceira representação é a mais completa, sendo capaz de enumerar todas as possíveis rotas de uma peça no sistema de manufatura. Neste artigo ainda, será abordada a relação entre a representatividade e complexidade computacional para cada representação, auxiliando o processo de seleção do nível de representação mais adequado a um determinado contexto. A versatilidade desta representação permite que esta seja facilmente vinculada a outras ferramentas de análise e apoio, para o controle e projeto de sistemas flexíveis de manufatura, permitindo que estes sejam devidamente avaliados, compreendidos e mensurados. Por fim, a eficácia da representação é demonstrada por meio de sua aplicação em problemas de roteamento e mensuração da flexibilidade em sistemas de manufatura.

show abstract

“…Final states of a reachability graph correspond to Petri net markings in which all of the marked places model the termination of a task. Reachability graphs for Petri nets have been used to perform analysis of Ada tasking programs MR87,SMBT90].…”

Section: Reachability Graphsmentioning

confidence: 99%

A compact Petri net representation and its implications for analysis

Dwyer

Clarke

1996

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

This paper explores a property-independent, coarsened, multi-level representation for supporting state reachability analysis for a number of di erent properties. This multi-level representation comprises a reachability graph derived from a highly optimized Petri net representation that is based on task interaction graphs and associated property-speci c summary information. This highly optimized representation reduces the size of the reachability graph but may increase the cost of the analysis algorithm for some types of analyses. This paper explores this trade-o. To this end, we have developed a framework for checking a variety of properties of concurrent programs using this optimized representation and present empirical results that compare the cost to an alternative Petri net representation. In addition, we present reduction techniques that can further improve the performance and yet still preserve analysis information. Although worst-case bounds for most concurrency analysis techniques are daunting, we demonstrate that the techniques that we propose signi cantly broaden the applicability of reachability analyses.

show abstract

Interactive State-Space Analysis of Concurrent Systems

Cited by 58 publications

References 11 publications

State space representation of manufacturing operation plans in the presence of flexible routing capability

State space representation of manufacturing operation plans in the presence of flexible routing capability

Representação em espaço de estados para a flexibilidade de roteamento

A compact Petri net representation and its implications for analysis

Contact Info

Product

Resources

About