Cites work
- scientific article; zbMATH DE number 3677208 (Why is no real title available?)
- scientific article; zbMATH DE number 3703981 (Why is no real title available?)
- scientific article; zbMATH DE number 3793435 (Why is no real title available?)
- scientific article; zbMATH DE number 3598539 (Why is no real title available?)
- scientific article; zbMATH DE number 3362972 (Why is no real title available?)
- Bases for Chain-complete Posets
- Concurrent Processes and Their Syntax
- Data Types as Lattices
- Initial Algebra Semantics and Continuous Algebras
- Mathematical aspects of net theory
Cited in
(only showing first 100 items - show all)- Flow unfolding of multi-clock nets
- Using information systems to solve recursive domain equations
- Spreading nets: a uniform approach to unfoldings
- Event structures and domains
- Step traces
- A logic for true concurrency
- Four domains for concurrency
- A partial ordering semantics for CCS
- A technique of state space search based on unfolding
- The poset of infinitary traces
- History-preserving bisimilarity for higher-dimensional automata via open maps
- Model-checking games for fixpoint logics with partial order models
- Musings around the geometry of interaction, and coherence
- McMillan’s Complete Prefix for Contextual Nets
- Functorial models for Petri nets
- Failures semantics based on interval semiwords is a congruence for refinement
- Petri nets, traces, and local model checking
- Denotational semantics in the cpo and metric approach
- Petri nets, algebras, morphisms, and compositionality
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes
- Behavioural logics for configuration structures
- scientific article; zbMATH DE number 7215282 (Why is no real title available?)
- Whole-grain Petri nets and processes
- Causal automata
- Bayesian strategies: probabilistic programs as generalised graphical models
- Petri nets and bisimulation
- Concurrency for Graph Grammars in a Petri net shell
- A Study on Team Bisimulations for BPP Nets
- Pomset bisimulation and unfolding for reset Petri nets
- scientific article; zbMATH DE number 7147446 (Why is no real title available?)
- Contracts as games on event structures
- Semantic domains of timed event structures
- Conflict vs causality in event structures
- Conflict vs causality in event structures
- Concurrency and atomicity
- On quantitative comparison of chemical reaction network models
- Relating conflict-free stable transition and event models via redex families
- Synthesis and equivalence of concurrent systems
- scientific article; zbMATH DE number 1231483 (Why is no real title available?)
- Trellis processes: a compact representation for runs of concurrent systems
- Orthomodular Lattices in Occurrence Nets
- An approach to innocent strategies as graphs
- Modeling dependencies and simultaneity in membrane system computations
- Transfer of trust in event-based reputation systems
- Metric semantics for true concurrent real time
- Deterministic concurrent systems
- Prime algebraicity
- A distributed operational semantics of CCS based on condition/event systems
- An extension of the notions of traces and of asynchronous automata
- Partial order techniques for distributed discrete event systems: why you cannot avoid using them
- Unified mathematical framework for slicing and symmetry reduction over event structures
- Branching pomsets: design, expressiveness and applications to choreographies
- Solving high-level Petri games
- Sequential algorithms on concrete data structures
- Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
- Opportunistic monitoring of multithreaded programs
- scientific article; zbMATH DE number 7649934 (Why is no real title available?)
- Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems)
- Towards an algebra for timed behaviours
- Compact and efficiently verifiable models for concurrent systems
- Rabin's theorem in the concurrency setting: a conjecture
- Partial ordering models for concurrency can be defined operationally
- Configuration- and residual-based transition systems for event structures with asymmetric conflict
- Imperfect information in logic and concurrent games
- Typed event structures and the linear \(\pi \)-calculus
- A compact representation for modular semilattices and its applications
- Unlabeled sample compression schemes and corner peelings for ample and maximum classes
- Parameter space abstraction and unfolding semantics of discrete regulatory networks
- Projective topology on bifinite domains and applications
- Modeling, analyzing and slicing periodic distributed computations
- Context-free event domains are recognizable
- scientific article; zbMATH DE number 7649892 (Why is no real title available?)
- Invariant Analysis for Multi-agent Graph Transformation Systems Using k-Induction
- A process algebra with distributed priorities
- Stable trace automata vs. full trace automata
- EMSO-logic and automata related to homogeneous flow event structures
- Domain theory for concurrency
- Configuration structures, event structures and Petri nets
- Towards refinable choreographies
- \(dI\)--domains as prime information systems
- A compact representation for minimizers of \(k\)-submodular functions
- \(m\)-algebraic lattices in formal concept analysis
- A hierarchy of reverse bisimulations on stable configuration structures
- Concurrent systems and inevitability
- Building bridges between sets of partial orders
- High-level representation of benchmark families for Petri games
- Processes of membrane systems with promoters and inhibitors
- Synchronization trees
- Calculi for synchrony and asynchrony
- True-concurrency probabilistic models: Markov nets and a law of large numbers
- Causality and true concurrency: A data-flow analysis of the Pi-Calculus
- Comparative trace semantics of time Petri nets
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes
- A trace semantics for Petri Nets
- A theory of processes with durational actions
- Sound concurrent traces for online monitoring
- ENFORCING CONCURRENT TEMPORAL BEHAVIORS
- The difference between splitting in \(n\) and \(n+1\)
- Denotational, causal, and operational determinism in event structures
- Unfolding semantics of graph transformation
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)
