Step coverability algorithms for communicating systems

DOI10.1016/J.SCICO.2010.11.003zbMATH Open1267.68155OpenAlexW2005825472MaRDI QIDQ433351FDOQ433351

Authors Maciej Koutny, Jetty Kleijn 

Publication date 13 July 2012

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.scico.2010.11.003

zbMATH Keywords

determinismPetri netscommunicating componentsmaximal concurrencystep coverability tree

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Applying Step Coverability Trees to Communicating Component-Based Systems
• scientific article; zbMATH DE number 5587274
• On the Efficient Computation of the Minimal Coverability Set for Petri Nets
• On the efficient computation of the minimal coverability set of Petri nets
• Covering steps graphs of time Petri nets

Cites Work

• scientific article; zbMATH DE number 4049572 (Why is no real title available?)
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 1302043 (Why is no real title available?)
• scientific article; zbMATH DE number 3806945 (Why is no real title available?)
• scientific article; zbMATH DE number 5587274 (Why is no real title available?)
• A framework for modeling the distributed deployment of synchronous designs
• Analysis issues in Petri nets with inhibitor arcs
• Applying Step Coverability Trees to Communicating Component-Based Systems
• Design Issues for Qualitative Modelling of Biological Cells with Petri Nets
• Lectures on Petri nets. 1: Basic models. Advances in Petri nets
• Marked directed graphs
• Parallel program schemata
• Process semantics for membrane systems
• Quasi-Static Scheduling of Communicating Tasks

Cited In (3)

• Covering steps graphs of time Petri nets
• Title not available (Why is no real title available?)
• Applying Step Coverability Trees to Communicating Component-Based Systems

This page was built for publication: Step coverability algorithms for communicating systems

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