[HTML][HTML] Back to the format: A survey on SOS for probabilistic processes
In probabilistic process algebras the classic qualitative description of process behaviour is
enriched with quantitative information on it, usually modelled in terms of probabilistic …
enriched with quantitative information on it, usually modelled in terms of probabilistic …
A landscape‐scale assessment of the relationship between grassland functioning, community diversity, and functional traits
Livestock farmers rely on a high and stable grassland productivity for fodder production to
sustain their livelihoods. Future drought events related to climate change, however, threaten …
sustain their livelihoods. Future drought events related to climate change, however, threaten …
[PDF][PDF] Discovering epassport vulnerabilities using bisimilarity
We uncover privacy vulnerabilities in the ICAO 9303 standard implemented by ePassports
worldwide. These vulnerabilities, confirmed by ICAO, enable an ePassport holder who …
worldwide. These vulnerabilities, confirmed by ICAO, enable an ePassport holder who …
[HTML][HTML] Reactive turing machines
We propose reactive Turing machines (RTMs), extending classical Turing machines with a
process-theoretical notion of interaction, and use it to define a notion of executable transition …
process-theoretical notion of interaction, and use it to define a notion of executable transition …
A process algebra for supervisory coordination
A supervisory controller controls and coordinates the behavior of different components of a
complex machine by observing their discrete behaviour. Supervisory control theory studies …
complex machine by observing their discrete behaviour. Supervisory control theory studies …
Sequential composition in the presence of intermediate termination
The standard operational semantics of the sequential composition operator gives rise to
unbounded branching and forgetfulness when transparent process expressions are put in …
unbounded branching and forgetfulness when transparent process expressions are put in …
Sequencing and intermediate acceptance: axiomatisation and decidability of bisimilarity
Abstract The Theory of Sequential Processes includes deadlock, successful termination,
action prefixing, alternative and sequential composition. Intermediate acceptance, which is …
action prefixing, alternative and sequential composition. Intermediate acceptance, which is …
Computation and Concurrency
Y Wang - arxiv preprint arxiv:2409.02595, 2024 - arxiv.org
arxiv:2409.02595v1 [cs.LO] 4 Sep 2024 Page 1 arxiv:2409.02595v1 [cs.LO] 4 Sep 2024 C o m
p u ta tio n a n d C o n cu rren cy — Y on g W an g — Page 2 Contents 1 Introduction 1 2 …
p u ta tio n a n d C o n cu rren cy — Y on g W an g — Page 2 Contents 1 Introduction 1 2 …
Computations and interaction
We enhance the notion of a computation of the classical theory of computing with the notion
of interaction. In this way, we enhance a Turing machine as a model of computation to a …
of interaction. In this way, we enhance a Turing machine as a model of computation to a …
Reactive turing machines
We propose reactive Turing machines (RTMs), extending classical Turing machines with a
process-theoretical notion of interaction. We show that every effective transition system is …
process-theoretical notion of interaction. We show that every effective transition system is …