scientific article; zbMATH DE number 1528665

MaRDI QIDQ4515247zbMATH OpenFDO

Authors Ferucio Laurenţiu Ţiplea, Cristina Bădărău

Publication date 13 November 2000

zbMATH Keywords

decidabilityPetri net languagesPetri nets

Mathematics Subject Classification ID

Word problems, etc. in computability and recursion theory (03D40) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Discrete mathematics in relation to computer science (68R99)

Recommendations

• scientific article; zbMATH DE number 4092785
• Decidability of the Petri net reachability problem
• Deterministic weak-and-marked Petri net languages are regular
• On the regularity of Petri net languages
• scientific article; zbMATH DE number 1059894

Cited in

(7)

• A structure to decide reachability in Petri nets
• Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
• Petri net reachability graphs: decidability status of FO properties
• Approximating Petri net reachability along context-free traces
• Entscheidbarkeit bei Petri Netzen
• scientific article; zbMATH DE number 4092785 (Why is no real title available?)
• scientific article; zbMATH DE number 6845563 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4515247)