Applying Step Coverability Trees to Communicating Component-Based Systems

DOI10.1007/978-3-642-11623-0_10MaRDI QIDQ3400920zbMATH OpenOpenAlexFDO

Authors Maciej Koutny, Jetty Kleijn

Publication date 28 January 2010

Published in Fundamentals of Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11623-0_10

zbMATH Keywords

boundednessdecidabilityPetri netscomponentslocalitiesmarked graphsmaximal concurrencystep coverability treestep semantics

Mathematics Subject Classification ID

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

Recommendations

• Step coverability algorithms for communicating systems
• Stepwise refinement of communicating systems
• Covering step graph preserving failure semantics
• Coverability tree for P-systems described with Petri nets
• Reachability analysis using message passing over tree decompositions
• An SMT-based approach to coverability analysis
• Verification of component-based systems with recursive architectures
• Efficient implementation of coverability verification on communication-free Petri net

Cited in

(2)

• Step coverability algorithms for communicating systems
• Covering step graph preserving failure semantics

This page was built for publication: Applying Step Coverability Trees to Communicating Component-Based Systems

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