Net-Definability of Process Languages

Authors:
Ludwik Czaja
Affiliations:
(Correspd.) Institute of Informatics Warsaw University, ul. Banacha 2, 02-097 Warsaw, Poland. e-mail: lczaja@mimuw.edu.pl
Venue:
Fundamenta Informaticae
Year:
1999

Citing 4
Cited 2

Petri nets: an introduction

Petri nets: an introduction
Nonsequential processes

Nonsequential processes
Process languages and nets

Theoretical Computer Science
Polynomial Algorithms for the Synthesis of Bounded Nets

TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development

Associative Omega-product of Processes

Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Rational, Linear and Algebraic Process Languages and Iteration Lemmata

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Synthesis of elementary Petri net from a given process language (given by an expression in an algebra resembling the algebra of regular languages) is posed and solved. A necessary and sufficient condition for existence of such net is proved.