scholarly journals A Petri Net Semantics of a Simple Process Algebra for Mobility

2006 ◽  
Vol 154 (3) ◽  
pp. 71-94 ◽  
Author(s):  
Raymond Devillers ◽  
Hanna Klaudel ◽  
Maciej Koutny
Keyword(s):  
Petri Net ◽  
Process Algebra ◽  
Simple Process

scholarly journals Petri-net-based deadlock analysis of Process Algebra programs

1994 ◽  
Vol 23 (1) ◽  
pp. 55-89 ◽  
Author(s):  
P. Rondogiannis ◽  
M.H.M. Cheng
Keyword(s):  
Petri Net ◽  
Process Algebra ◽  
Deadlock Analysis

Formalizing Interchange Competences

2009 ◽  
Vol 3 (4) ◽  
pp. 54-72 ◽  
Author(s):  
Alberto de la Encina ◽  
Mercedes Hidalgo-Herrero ◽  
Natalia López
Keyword(s):  
Process Algebra ◽  
Cognitive Systems ◽  
Simple Process ◽  
Material Goods ◽  
Multi Agent

An important aspect in multi-agent cognitive systems is being able to provide negotiation facilities to agents. In this article we deal with this problem by presenting a formal environment allowing to specify preferences. Moreover, our framework describes how to perform exchanges among the entities involved in the system. The exchanges are not restricted to material goods, as we introduce capabilities to deal with intangible goods. The description of the system is formalized by using a simple process algebra that allows dealing with entities organized in a hierarchical way.

scholarly journals Modeling the Distribution Grid by Petri Nets for Reconfiguration the Power System

2012 ◽  
Vol 433-440 ◽  
pp. 2561-2565 ◽  
Author(s):  
Phan Thi Huyen Chau ◽  
Eric Zamai ◽  
Pham Thi Ngoc Yen
Keyword(s):  
Power System ◽  
Petri Nets ◽  
Petri Net ◽  
Process Algebra ◽  
Power Network ◽  
Distribution Grid

The focus of the present paper is on modeling the distribution grid using Petri Net for reconfiguration. Such system can be described as node and connection. So modeling this system is to model the node and connection in order to describe all the actions in the system then collect the data . Each connection in the power network will be transfer to Petri Net according to the designing of the fiche. Then the whole system can be modeled by Process Algebra Petri Net (PPN). It makes the grid more compact and easier to monitor

Property-Preserving Petri Net Process Algebra in Software Engineering

10.1142/7919 ◽  
2011 ◽  
Author(s):  
Hejiao Huang ◽  
Li Jiao ◽  
To-Yat Cheung ◽  
Wai Ming Mak
Keyword(s):  
Software Engineering ◽  
Petri Net ◽  
Process Algebra

scholarly journals Strong Bisimilarity of Simple Process Algebras: Complexity Lower Bounds

2002 ◽  
Vol 9 (16) ◽  
Author(s):  
Jirí Srba
Keyword(s):  
General Framework ◽  
Process Algebra ◽  
Basic Process ◽  
Process Algebras ◽  
Strong Regularity ◽  
New Techniques ◽  
Simple Process ◽  
Rewrite Systems ◽  
Parallel Processes ◽  
Complexity Lower Bounds

In this paper we study bisimilarity problems for simple process algebras. In particular, we show PSPACE-hardness of the following problems:<ol><li>strong bisimilarity of Basic Parallel Processes (BPP),</li><li>strong bisimilarity of Basic Process Algebra (BPA),</li><li>strong regularity of BPP, and</li><li>strong regularity of BPA.</li></ol>We also demonstrate NL-hardness of strong regularity problems for the normed subclasses of BPP and BPA.<br /> <br />Bisimilarity problems for simple process algebras are introduced in a general framework of process rewrite systems, and a uniform description of the new techniques used for the hardness proofs is provided.

Sign in / Sign up

Export Citation Format

Share Document