FUNCTIONAL CONSTRUCTIONS BETWEEN REACTION SYSTEMS AND PROPOSITIONAL LOGIC
From MaRDI portal
Publication:2841991
DOI10.1142/S0129054113500044zbMath1359.68075OpenAlexW2146183673MaRDI QIDQ2841991
Publication date: 30 July 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054113500044
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (21)
Complexity of model checking for reaction systems ⋮ Minimal reaction systems: duration and blips ⋮ On the complexity of occurrence and convergence problems in reaction systems ⋮ Characterization and computation of ancestors in reaction systems ⋮ Minimal Reaction Systems Defining Subset Functions ⋮ Steady states of constrained reaction systems ⋮ Complexity of the dynamics of reaction systems ⋮ Computing preimages and ancestors in reaction systems ⋮ Plug-in context providers for reaction systems ⋮ Reaction Systems, Transition Systems, and Equivalences ⋮ Applications of the Chinese remainder theorem to reaction systems with duration ⋮ Dependency graphs and mass conservation in reaction systems ⋮ Reaction systems and extremal combinatorics properties ⋮ Controllability of reaction systems ⋮ Model checking temporal properties of reaction systems ⋮ Asynchrony and persistence in reaction systems ⋮ Reaction systems with influence on environment ⋮ Towards Quantitative Verification of Reaction Systems ⋮ Communicating reaction systems with direct communication ⋮ Languages of distributed reaction systems ⋮ On the computational complexity of reaction systems, revisited
This page was built for publication: FUNCTIONAL CONSTRUCTIONS BETWEEN REACTION SYSTEMS AND PROPOSITIONAL LOGIC
