Complexity of model checking for reaction systems
DOI10.1016/J.TCS.2015.11.040zbMath1336.68085OpenAlexW2215907076MaRDI QIDQ264544
Antonio E. Porreca, Cristian Gratie, Ion Petre, Luca Manzoni, Sepinoud Azimi, Sergiu Ivanov
Publication date: 31 March 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.11.040
invariantsperiodicitymodel checkingstationary processsteady statecomplexity classesbiomodelingconserved setselementary fluxreaction systems
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Elements of finite model theory.
- An excursion in reaction systems: from computer science to biology
- Model checking temporal properties of reaction systems
- Functions and sequences generated by reaction systems
- FUNCTIONAL CONSTRUCTIONS BETWEEN REACTION SYSTEMS AND PROPOSITIONAL LOGIC
- A TOUR OF REACTION SYSTEMS
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- FUNCTIONS DEFINED BY REACTION SYSTEMS
- Fixed Points and Attractors of Reaction Systems
- Reaction System Models for the Heat Shock Response
- Cycles and Global Attractors of Reaction Systems
This page was built for publication: Complexity of model checking for reaction systems