Goal-oriented reduction of automata networks

DOI10.1007/978-3-319-45177-0_16MaRDI QIDQ1706591zbMATH OpenOpenAlexFDO

Authors Loïc Paulevé

Publication date 22 March 2018

Full work available at URL https://arxiv.org/abs/1608.05548

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Abstract: We consider networks of finite-state machines having local transitions conditioned by the current state of other automata. In this paper, we depict a reduction procedure tailored for a given reachability property of the form ``from global state s there exists a sequence of transitions leading to a state where an automaton g is in a local state T'. By exploiting a causality analysis of the transitions within the individual automata, the proposed reduction removes local transitions while preserving all the minimal traces that satisfy the reachability property. The complexity of the procedure is polynomial in the total number of local states and transitions, and exponential in the number of local states within one automaton. Applied to automata networks modelling dynamics of biological systems, we observe that the reduction shrinks down significantly the reachable state space, enhancing the tractability of the model-checking of large networks.

Recommendations

• Sufficient conditions for reachability in automata networks with priorities
• Dynamically consistent reduction of logical regulatory graphs
• Reduction of Boolean network models
• Combining refinement of parametric models with goal-oriented reduction of dynamics
• scientific article; zbMATH DE number 4050939

Cited in

(9)

• Modeling delayed dynamics in biological regulatory networks from time series data
• Classifying invariant structures of step traces
• Sufficient conditions for reachability in automata networks with priorities
• Interval traces with mutex relation
• Goal-driven unfolding of Petri nets
• SAF: SAT-based attractor finder in asynchronous automata networks
• Consistent reduction in discrete-event systems
• Algebraic structure of step traces and interval traces
• Combining refinement of parametric models with goal-oriented reduction of dynamics

This page was built for publication: Goal-oriented reduction of automata networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1706591)