A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We formulate a procedure for converting operators of standard algebraic process calculi such as CCS, ACP and CSP into reversible operators, while preserving their operational semantics. ... Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languages for quantum computing ... As far as we are aware, this is the first time this has been done for algebraic process calculi. ...doi:10.1007/11690634_17 fatcat:x6kabcivwfe5jnfpvnkg5xocda
We formulate a procedure for converting operators of standard algebraic process calculi such as CCS into reversible operators, while preserving their operational semantics. ... We define forward-reverse bisimulation and show that it is preserved by all reversible operators. ... As far as we are aware, this is the first time this has been done for algebraic process calculi. ...doi:10.1016/j.jlap.2006.11.002 fatcat:3yy2gjfemzd2xhysgmmg3ntzpm
The paper "Revisiting sequential composition in process calculi" reviews the various ways sequential composition is defined in traditional process calculi. ... The special issue features 8 articles ranging from classical process theory and behavioural abstraction up to coalgebraic semantics, types, and security. ... We would also like to thank the editors of JLAMP, for their support during the whole editorial process. ...doi:10.1016/j.jlamp.2015.10.002 fatcat:wlhmlgzgufeu7ofu3as3qsq22i
The formalization of process algebras usually starts with a minimal core of operators and rules for its transition system, and then relax the system to improve its usability and ease the proofs. ... For the two reversible calculi extending CCS, the situation is less clear: CCS with Communication Keys (CCSK) was first defined without any structural congruence, and then was endowed with a fragment of ... V] : "In a process-algebraic approach to system verification, one typically writes two specifications. ...arXiv:2005.06818v1 fatcat:sdtq3gaq35eazdbsbs65zqp5ra
We present axiomatisations for three types of demonic calculi, i.e., calculi for relations with forward demonic, backward demonic or two-way demonic operators. ... We show that whether a given regular or context-free language is reverse closed is decidable. We study certain proper- ties concerning reverse closed finite maximal prefix codes in this paper. ...
We give an algebraic definition of the Hoare triple, and algebraic proofs of all the relevant laws for concurrent separation logic. ... We end with a section in praise of algebra, of which Carroll Morgan is such a master. ... By reversal of time, every triple provable from the algebra gives rise to another triple. ...doi:10.1007/s00165-012-0249-0 fatcat:6jsnrjik7fc5nhiqlu3w5edpii
Psi-calculi are operational and largely non-graphical, but have strong foundation based on the theory of nominal sets and process algebras. ... Psi-calculi is a parametric formalism where calculi like spi- or applied-pi are found as instances. ... coming from the process algebra approach. ...doi:10.4204/eptcs.148.5 fatcat:yqzdcg2t65aytar337tcojfjai
Natural Computing Series
A comprehensive picture of the state of the art of the process calculi approach to biological modeling is still missing. ... A most recent approach consists in interpreting the living entities as terms of process calculi where the behavior of the represented systems can be inferred by applying syntaxdriven rules. ... Based on this observation, CCS-R is a CCS-like process algebra  with the peculiarity that reversibility is embedded in the syntax. ...doi:10.1007/978-3-540-88869-7_23 fatcat:v6eipkqozrczrh7fxkcluyhkbu
We consider the problem of integrating different systems biology formalisms , namely, the process calculi based formalism, the modeling approach based on systems of differential equations , and the one ... ours pursued the recent work in  , dealing with translation of process algebra models of signalling pathways to ODE. ... Automata-Based Systems Biology In [3, 4] Process Calculi Process calculi have been originally introduced in Computer Science as a theoretical framework to model and analyze communicating and mobile ...doi:10.11234/gi1990.16.2_215 fatcat:frirnia6crarxmk7nyexxljtsa
These calculi provide a control on the substitution process—deadlocks may arise if not enough resources are available to carry out all the substitutions needed to pursue a computation. ... The design of these calculi was motivated by Milner’s encoding of the A-calculus in the z-calculus. ...
This approach, which generalizes traditional process calculi, has been used to define the new LNT language implemented in the CADP toolbox. ... The article reviews the various ways sequential composition is defined in traditional process calculi, and shows that such definitions are not optimal, thus limiting the dissemination of concurrency theory ... Introduction Process calculi (or process algebras) are a corner stone of concurrency theory and exist under many variants, among which CCS [1, 2], CSP [3, 4, 5] , MEIJE  , ACP 2 [7, 8, 9] , LOTOS ...doi:10.1016/j.jlamp.2015.08.001 fatcat:c3jyidbbvnacvf7gmovonpc4j4
one of Kréger which contains a cut rule (rule of detachment), i.e. the two calculi determine the same set of provable formulae. ... The cut-free calculus has all the well-known nice properties of sequent calculi and behaves more smoothly in the construction of proofs than the one of Kroger. ...
In that simplified framework, the model turns effective and, more- over, decidable.” 87h:68041 Gonthier, Georges 87h:68042 Algebraic calculi of processes and net expressions. Theoret. Comput. ... Summary: “It is shown that the MEIJE algebra of processes can be expressed in a flow algebra, the algebra of net expressions. We then use this fact to derive a normal form for the calculus.” ...
Lecture Notes in Computer Science
demonstrated equivalent to Boolean algebras, and extended categorically to form a sound and complete semantics for this system. ... A pair of interacting proof calculi for reasoning about these circuits is presented, based on classical propositional logic and monoidal structure, and a natural order-theoretic structure is developed, ... The authors acknowledge support from the Danish Council for Independent Research | Natural Sciences under the Foundations of Reversible Computing project, and partial support from COST Action IC1405 Reversible ...doi:10.1007/978-3-662-52921-8_4 fatcat:ondwguxmpbb3jklvp6irgwatuu
This paper presents a comparison of web service composition between BPEL and process algebra, cCSP. ... In recent years, several researches suggested that process algebras provide a satisfactory assistance to the whole process of web services development. ... Transactions and calculi have met in recent years both for formalizing protocols as well as adding transaction features to process calculi  -  . ...arXiv:1402.5592v1 fatcat:cdikarpdencohcrwmzwls4ycsi
« Previous Showing results 1 — 15 out of 2,527 results