Journal: Electronic Notes in Theoretical Computer Science
Loading...
Abbreviation
Publisher
Elsevier
28 results
Search Results
Publications 1 - 10 of 28
- Modeling and reasoning about an attacker with cryptanalytical capabilitiesItem type: Conference Paper
Electronic Notes in Theoretical Computer ScienceMontalto, Bruno; Caleiro, Carlos (2009) - Stochastic Semantics of Signaling as a Composition of Agent-view AutomataItem type: Conference Proceedings
Electronic Notes in Theoretical Computer Science ~ Proceedings of the 1st International Workshop on Static Analysis and Systems Biology (SASB 2010)Köppl, Heinz; Petrov, Tatjana (2011) - Computing over-approximations with bounded model checkingItem type: Conference Paper
Electronic Notes in Theoretical Computer ScienceKroening, Daniel (2006) - A Unified View on Bipartite Species-reaction Graphs and Their Relation to Interaction Graphs and Qualitative Dynamics of Chemical Reaction NetworksItem type: Conference Paper
Electronic Notes in Theoretical Computer Science ~ Proceedings of SASB 2018, the Ninth International Workshop on Static Analysis and Systems BiologyKaltenbach, Hans-Michael (2020)The Jacobian matrix of a dynamic system and its principal minors play a prominent role in the study of qualitative dynamics and bifurcation analysis. When interpreting the Jacobian as an adjacency matrix of an interaction graph, its principal minors reate to sets of disjoint cycles in this graph and conditions for qualitative dynamic behaviors can be inferred from its cycle structure. The Jacobian of chemical reaction systems decomposes into the product of two matrices, which allows more fine-grained analyses by studying a corresponding bipartite species-reaction graph. Several different bipartite graphs have been proposed and results on injectivity, multistationarity, and bifurcations have been derived. Here, we present a new definition of the species-reaction graph that directly connects the cycle structure with determinant expansion terms, principal minors, and the coefficients of the characteristic polynomial. It encompasses previous graph constructions as special cases. This graph has a direct relation to the interaction graph, and properties of cycles and sub-graphs can be translated in both directions. A simple equivalence relation enables simplified decomposition of determinant expansions and allows simpler and more direct proofs of previous results. - Deconstructing Alice and BobItem type: Conference Paper
Electronic Notes in Theoretical Computer ScienceCaleiro, Carlos; Viganò, Luca; Basin, David (2005) - Development of Control Systems Guided by Models of their EnvironmentItem type: Conference Paper
Electronic Notes in Theoretical Computer ScienceHudon, Simon; Hoang, Thai Son (2011) - Jvm independent replay in javaItem type: Conference Paper
Electronic Notes in Theoretical Computer Science ~ Proceedings of the Fourth Workshop on Runtime Verification, RV 2004Schuppan, Viktor; Baur, Marcel; Biere, Armin (2005) - A program logic for bytecodeItem type: Journal Article
Electronic Notes in Theoretical Computer ScienceMüller, Peter; Bannwart, Fabian (2005) - Proceedings of the Second Workshop on Automated Reasoning for Security Protocol Analysis (ARSPA 2005)Item type: Conference Proceedings
Electronic Notes in Theoretical Computer ScienceDegano, Pierpaolo; Viganò, Luca (2005) - Liveness Checking as Safety Checking for Infinite State SpacesItem type: Conference Paper
Electronic Notes in Theoretical Computer ScienceSchuppan, Viktor; Biere, Armin (2006)
Publications 1 - 10 of 28