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
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
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)
Cites Work
- Parallel program schemata
- Marked directed graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lectures on Petri nets. 1: Basic models. Advances in Petri nets
- Process semantics for membrane systems
- Analysis issues in Petri nets with inhibitor arcs
- A framework for modeling the distributed deployment of synchronous designs
- Applying Step Coverability Trees to Communicating Component-Based Systems
- Design Issues for Qualitative Modelling of Biological Cells with Petri Nets
- Quasi-Static Scheduling of Communicating Tasks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
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)
