Topic
Process architecture
About: Process architecture is a research topic. Over the lifetime, 4876 publications have been published within this topic receiving 104171 citations.
Papers published on a yearly basis
Papers
More filters
01 Jun 1995
TL;DR: A new class of Petri nets called the fuzzy neural Petri net (FNPN) is defined, which can be used for representing a fuzzy knowledge base and for fuzzy reasoning.
Abstract: Artificial neural networks (ANN's) are highly parallel and distributed computational structures that can learn from experience and perform inferences. Petri nets, on the other hand, provide an effective modeling framework for distributed systems. The basic concepts of Petri net are utilized to develop ANN-like multilayered Petri net architectures of distributed intelligence having learning ability. A Petri net model of single neuron is presented. A two-layer Petri net model-neural Petri net (NPN)-that uses this neuron model as a building block is described. A new class of Petri nets called the fuzzy neural Petri net (FNPN) is defined. The FNPN can be used for representing a fuzzy knowledge base and for fuzzy reasoning. Some application examples for the two Petri net based models are given. >
64 citations
TL;DR: A notion of equivalence among time Petri nets is introduced, and it is proved that the reduction rules extended to work with time petri nets yield equivalent nets.
Abstract: The goal of net reduction is to increase the effectiveness of Petri-netbased real-time program analysis. Petri-net-based analysis, like all reachabilitybased methods, suffers from the state explosion problem. Petri net reduction is one key method for combating this problem.
In this paper, we extend several rules for the reduction of ordinary Petri nets to work with time Petri nets. We introduce a notion of equivalence among time Petri nets, and prove that our reduction rules yield equivalent nets. This notion of equivalence guarantees that crucial timing and concurrency properties are preserved.
64 citations
TL;DR: The Petri net method proposed suggests a robust way of preventing inconsistency from infecting a system and rendering it useless, and is interesting because large expert systems may often contain inconsistent information.
Abstract: Petri nets provide a promising framework for executing queries to logic programs. Petri net models for query processing in logic programming were initially developed by T. Murata and D. Zhang (IEEE Trans. Software Eng., vol.14, no.4, p.481-97, 1988). It is shown how this framework can be extended to be applicable to reasoning in the presence of inconsistency. This yields a Petri net model of programs that be inconsistent in classical logic. This is interesting because large expert systems may often contain inconsistent information. The Petri net method proposed suggests a robust way of preventing inconsistency from infecting a system and rendering it useless. >
64 citations
01 Oct 1988
TL;DR: Quality criteria for implementations are specified and a variety of implementations of finite place/transition systems is discussed and the programs are formulated in Occam.
Abstract: In order to compare different distributed software implementations of the token game we start out from an explicitly defined basis, called the process paradigm. Quality criteria for implementations are specified and a variety of implementations of finite place/transition systems is discussed. The programs are formulated in Occam.
64 citations
01 Jan 2002
TL;DR: Cyclic Communicating Processes: A Logical View and Is the Die Cast for the Token Game?
Abstract: Cyclic Communicating Processes: A Logical View . . . . . . . . . . . . . . . . .68 P. S. Thiagarajan Is the Die Cast for the Token Game? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70 Alex Yakovlev
64 citations