Step coverability algorithms for communicating systems
From MaRDI portal
Publication:433351
DOI10.1016/j.scico.2010.11.003zbMath1267.68155MaRDI QIDQ433351
Maciej Koutny, H. C. M. 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
68Q45: Formal languages and automata
68Q55: Semantics in the theory of computing
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Cites Work
- Lectures on Petri nets. 1: Basic models. Advances in Petri nets
- Analysis issues in Petri nets with inhibitor arcs
- A framework for modeling the distributed deployment of synchronous designs
- Parallel program schemata
- Marked directed graphs
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item