[图书][B] Handbook of process algebra
Process Algebra is a formal description technique for complex computer systems, especially
those involving communicating, concurrently executing components. It is a subject that …
those involving communicating, concurrently executing components. It is a subject that …
[HTML][HTML] Theory of interaction
Y Fu - Theoretical Computer Science, 2016 - Elsevier
Abstract Theory of Interaction aims to provide a foundational framework for computation and
interaction. It proposes four fundamental principles that characterize the common features of …
interaction. It proposes four fundamental principles that characterize the common features of …
[图书][B] Modelling and analysis of communicating systems
Robin Milner observed in 1973 that the primary task of computers appeared to be interacting
with their environment, yet the theory of programs and programming at that time seemed to …
with their environment, yet the theory of programs and programming at that time seemed to …
The value-passing calculus
Y Fu - Theories of Programming and Formal Methods: Essays …, 2013 - Springer
A value-passing calculus is a process calculus in which the contents of communications are
values chosen from some data domain, and the propositions appearing in the conditionals …
values chosen from some data domain, and the propositions appearing in the conditionals …
[引用][C] Modeling and analysis of communicating systems
JF Groote, MR Mousavi - 2014 - MIT press
The name-passing calculus
Y Fu, H Zhu - arXiv preprint arXiv:1508.00093, 2015 - arxiv.org
Name-passing calculi are foundational models for mobile computing. Research into these
models has produced a wealth of results ranging from relative expressiveness to …
models has produced a wealth of results ranging from relative expressiveness to …
Unique fixpoint induction for value-passing processes
J Rathke - Proceedings of Twelfth Annual IEEE Symposium on …, 1997 - ieeexplore.ieee.org
We investigate the use of unique fixpoint induction as a proof method for value-passing
process languages with recursion. An intuitive generalisation of unique fixpoint induction …
process languages with recursion. An intuitive generalisation of unique fixpoint induction …
Finite bisimulation of reactive untimed infinite state systems modeled as automata with variables
C Zhou, R Kumar - IEEE Transactions on Automation Science …, 2012 - ieeexplore.ieee.org
Some discrete-event systems such as software are typically infinite state systems, and a
commonly used technique for performing formal analysis such as automated verification is …
commonly used technique for performing formal analysis such as automated verification is …
A regular viewpoint on processes and algebra
K Lodaya - Acta Cybernetica, 2006 - cyber.bibl.u-szeged.hu
While different algebraic structures have been proposed for the treatment of concurrency,
finding solutions for equations over these structures needs to be worked on further. This …
finding solutions for equations over these structures needs to be worked on further. This …