Complexity results for reachability in cooperating systems and approximated reachability by abstract over-approximations
zbMATH Open1348.68012MaRDI QIDQ2789271
Publication date: 26 February 2016
Full work available at URL: http://nbn-resolving.de/urn:nbn:de:bsz:180-madoc-333516
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Recommendations
- Title not available (Why is that?) 👍 👎
- Complexity of reachability problems for finite discrete dynamical systems 👍 👎
- The complexity of reachability in distributed communicating processes 👍 👎
- Approximate Symbolic Reachability of Networks of Transition Systems 👍 👎
- ON THE POWER OF COOPERATING MORPHISMS VIA REACHABILITY PROBLEMS 👍 👎
- Reachability via Cooperating Morphisms 👍 👎
- Revisiting Underapproximate Reachability for Multipushdown Systems 👍 👎
- On the Complexity of L-reachability 👍 👎
- Reachability Analysis of Communicating Pushdown Systems 👍 👎
- Reachability Analysis of Communicating Pushdown Systems 👍 👎
This page was built for publication: Complexity results for reachability in cooperating systems and approximated reachability by abstract over-approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789271)
