scientific article; zbMATH DE number 3821120
From MaRDI portal
Publication:3667958
Cited in
(67)- Calculi for synchrony and asynchrony
- Concurrent histories: a basis for observing distributed systems
- Specification and top-down design of distributed systems
- Petri nets, algebras, morphisms, and compositionality
- An algebra of processes
- A distributed operational semantics of CCS based on condition/event systems
- Sequential and concurrent behaviour in Petri net theory
- Concurrency and atomicity
- Control machines: A new model of parallelism for compositional specifications and their effective compilation
- Event structures and trace monoids
- Towards an algebra for timed behaviours
- Denotational semantics in the cpo and metric approach
- Synchronization trees
- Axiomatizing the subsumption and subword preorders on finite and infinite partial words
- Schedulers and finishers: on generating and filtering the behaviours of an event structure
- On Scott's thesis for domains of information and well-quasi-orderings
- Deterministic concurrent strategies
- Minimisation of event structures
- Behavioural logics for configuration structures
- Trust in event structures
- An interpretation of CCS into ludics
- Towards a categorical representation of reversible event structures
- Trellis processes: a compact representation for runs of concurrent systems
- Probabilistic event structures and domains
- A compositional proof system on a category of labelled transition systems
- Distributed probabilistic and quantum strategies
- Event structure semantics for multiparty sessions
- Declarative event based models of concurrency and refinement in psi-calculi
- Strategies as concurrent processes
- Event structures with symmetry
- Event structure spans for nondeterministic dataflow
- Probabilistic -calculus and event structures
- Schedulers and finishers: on generating the behaviours of an event structure
- Model-Checking Games for Fixpoint Logics with Partial Order Models
- Rigid families for the reversible -calculus
- Contextual equivalences in configuration structures and reversibility
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
- Transfer of trust in event-based reputation systems
- The true concurrency of differential interaction nets
- Order algebras: a quantitative model of interaction
- scientific article; zbMATH DE number 7559463 (Why is no real title available?)
- An algebraic view of interleaving and distributed operational semantics for CCS
- Read-write causality
- Distributed Strategies Made Easy
- scientific article; zbMATH DE number 7204431 (Why is no real title available?)
- Redexes are stable in the -calculus
- Model-checking games for fixpoint logics with partial order models
- Event structure semantics of (controlled) reversible CCS
- Event structures for the reversible early internal \(\pi\)-calculus
- Metric semantics for true concurrent real time
- Models and logics for true concurrency.
- Branching pomsets: design, expressiveness and applications to choreographies
- The mays and musts of concurrent strategies
- Global types and event structure semantics for asynchronous multiparty sessions
- Compilation of the ELECTRE reactive language into finite transition systems
- On the implementation of concurrent calculi in net calculi: two case studies
- Structure of concurrency
- Concurrent games over relational structures: the origin of game comonads
- Reversible computations are computations
- Configuration structures, event structures and Petri nets
- Prime algebraicity
- Concurrent weighted logic
- Some behavioural aspects of net theory
- Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems)
- A partial ordering semantics for CCS
- Typed event structures and the linear \(\pi \)-calculus
- A Nice labelling for tree-like event structures of degree 3
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3667958)
