Continuous Petri Nets Faithfully Fluidify Most Permissive Boolean Networks
- 19 August 2025
- book chapter
- Published by Springer Nature
- p. 89-105
Abstract
No abstract availableKeywords
All Related Versions
This publication has 22 references indexed in Scilit:
- On the Expressive Power of Transfinite Sequences for Continuous Petri Nets2024
- Melding Boolean networks and reaction systems under synchronous, asynchronous and most permissive semanticsNatural Computing, 2024
- Concurrency in Boolean networksNatural Computing, 2019
- Foundations of Chemical Reaction Network Theory2019
- Boolean Networks: Beyond Generalized Asynchronicity2018
- Characterization of Reachable Attractors Using Petri Net Unfoldings2014
- Petri net representation of multi-valued logical regulatory graphsNatural Computing, 2010
- Qualitative Petri Net Modelling of Genetic Networks2006
- On Reachability in Autonomous Continuous Petri Net Systems2003
- Autonomous Continuous P/T Systems1999