Publication | Date of Publication | Type |
---|
Equivalences of Statecharts | 2023-06-28 | Paper |
Semantics of full statecharts based on graph rewriting | 2022-08-16 | Paper |
Modeling Long–Running Transactions with Communicating Hierarchical Timed Automata | 2021-05-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4621146 | 2019-02-08 | Paper |
Modular Verification of Qualitative Pathway Models with Fairness | 2019-02-08 | Paper |
A graph rewriting framework for Statecharts semantics | 2019-01-10 | Paper |
A METHODOLOGY FOR THE STOCHASTIC MODELING AND SIMULATION OF SYMPATRIC SPECIATION BY SEXUAL SELECTION | 2016-08-09 | Paper |
An algorithm for the identification of components in biochemical pathways | 2016-04-26 | Paper |
Identification of components in biochemical pathways: extensive aqpplication to SBML models | 2016-03-14 | Paper |
Systolic Automata and P Systems | 2015-09-08 | Paper |
Modelling Biochemical Pathways with the Calculus of Looping Sequences | 2015-07-16 | Paper |
Component identification in biochemical pathways | 2015-06-10 | Paper |
Timed P Automata | 2015-03-19 | Paper |
Compositional semantics and behavioural equivalences for reaction systems with restriction | 2014-08-29 | Paper |
Spatial Calculus of Looping Sequences | 2014-03-21 | Paper |
Modular Verification of Interactive Systems with an Application to Biology | 2014-03-21 | Paper |
Simulation of spatial P system models | 2014-03-19 | Paper |
An Intermediate Language for the Simulation of Biological Systems | 2014-01-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q2849849 | 2013-09-20 | Paper |
A Compositional Semantics of Reaction Systems with Restriction | 2013-08-05 | Paper |
Formal Models of Timing Attacks on Web Privacy | 2013-07-24 | Paper |
On Conditions for Modular Verification in Systems of Synchronising Components | 2013-01-14 | Paper |
Foundational aspects of multiscale modeling of biological systems with process algebras | 2012-05-30 | Paper |
Spatial calculus of looping sequences | 2011-12-19 | Paper |
A Notion of Biological Diagnosability Inspired by the Notion of Opacity in Systems Security | 2011-06-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q3005245 | 2011-06-07 | Paper |
Delay Stochastic Simulation of Biological Systems: A Purely Delayed Approach | 2011-05-27 | Paper |
Spatial P systems | 2011-05-23 | Paper |
A Formalism for the Description of Protein Interaction Dedicated to Jerzy Tiuryn on the Occasion of his 60th Birthday | 2011-05-18 | Paper |
AN OVERVIEW ON OPERATIONAL SEMANTICS IN MEMBRANE COMPUTING | 2011-02-23 | Paper |
Membrane Systems Working in Generating and Accepting Modes: Expressiveness and Encodings | 2011-01-21 | Paper |
Weak bisimulation for probabilistic timed automata | 2010-11-19 | Paper |
Reachability results for timed automata with unbounded data structures | 2010-10-08 | Paper |
Compositional semantics of spiking neural P systems | 2010-08-24 | Paper |
Simulation of Kohn’s Molecular Interaction Maps through Translation into Stochastic CLS+ | 2010-02-02 | Paper |
Timed P Automata | 2009-09-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q5192921 | 2009-08-10 | Paper |
An intermediate language for the stochastic simulation of biological systems | 2009-08-07 | Paper |
Stochastic Calculus of Looping Sequences for the Modelling and Simulation of Cellular Pathways | 2009-07-28 | Paper |
\(\varepsilon\)-transitions in concurrent timed automata | 2009-07-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q3601853 | 2009-02-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q5506367 | 2009-01-28 | Paper |
Design and verification of long-running transactions in a timed framework | 2008-11-20 | Paper |
Bisimulation Congruences in the Calculus of Looping Sequences | 2008-09-11 | Paper |
Bisimulations in calculi modelling membranes | 2008-08-21 | Paper |
Compositional semantics and behavioral equivalences for P systems | 2008-05-19 | Paper |
The Calculus of Looping Sequences for Modeling Biological Membranes | 2008-03-28 | Paper |
Parametric probabilistic transition systems for system design and analysis | 2007-04-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q5486047 | 2006-09-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q5472932 | 2006-06-19 | Paper |
Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
Information and Communications Security | 2005-08-19 | Paper |
Monotonic hybrid systems | 2005-08-05 | Paper |
Concurrency in timed automata | 2004-10-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4818752 | 2004-10-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4461959 | 2004-05-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q2775864 | 2003-02-02 | Paper |
On disjunction of literals in triggers of statecharts transitions. | 2003-01-21 | Paper |
A comparison of Statecharts step semantics | 2003-01-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4782713 | 2002-12-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4536387 | 2002-06-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q2767177 | 2002-01-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q2729667 | 2001-07-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q4507819 | 2000-10-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q4490762 | 2000-07-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q4948014 | 2000-04-26 | Paper |
Time-based expressivity of time Petri nets for system specification | 1999-04-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4381715 | 1998-07-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4381716 | 1998-04-01 | Paper |
A kernel language for programmed rewriting of (hyper)graphs | 1995-11-19 | Paper |
Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata | 1994-05-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q4037329 | 1993-05-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4028132 | 1993-03-28 | Paper |
Towards an algebra for timed behaviours | 1993-01-16 | Paper |
TTL : a formalism to describe local and global properties of distributed systems | 1992-06-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q5748895 | 1991-01-01 | Paper |
Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata | 1991-01-01 | Paper |
SIMULATION OF SYSTOLIC TREE AUTOMATA ON TRELLIS AUTOMATA | 1990-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3361899 | 1990-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3474896 | 1990-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4206409 | 1989-01-01 | Paper |
Web structures: a tool for representing and manipulating programs | 1988-01-01 | Paper |
An algebra of processes | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3673162 | 1983-01-01 | Paper |
Processes of transforming structures | 1982-01-01 | Paper |
Comparing Hierarchies of Primitive Recursive Sequence Functions | 1982-01-01 | Paper |
Modeling a solution for a control problem in distributed systems by restrictions | 1981-01-01 | Paper |
Sequence recursiveness without cylindrification and limited register machines | 1981-01-01 | Paper |
Transformations of structures: An algebraic approach | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3952099 | 1980-01-01 | Paper |
Computable stack functions for semantics of stack programs | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3877026 | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3886907 | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4186306 | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4187304 | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4158499 | 1978-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4162628 | 1978-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4107887 | 1976-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4113810 | 1976-01-01 | Paper |
Proving a compiler correct: A simple approach | 1975-01-01 | Paper |
Sequence-to-sequence recursiveness | 1975-01-01 | Paper |
Recursion Structure Simplification | 1975-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4068071 | 1973-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4087154 | 1973-01-01 | Paper |
A flow diagram composition of Markov's normal algorithms without concluding formulas | 1973-01-01 | Paper |
Equivalence of partial recursivity and computability by algorithms without concluding formulas | 1972-01-01 | Paper |