scientific article; zbMATH DE number 1405652

MaRDI QIDQ4938633zbMATH OpenFDO

Authors Catherine Dufourd, Petr Jančar, Philippe Schnoebelen

Publication date 23 February 2000

zbMATH Keywords

infinite-state transition systems

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1223710
• scientific article; zbMATH DE number 591180
• scientific article; zbMATH DE number 4197111
• Synthesis of (choice-free) reset nets
• Boundedness problems for jumping Petri nets
• Pomsets and unfolding of reset Petri nets
• Decomposition Theorems for Bounded Persistent Petri Nets
• Bounded self-stabilizing Petri nets
• Boundedness of adaptive nets is decidable

Cited in

(16)

• Soundness-preserving reduction rules for reset workflow nets
• Undecidable problems in unreliable computations.
• Handling infinitely branching well-structured transition systems
• Verifying lossy channel systems has nonprimitive recursive complexity.
• Boundedness of adaptive nets is decidable
• On the termination of integer loops
• Forward analysis and model checking for trace bounded WSTS
• Forward analysis and model checking for trace bounded WSTS
• Discovery, Verification and Conformance of Workflows with Cancellation
• On selective unboundedness of VASS
• scientific article; zbMATH DE number 1223710 (Why is no real title available?)
• Reachability for two-counter machines with one test and one reset
• Soundness of workflow nets: classification, decidability, and analysis
• Decidability problems of a basic class of object nets
• Decidability and complexity of Petri nets with unordered data
• Reduction rules for reset/inhibitor nets

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 Q4938633)