Extending propositional dynamic logic for Petri nets

DOI10.1016/J.ENTCS.2014.06.006MaRDI QIDQ281154zbMATHOpenAlexWikidataFDO

Authors Mario Benevides, Edward Hermann Haeusler, Bruno Lopes

Publication date 10 May 2016

Full work available at URL https://doi.org/10.1016/j.entcs.2014.06.006

zbMATH Keywords

Petri netsdynamic logicprogram verificationstochastic Petri nets

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modal logic (including the logic of norms) (03B45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Propositional dynamic logic for Petri nets
• Towards reasoning about Petri nets: a propositional dynamic logic based approach
• Propositional dynamic logic for Petri nets with iteration
• A calculus for automatic verification of Petri nets based on resolution and dynamic logics
• PDL for structured data: a graph-calculus approach

Cites work

• scientific article; zbMATH DE number 3123490 (Why is no real title available?)
• scientific article; zbMATH DE number 4030996 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1556014 (Why is no real title available?)
• scientific article; zbMATH DE number 4119618 (Why is no real title available?)
• scientific article; zbMATH DE number 763717 (Why is no real title available?)
• A decidable propositional dynamic logic with explicit probabilities
• A probabilistic PDL
• A probabilistic dynamic logic
• Combining deduction and model checking into tableaux and algorithms for converse-PDL.
• Decidability of finite probabilistic propositional dynamic logics
• Extending propositional dynamic logic for Petri nets
• Infinite State Model-Checking of Propositional Dynamic Logics
• Modal logic
• Model checking propositional dynamic logic with all extras
• Parallel action: Concurrent dynamic logic with independent modalities
• Product form equilibrium distributions and a convolution algorithm for stochastic Petri nets
• Propositional dynamic logic of regular programs
• Propositional dynamic logic with local assignments
• Stochastic Petri Nets

Cited in

(10)

• Propositional dynamic logic for Petri nets
• On dynamic description logic actions relationships with Petri nets
• scientific article; zbMATH DE number 1515284 (Why is no real title available?)
• Extending propositional dynamic logic for Petri nets
• Towards reasoning in dynamic logics with rewriting logic: the Petri-PDL case
• scientific article; zbMATH DE number 4187125 (Why is no real title available?)
• Logics for Petri Nets with Propagating Failures
• Propositional dynamic logic for Petri nets with iteration
• Towards reasoning about Petri nets: a propositional dynamic logic based approach
• A calculus for automatic verification of Petri nets based on resolution and dynamic logics

This page was built for publication: Extending propositional dynamic logic for Petri nets

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