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