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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Information and computation Ročník 195; číslo 1; s. 1 - 29
Hlavní autori:	Finkel, Alain, McKenzie, Pierre, Picaronny, Claudine
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	San Diego, CA Elsevier Inc 01.11.2004 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!