Petri nets, event structures and domains. I
DOI10.1016/0304-3975(81)90112-2zbMATH Open0452.68067OpenAlexW1991052229WikidataQ109517082 ScholiaQ109517082MaRDI QIDQ1148680FDOQ1148680
Authors: 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)
Cites Work
- Initial Algebra Semantics and Continuous Algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- Data Types as Lattices
- Bases for Chain-complete Posets
- Title not available (Why is that?)
- Concurrent Processes and Their Syntax
- Mathematical aspects of net theory
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Using information systems to solve recursive domain equations
- Event structures and domains
- Four domains for concurrency
- A technique of state space search based on unfolding
- McMillan’s Complete Prefix for Contextual Nets
- Model-checking games for fixpoint logics with partial order models
- Musings around the geometry of interaction, and coherence
- History-preserving bisimilarity for higher-dimensional automata via open maps
- Denotational semantics in the cpo and metric approach
- Petri nets, algebras, morphisms, and compositionality
- Behavioural logics for configuration structures
- Causal automata
- Petri nets and bisimulation
- Contracts as games on event structures
- An approach to innocent strategies as graphs
- Modeling dependencies and simultaneity in membrane system computations
- Transfer of trust in event-based reputation systems
- Partial order techniques for distributed discrete event systems: why you cannot avoid using them
- A distributed operational semantics of CCS based on condition/event systems
- Sequential algorithms on concrete data structures
- Imperfect information in logic and concurrent games
- Typed event structures and the linear \(\pi \)-calculus
- Modeling, analyzing and slicing periodic distributed computations
- \(m\)-algebraic lattices in formal concept analysis
- A hierarchy of reverse bisimulations on stable configuration structures
- \(dI\)--domains as prime information systems
- Configuration structures, event structures and Petri nets
- Causality and true concurrency: A data-flow analysis of the Pi-Calculus
- Processes of membrane systems with promoters and inhibitors
- Synchronization trees
- Calculi for synchrony and asynchrony
- A trace semantics for Petri Nets
- Comparative trace semantics of time Petri nets
- A theory of processes with durational actions
- The difference between splitting in \(n\) and \(n+1\)
- Bayesian network semantics for Petri nets
- Unfolding semantics of graph transformation
- Elementary transition systems
- An event structure semantics for general Petri nets
- The 4C Spectrum of Fundamental Behavioral Relations for Concurrent Systems
- Deterministic concurrent strategies
- On the expressive power of behavioral profiles
- Reduction of event structures under history preserving bisimulation
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes
- Branching processes of Petri nets
- Building continuous webbed models for system F
- Proving partial order properties
- The connection between an event structure semantics and an operational semantics for TCSP
- Unfolding Graph Transformation Systems: Theory and Applications to Verification
- On the expressiveness of higher dimensional automata
- Probabilistic event structures and domains
- Series-parallel languages and the bounded-width property
- Process versus unfolding semantics for Place/Transition Petri nets
- A Nice labelling for tree-like event structures of degree 3
- On causal semantics of Petri nets (extended abstract)
- Event structures and trace monoids
- Membership problems for regular and context-free trace languages
- Some monoidal closed categories of stable domains and event structures
- Event structures with symmetry
- Contextual Petri nets, asymmetric event structures, and processes
- Domain and event structure semantics for Petri nets with read and inhibitor arcs
- Detecting causal relationships in distributed computations: In search of the holy grail
- Abstract processes of place/transition systems
- Branching Processes of General Petri Nets
- What topology tells us about diagnosability in partial order semantics
- A Bayesian model for event-based trust
- Bisimulation and action refinement
- Event structure spans for nondeterministic dataflow
- Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence)
- Parallel product of event structures
- Distributed monitoring of concurrent and asynchronous systems
- On relating some models for concurrency
- Concurrent transition systems
- On the category of Petri net computations
- Bistructures, bidomains and linear logic
- Semantics of Deterministic Shared-Memory Systems
- Partial Orders, Event Structures and Linear Strategies
- Quasi-prime algebraic domains
- Refinement of actions in event structures and causal trees
- Petri games: synthesis of distributed systems with causal memory
- An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems
- Models for concurrency: Towards a classification
- Medians in median graphs and their cube complexes in linear time
- Step traces
- A logic for true concurrency
- Spreading nets: a uniform approach to unfoldings
- Petri nets, traces, and local model checking
- Bayesian strategies: probabilistic programs as generalised graphical models
- Pomset bisimulation and unfolding for reset Petri nets
- On quantitative comparison of chemical reaction network models
- Conflict vs causality in event structures
- Relating conflict-free stable transition and event models via redex families
- Trellis processes: a compact representation for runs of concurrent systems
- Deterministic concurrent systems
- Title not available (Why is that?)
- Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
- Solving high-level Petri games
- An extension of the notions of traces and of asynchronous automata
- Rabin's theorem in the concurrency setting: a conjecture
This page was built for publication: Petri nets, event structures and domains. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1148680)