scientific article; zbMATH DE number 3821120
From MaRDI portal
Publication:3667958
zbMATH Open0518.68045MaRDI QIDQ3667958FDOQ3667958
Authors: Glynn Winskel 
Publication date: 1982
Title of this publication is not available (Why is that?)
denotational semanticsevent structuresparallel programmingsynchronous and asynchronous communication
Formal languages and automata (68Q45) Deterministic network models in operations research (90B10) Algebraic theory of languages and automata (68Q70) Semantics in the theory of computing (68Q55)
Cited In (65)
- Branching pomsets: design, expressiveness and applications to choreographies
- Distributed Strategies Made Easy
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
- The mays and musts of concurrent strategies
- Global types and event structure semantics for asynchronous multiparty sessions
- Models and logics for true concurrency.
- Redexes are stable in the \(\lambda\)-calculus
- Order algebras: a quantitative model of interaction
- The true concurrency of differential interaction nets
- Specification and top-down design of distributed systems
- A partial ordering semantics for CCS
- Concurrent histories: a basis for observing distributed systems
- Model-checking games for fixpoint logics with partial order models
- Distributed probabilistic and quantum strategies
- Read-write causality
- Denotational semantics in the cpo and metric approach
- Petri nets, algebras, morphisms, and compositionality
- Behavioural logics for configuration structures
- Event structures for the reversible early internal \(\pi\)-calculus
- An algebra of processes
- An interpretation of CCS into ludics
- Declarative event based models of concurrency and refinement in psi-calculi
- Metric semantics for true concurrent real time
- Concurrency and atomicity
- Trellis processes: a compact representation for runs of concurrent systems
- Transfer of trust in event-based reputation systems
- Prime algebraicity
- A distributed operational semantics of CCS based on condition/event systems
- 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
- Rigid families for the reversible \(\pi \)-calculus
- Calculi for synchrony and asynchrony
- Probabilistic \(\pi\)-calculus and event structures
- Sequential and concurrent behaviour in Petri net theory
- Towards a categorical representation of reversible event structures
- Axiomatizing the subsumption and subword preorders on finite and infinite partial words
- Trust in event structures
- Deterministic concurrent strategies
- Title not available (Why is that?)
- Concurrent weighted logic
- A compositional proof system on a category of labelled transition systems
- Schedulers and finishers: on generating and filtering the behaviours of an event structure
- Probabilistic event structures and domains
- Schedulers and finishers: on generating the behaviours of an event structure
- A Nice labelling for tree-like event structures of degree 3
- 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
- Event structure semantics of (controlled) reversible CCS
- Some behavioural aspects of net theory
- Contextual equivalences in configuration structures and reversibility
- On Scott's thesis for domains of information and well-quasi-orderings
- Event structure spans for nondeterministic dataflow
- An algebraic view of interleaving and distributed operational semantics for CCS
- Event structure semantics for multiparty sessions
- Title not available (Why is that?)
- Minimisation of event structures
- 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)
