Petri nets and regular processes
type: Item
instance of: scholarly article
title: Petri nets and regular processes
zbMATH Open document ID: 0958.68121
author: Petr Jančar
author: Javier Esparza
author: Faron Moller
published in: Journal of Computer and System Sciences
publication date: 2000-03-19T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 1417882
zbMATH Keywords: labelled Petri net
MaRDI profile type: Publication
full work available at URL: jcss.1999.1643
OpenAlex ID: W2026927709
Wikidata QID: Q59556982
cites work: The equality problem for vector addition systems is undecidable
cites work: Ordering by Divisibility in Abstract Algebras
cites work: Q4525284
cites work: Q3862379
cites work: Q4490743
cites work: Decidability of a temporal logic problem for Petri nets
cites work: Undecidability of bisimilarity for Petri nets and some related problems
cites work: Q4436352
cites work: Nonprimitive recursive complexity and undecidability for Petri net equivalences
cites work: Q4818859
cites work: Deciding bisimulation-like equivalences with finite-state processes
cites work: An Algorithm for the General Petri Net Reachability Problem
cites work: Q3992568
cites work: Q5590814
cites work: Nets, Terms and Formulas
cites work: Q3911403
cites work: Petri nets and regular languages
DOI: 10.1006/JCSS.1999.1643
Recommended article: Q3696824
Recommended article: Petri nets
Recommended article: Petri-Netze
Recommended article: Q4332926
Recommended article: Q4842533
Recommended article: Q3735084
Recommended article: Q3745292
Recommended article: Processes of timed Petri nets
Recommended article: PETRI NETS AND STEP TRANSITION SYSTEMS
Recommended article: Petri nets and bisimulation
description: scientific article; zbMATH DE number 1417882