S-invariant analysis of general recursive Petri boxes

MaRDI QIDQ1894677zbMATH OpenFDO

Authors Raymond Devillers

Publication date 24 July 1995

Published in Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

Petri box calculusPetri boxes

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 512822
• Computing parameterized invariants of parameterized Petri nets
• Computing Parameterized Invariants of Parameterized Petri Nets
• Petri net analysis using invariant generation
• Structural place invariants for analyzing the behavioral properties of nested Petri nets
• Reachability analysis in T-invariant-less petri nets
• Symbolic analysis of bounded Petri nets
• Invariants of timed Petri nets
• A Reachability Algorithm for General Petri Nets Based on Transition Invariants
• Applications and Theory of Petri Nets 2005

Cited in

(11)

• Operational and denotational semantics for the box algebra
• General parameterised refinement and recursion for the M-net calculus
• The box algebra = Petri nets + process expressions
• Nested-unit Petri nets
• Nested-unit Petri nets: a structural means to increase efficiency and scalability of verification on elementary nets
• scientific article; zbMATH DE number 512822 (Why is no real title available?)
• Solving recursive net equations
• Refinement of coloured petri nets
• A refined view of the box algebra
• Petri boxes and finite precedence
• An Axiomatisation of Duplication Equivalence in the Petri Box Calculus

This page was built for publication: S-invariant analysis of general recursive Petri boxes

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