scientific article

Publication date: 1982

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

parallel programming denotational semantics event structures synchronous 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)

Related Items

Distributed probabilistic and quantum strategies, Behavioural logics for configuration structures, Declarative event based models of concurrency and refinement in psi-calculi, Strategies as concurrent processes, Concurrent histories: a basis for observing distributed systems, Specification and top-down design of distributed systems, Petri nets, algebras, morphisms, and compositionality, Configuration structures, event structures and Petri nets, Prime algebraicity, Denotational semantics in the cpo and metric approach, An algebra of processes, Synchronization trees, Schedulers and Finishers: On Generating the Behaviours of an Event Structure, Model-Checking Games for Fixpoint Logics with Partial Order Models, A compositional proof system on a category of labelled transition systems, Rigid Families for the Reversible $$\pi $$ -Calculus, A distributed operational semantics of CCS based on condition/event systems, Contextual equivalences in configuration structures and reversibility, Sequential and concurrent behaviour in Petri net theory, Concurrency and atomicity, The true concurrency of differential interaction nets, Order algebras: a quantitative model of interaction, An algebraic view of interleaving and distributed operational semantics for CCS, Read-write causality, Concurrent weighted logic, Towards a categorical representation of reversible event structures, Event structure semantics for multiparty sessions, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra, Branching pomsets: design, expressiveness and applications to choreographies, Deterministic concurrent strategies, Transfer of trust in event-based reputation systems, 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, Control machines: A new model of parallelism for compositional specifications and their effective compilation, Event structures and trace monoids, Compilation of the ELECTRE reactive language into finite transition systems, On the implementation of concurrent calculi in net calculi: two case studies, Trellis processes: a compact representation for runs of concurrent systems, Structure of concurrency, Towards an algebra for timed behaviours, Trust in event structures, Model-checking games for fixpoint logics with partial order models, Typed event structures and the linear $\pi $-calculus, Metric semantics for true concurrent real time, A Nice labelling for tree-like event structures of degree 3, Unnamed Item, Probabilistic event structures and domains, Models and logics for true concurrency., Schedulers and finishers: on generating and filtering the behaviours of an event structure, Event structure semantics of (controlled) reversible CCS, Unnamed Item, Event structures for the reversible early internal $\pi$-calculus, On Scott's thesis for domains of information and well-quasi-orderings, Dynamic Causality in Event Structures, Distributed Strategies Made Easy, Minimisation of event structures, An interpretation of CCS into ludics, Calculi for synchrony and asynchrony, Event Structures with Symmetry, Event Structure Spans for Nondeterministic Dataflow, Probabilistic π-Calculus and Event Structures, Axiomatizing the subsumption and subword preorders on finite and infinite partial words, Redexes are stable in the λ-calculus