Results 51 to 60 of about 133,366 (251)
Timed Runtime Monitoring for Multiparty Conversations [PDF]
, 2014 We propose a dynamic verification framework for protocols in real-time distributed systems. The framework is based on Scribble, a tool-chain for design and verification of choreographies based on multiparty session types, developed with our industrial ...
Yoshida, N +8 more
core +1 more source
Timed Concurrent State Machines
Computer Science, 2007 Timed Concurrent State Machines are an application of Alur Timed Automata concept tocoincidence-based (rather than interleaving) CSM modeling technique.
Wiktor B. Daszczuk
doaj +1 more source
Language Preservation Problems in Parametric Timed Automata [PDF]
Logical Methods in Computer Science, 2020 Parametric timed automata (PTA) are a powerful formalism to model and reason about concurrent systems with some unknown timing delays. In this paper, we address the (untimed) language- and trace-preservation problems: given a reference parameter ...
Étienne André +2 more
doaj +1 more source
Modelling stem cell differentiation related processes—A practical overview for biologists
FEBS Letters, EarlyView.Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
, 2005 MONA implements an efficient decision procedure for the logic WS1S, and has already been applied in many non-trivial problems. Among these, we follow on from previous work done by Smith and Klarlund on the verification of a sliding-window protocol.
Howard Bowman +2 more
core
Timed Automata Semantics for Visual e-Contracts [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 C-O Diagrams have been introduced as a means to have a more visual representation of electronic contracts, where it is possible to represent the obligations, permissions and prohibitions of the different signatories, as well as what are the penalties in ...
Enrique Martínez +3 more
doaj +1 more source
An epithelial GPR35 isoform supports tumor‐associated transcriptional and metabolic phenotypes
FEBS Letters, EarlyView.GPR35 generates two functionally distinct isoforms with previously unresolved roles. GPR35‐short mediates immune‐cell chemotaxis, while GPR35‐long is enriched in colorectal cancer epithelium, where it supports increased metabolism, proliferation, and tumor‐associated transcriptional programs.
Jørgen D. Rønneberg +14 more
wiley +1 more source
Simulation and Bisimulation for Probabilistic Timed Automata [PDF]
, 2010 Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the context of the analysis of system models, with applications in the stepwise ...
Jeremy Sproston +4 more
core +1 more source
Behavioural equivalences for timed systems [PDF]
Logical Methods in Computer Science, 2019 Timed transition systems are behavioural models that include an explicit treatment of time flow and are used to formalise the semantics of several foundational process calculi and automata. Despite their relevance, a general mathematical characterisation
Tomasz Brengos, Marco Peressotti
doaj +1 more source
Golgi enzymes are retrieved from the plasma membrane to the trans‐Golgi network
FEBS Letters, EarlyView.Golgi enzymes are traditionally considered resident proteins retained within the Golgi apparatus. Here, we demonstrate that a subset transiently reaches the cell surface and is subsequently retrieved to the trans‐Golgi network via retrograde transport. Using a nanobody‐based toolkit, we uncover a dynamic trafficking cycle of several Golgi enzymes.
Dominik P. Buser, Tina Junne
wiley +1 more source