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)
- 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
- Configuration- and residual-based transition systems for event structures with asymmetric conflict
- Compact and efficiently verifiable models for concurrent systems
- Title not available (Why is that?)
- A compact representation for modular semilattices and its applications
- Unlabeled sample compression schemes and corner peelings for ample and maximum classes
- EMSO-logic and automata related to homogeneous flow event structures
- Towards refinable choreographies
- Building bridges between sets of partial orders
- A compact representation for minimizers of \(k\)-submodular functions
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes
- Title not available (Why is that?)
- Towards a Truly Concurrent Semantics for Reversible CCS
- Well-behaved flow event structures for parallel composition and action refinement
- Step bisimulation is pomset equivalence on a parallel language without explicit internal choice
- A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract)
- Schedulers and finishers: on generating and filtering the behaviours of an event structure
- Schedulers and finishers: on generating the behaviours of an event structure
- Graph-grammar semantics of a higher-order programming language for distributed systems
- Discovering unseen behaviour from event logs
- The synthesis problem for repeatedly communicating Petri games
- Quasi-optimal partial order reduction
- Abstract processes and conflicts in place/transition systems
- Concurrent semantics for fusions: weak prime domains and connected event structures
- A study on team bisimulation and H-team bisimulation for BPP nets
- Stone duality, topological algebra, and recognition.
- Title not available (Why is that?)
- On Scott's thesis for domains of information and well-quasi-orderings
- Causality, behavioural equivalences, and the security of cyberphysical systems
- Toward uniform random generation in 1-safe Petri nets
- Model checking using net unfoldings
- Title not available (Why is that?)
- Title not available (Why is that?)
- On relating rewriting systems and graph grammars to event structures
- ``Truly concurrent and nondeterministic semantics of discrete-time Petri nets
- Process Mining Reloaded: Event Structures as a Unified Representation of Process Models and Event Logs
- A Petri net view of covalent bonds
- Minimisation of event structures
- Petri nets are dioids: a new algebraic foundation for non-deterministic net theory
- Flow unfolding of multi-clock nets
- 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
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)