A well-structured framework for analysing petri net extensions

Transition systems defined from recursive functions IN p → IN p are introduced and named WSNs, or well-structured nets. Such nets sit conveniently between Petri net extensions and general transition systems. In the first part of this paper, we study decidability properties of WSN classes obtained by...

Full description

Bibliographic Details

Published in:	Information and computation Vol. 195; no. 1; pp. 1 - 29
Main Authors:	Finkel, Alain, McKenzie, Pierre, Picaronny, Claudine
Format:	Journal Article
Language:	English
Published:	San Diego, CA Elsevier Inc 01.11.2004 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Automata. Abstract machines. Turing machines Computer science; control theory; systems Exact sciences and technology Theoretical computing Transition system Decidability Computer theory Recursive function Well structured net Computing Algorithm Petri net
ISSN:	0890-5401, 1090-2651
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!