Computation of summaries using net unfoldings

DOI10.4230/LIPICS.FSTTCS.2013.225MaRDI QIDQ2963916zbMATH OpenFDO

Authors Javier Esparza, Loïg Jezequel, Stefan Schwoon

Publication date 21 February 2017

Full work available at URL https://arxiv.org/abs/1310.2143

zbMATH Keywords

concurrent systemsnet unfoldingsPetri nets

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 2080061
• Modular construction of finite and complete prefixes of Petri net unfoldings
• scientific article; zbMATH DE number 1361116
• A technique of state space search based on unfolding
• scientific article; zbMATH DE number 1670797

Cited in

(1)

• Distributed computation of vector clocks in Petri net unfoldings for test selection

This page was built for publication: Computation of summaries using net unfoldings

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