Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Refinement of actions in event structures and causal trees
MFCS '90 Selected papers of the 15th international symposium on Mathematical foundations of computer science
Flow models of distributed computations: three equivalent semantics for CCS
Information and Computation
On the nature of events: another perspective in concurrency
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Parallel product of event structures
Theoretical Computer Science
Refinement of actions and equivalence notions for concurrent systems
Acta Informatica
Permutation of transitions: An event structure semantics for CCS and SCCS
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
Concurrency, Graphs and Models
| Hi-index | 5.23 |
Flow event structures were introduced as a model for giving semantics to process algebras. However, it turned out that certain restrictions have to be made to make them suitable for this purpose. In this paper, we investigate subclasses of flow event structures which are both suited for the process algebraic composition operators, and for action refinement as a means of regarding processes on different levels of abstraction.First, suitable subclasses are characterised. Then two specific subclasses are proposed. The larger class generalises the one from Castellani and Zhang (Theoret. Comput. Sci. 179 (1997) 203-215), which is not suitable for action refinement. The smaller one is still sufficiently expressive for dealing with all standard process algebras and action refinement.