AbstractThe first and the second author introduced reversible CCS (RCCS) in order to model concurrent computations where certain actions are allowed to be reversed. Here we show that the core of the construction can be analysed at an abstract level, yielding a theorem of pure category theory which underlies the previous results. This opens the way to several new examples; in particular we demonstrate an application to Petri nets
History-and hereditary history-preserving bisimulation (HPB and HHPB) are equivalences relations for...
CCSK is a reversible form of CCS which is causal, meaning that ac- tions can be reversed if and only...
We study categories for reversible computing, focussing on reversible forms of event structures. Eve...
The first and the second author introduced reversible ccs (rccs) in order to model concurrent comput...
International audienceReversible CCS (RCCS) is a well-established, formal model for reversible commu...
The notion of reversible computing is attracting interest because of its applications in diverse fie...
The main motivations for studying reversible computing comes from the promise that reversible compu...
The notion of reversible computing is attracting interest because of its applications in diverse fie...
Existing formalisms for the algebraic specification and representation of networks of reversible age...
International audienceThe notion of reversible computing is attracting interest because of its appli...
Conference postponed to 2021 due to covid-19International audienceUndoing computations of a concurre...
Petri nets are a well-known model of concurrency and provide an ideal setting for the study of funda...
International audienceExisting formalisms for the algebraic specification and representation of netw...
The notion of reversible computation is attracting increasing interest because of its applications i...
AbstractThere is a growing interest in models of reversible computation driven by exciting applicati...
History-and hereditary history-preserving bisimulation (HPB and HHPB) are equivalences relations for...
CCSK is a reversible form of CCS which is causal, meaning that ac- tions can be reversed if and only...
We study categories for reversible computing, focussing on reversible forms of event structures. Eve...
The first and the second author introduced reversible ccs (rccs) in order to model concurrent comput...
International audienceReversible CCS (RCCS) is a well-established, formal model for reversible commu...
The notion of reversible computing is attracting interest because of its applications in diverse fie...
The main motivations for studying reversible computing comes from the promise that reversible compu...
The notion of reversible computing is attracting interest because of its applications in diverse fie...
Existing formalisms for the algebraic specification and representation of networks of reversible age...
International audienceThe notion of reversible computing is attracting interest because of its appli...
Conference postponed to 2021 due to covid-19International audienceUndoing computations of a concurre...
Petri nets are a well-known model of concurrency and provide an ideal setting for the study of funda...
International audienceExisting formalisms for the algebraic specification and representation of netw...
The notion of reversible computation is attracting increasing interest because of its applications i...
AbstractThere is a growing interest in models of reversible computation driven by exciting applicati...
History-and hereditary history-preserving bisimulation (HPB and HHPB) are equivalences relations for...
CCSK is a reversible form of CCS which is causal, meaning that ac- tions can be reversed if and only...
We study categories for reversible computing, focussing on reversible forms of event structures. Eve...
DOI
Add to ORKG