scientific article; zbMATH DE number 1405652

zbMath0943.68122MaRDI QIDQ4938633

Catherine Dufourd, Petr Jančar, Philippe Schnoebelen

Publication date: 23 February 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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)

Related Items

On the Termination of Integer Loops ⋮ Forward analysis and model checking for trace bounded WSTS ⋮ Reduction rules for reset/inhibitor nets ⋮ On selective unboundedness of VASS ⋮ Handling infinitely branching well-structured transition systems ⋮ Undecidable problems in unreliable computations. ⋮ Discovery, Verification and Conformance of Workflows with Cancellation ⋮ Forward Analysis and Model Checking for Trace Bounded WSTS ⋮ Soundness of workflow nets: classification, decidability, and analysis ⋮ Decidability and complexity of Petri nets with unordered data ⋮ Unnamed Item ⋮ Soundness-preserving reduction rules for reset workflow nets ⋮ Verifying lossy channel systems has nonprimitive recursive complexity.