Petri nets, event structures and domains. I
From MaRDI portal
Publication:1148680
DOI10.1016/0304-3975(81)90112-2zbMath0452.68067OpenAlexW1991052229WikidataQ109517082 ScholiaQ109517082MaRDI QIDQ1148680
Mogens Nielsen, Glynn Winskel, Gordon D. Plotkin
Publication date: 1981
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(81)90112-2
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)
Related Items (only showing first 100 items - show all)
History-preserving bisimilarity for higher-dimensional automata via open maps ⋮ Contracts as games on event structures ⋮ Detecting causal relationships in distributed computations: In search of the holy grail ⋮ Compact and efficiently verifiable models for concurrent systems ⋮ Domain and event structure semantics for Petri nets with read and inhibitor arcs ⋮ Well-behaved flow event structures for parallel composition and action refinement ⋮ EMSO-logic and automata related to homogeneous flow event structures ⋮ A compact representation for minimizers of \(k\)-submodular functions ⋮ Petri nets, algebras, morphisms, and compositionality ⋮ Comparative trace semantics of time Petri nets ⋮ Semantic domains of timed event structures ⋮ Configuration structures, event structures and Petri nets ⋮ Prime algebraicity ⋮ Denotational semantics in the cpo and metric approach ⋮ A technique of state space search based on unfolding ⋮ Synchronization trees ⋮ On the expressive power of behavioral profiles ⋮ Projective topology on bifinite domains and applications ⋮ Synthesis and equivalence of concurrent systems ⋮ Reduction of event structures under history preserving bisimulation ⋮ A distributed operational semantics of CCS based on condition/event systems ⋮ Partial ordering models for concurrency can be defined operationally ⋮ What topology tells us about diagnosability in partial order semantics ⋮ The difference between splitting in \(n\) and \(n+1\) ⋮ Concurrent transition systems ⋮ Concurrent systems and inevitability ⋮ Concurrency and atomicity ⋮ Event structures and domains ⋮ Unfolding semantics of graph transformation ⋮ Multilevel transitive and intransitive non-interference, causally ⋮ Petri nets, traces, and local model checking ⋮ Parallel product of event structures ⋮ Reversibility and asymmetric conflict in event structures ⋮ A coalgebraic semantics for causality in Petri nets ⋮ Toward uniform random generation in 1-safe Petri nets ⋮ An approach to innocent strategies as graphs ⋮ Deterministic concurrent strategies ⋮ Transfer of trust in event-based reputation systems ⋮ Modeling dependencies and simultaneity in membrane system computations ⋮ Abstract processes of place/transition systems ⋮ Untanglings: a novel approach to analyzing concurrent systems ⋮ Branching versus linear logics yet again ⋮ 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 ⋮ Petri nets are dioids: a new algebraic foundation for non-deterministic net theory ⋮ On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes ⋮ Sequential algorithms on concrete data structures ⋮ Branching processes of Petri nets ⋮ Domain theory for concurrency ⋮ Four domains for concurrency ⋮ An algebra of concurrent non-deterministic processes ⋮ Connectedness and synchronization ⋮ Event structures and trace monoids ⋮ Models for concurrency: Towards a classification ⋮ Quasi-prime algebraic domains ⋮ An event structure semantics for general Petri nets ⋮ Process versus unfolding semantics for Place/Transition Petri nets ⋮ Petri nets and bisimulation ⋮ A theory of processes with durational actions ⋮ Elementary transition systems ⋮ Spreading nets: a uniform approach to unfoldings ⋮ Causal automata ⋮ Processes of membrane systems with promoters and inhibitors ⋮ Petri games: synthesis of distributed systems with causal memory ⋮ Bisimulation and action refinement ⋮ An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems ⋮ \(dI\)--domains as prime information systems ⋮ Towards an algebra for timed behaviours ⋮ Conflict vs causality in event structures ⋮ Refinement of actions in event structures and causal trees ⋮ The poset of infinitary traces ⋮ Model-checking games for fixpoint logics with partial order models ⋮ Typed event structures and the linear \(\pi \)-calculus ⋮ Musings around the geometry of interaction, and coherence ⋮ A compact representation for modular semilattices and its applications ⋮ Distributed monitoring of concurrent and asynchronous systems ⋮ A Nice labelling for tree-like event structures of degree 3 ⋮ Schedulers and finishers: on generating and filtering the behaviours of an event structure ⋮ Quasi-optimal partial order reduction ⋮ On Scott's thesis for domains of information and well-quasi-orderings ⋮ Failures semantics based on interval semiwords is a congruence for refinement ⋮ A process algebra with distributed priorities ⋮ Stable trace automata vs. full trace automata ⋮ Recursive domain equations for concrete data structure ⋮ Series-parallel languages and the bounded-width property ⋮ Membership problems for regular and context-free trace languages ⋮ Building continuous webbed models for system F ⋮ Context-free event domains are recognizable ⋮ On linear logic planning and concurrency ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models ⋮ D-continuous causal nets: A model of non-sequential processes ⋮ Calculi for synchrony and asynchrony ⋮ Functorial models for Petri nets ⋮ Contextual Petri nets, asymmetric event structures, and processes ⋮ Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin ⋮ Using information systems to solve recursive domain equations ⋮ Relating conflict-free stable transition and event models via redex families ⋮ Proving partial order properties ⋮ The connection between an event structure semantics and an operational semantics for TCSP
Cites Work
This page was built for publication: Petri nets, event structures and domains. I
