Petri nets and regular processes

DOI10.1006/jcss.1999.1643zbMath0958.68121OpenAlexW2026927709WikidataQ59556982 ScholiaQ59556982MaRDI QIDQ1970202

Faron Moller, Petr Jančar, Javier Esparza

Publication date: 19 March 2000

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1999.1643

zbMATH Keywords

labelled Petri net

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (12)

Trace Inclusion for One-Counter Nets Revisited ⋮ Trace inclusion for one-counter nets revisited ⋮ Interleaving isotactics -- an equivalence notion on behaviour abstractions ⋮ Automated verification of automata communicating via FIFO and bag buffers ⋮ Verifying chemical reaction network implementations: a pathway decomposition approach ⋮ Recursive Petri nets ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ Pushdown automata, multiset automata, and Petri nets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Universality Problem for Unambiguous VASS ⋮ Reachability is decidable for weakly extended process rewrite systems

Cites Work

• Undecidability of bisimilarity for Petri nets and some related problems
• Decidability of a temporal logic problem for Petri nets
• Petri nets and regular languages
• The equality problem for vector addition systems is undecidable
• An Algorithm for the General Petri Net Reachability Problem
• Nets, Terms and Formulas
• Ordering by Divisibility in Abstract Algebras
• Nonprimitive recursive complexity and undecidability for Petri net equivalences
• Deciding bisimulation-like equivalences with finite-state processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Petri nets and regular processes