Stably Computable Properties of Network Graphs
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 63-74
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Computation in networks of passively mobile finite-state sensors2004
- Catalytic P systems, semilinear sets, and vector addition systemsTheoretical Computer Science, 2004
- A simple game for the study of trust in distributed systemsWuhan University Journal of Natural Sciences, 2001
- Decidability and complexity of Petri net problems — An introduction1998
- The chemical abstract machineTheoretical Computer Science, 1992
- A survey of basic net models and modular net classes1992
- An Algorithm for the General Petri Net Reachability ProblemSIAM Journal on Computing, 1984
- On Communicating Finite-State MachinesJournal of the ACM, 1983
- On the reachability problem for 5-dimensional vector addition systemsTheoretical Computer Science, 1979
- Semigroups, Presburger formulas, and languagesPacific Journal of Mathematics, 1966