Branching processes of Petri nets
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3896316 (Why is no real title available?)
- scientific article; zbMATH DE number 4030999 (Why is no real title available?)
- scientific article; zbMATH DE number 4060688 (Why is no real title available?)
- Petri nets with individual tokens
- Petri nets, event structures and domains. I
- The non-sequential behaviour of Petri nets
Cited in
(73)- Flow unfolding of multi-clock nets
- Spreading nets: a uniform approach to unfoldings
- Recent advances in unfolding technique
- McMillan’s Complete Prefix for Contextual Nets
- Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
- A causal semantic for time Petri nets
- A Study on Team Bisimulations for BPP Nets
- Model checking data flows in concurrent network updates
- Generalized Alignment-Based Trace Clustering of Process Behavior
- scientific article; zbMATH DE number 2059843 (Why is no real title available?)
- Trellis processes: a compact representation for runs of concurrent systems
- Solving high-level Petri games
- Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
- scientific article; zbMATH DE number 7649934 (Why is no real title available?)
- scientific article; zbMATH DE number 1956601 (Why is no real title available?)
- Parameter space abstraction and unfolding semantics of discrete regulatory networks
- Clustering for Petri nets
- Configuration structures, event structures and Petri nets
- Adding branching to the strand space model
- Merged processes: a new condensed representation of Petri net behaviour
- How Much Is Worth to Remember? A Taxonomy Based on Petri Nets Unfoldings
- High-level representation of benchmark families for Petri games
- Comparative trace semantics of time Petri nets
- A trace semantics for Petri Nets
- Compositional process semantics of Petri Boxes
- Petri Nets Are Dioids
- On the well-foundedness of adequate orders used for construction of complete unfolding prefixes
- Denotational, causal, and operational determinism in event structures
- Describing Behavior of Processes with Many-to-Many Interactions
- An algorithm for direct construction of complete merged processes
- An event structure semantics for general Petri nets
- A framework for the verification of infinite-state graph transformation systems
- scientific article; zbMATH DE number 522857 (Why is no real title available?)
- Verification of bounded Petri nets using integer programming
- Calculi of net structures and sets are similar
- On the expressive power of behavioral profiles
- Computing the reveals relation in occurrence nets
- A two-player asynchronous game on fully observable Petri nets
- Merging relations: a way to compact Petri nets' behaviors uniformly
- Oclets – Scenario-Based Modeling with Petri Nets
- Non-atomic transition firing in contextual nets
- Taking complete finite prefixes to high level, symbolically
- Branching processes of timed Petri nets
- Critical paths in the partial order unfolding of a stochastic Petri net
- Maximal confluent processes
- Observable liveness of Petri nets
- Time processes for time Petri nets
- An algebraic characterization of independence of Petri net processes
- On the expressiveness of higher dimensional automata
- Process versus unfolding semantics for Place/Transition Petri nets
- The synthesis problem for repeatedly communicating Petri games
- Abstract processes and conflicts in place/transition systems
- A study on team bisimulation and H-team bisimulation for BPP nets
- On causal semantics of Petri nets (extended abstract)
- Combining free choice and time in Petri nets
- Model checking reversible systems: forwardly
- Abstract processes of place/transition systems
- What topology tells us about diagnosability in partial order semantics
- Branching Processes of General Petri Nets
- Non-interference notions based on reveals and excludes relations for Petri nets
- Deadlock detection-oriented unfolding of unbounded Petri nets
- Model checking using net unfoldings
- scientific article; zbMATH DE number 7561325 (Why is no real title available?)
- Efficient semantics-based compliance checking using LTL formulae and unfolding
- Distributed monitoring of concurrent and asynchronous systems
- ``Truly concurrent and nondeterministic semantics of discrete-time Petri nets
- Taking complete finite prefixes to high level, symbolically
- Petri games: synthesis of distributed systems with causal memory
- Petri nets are dioids: a new algebraic foundation for non-deterministic net theory
- A multiset semantics for the pi-calculus with replication
- Computing a parametric reveals relation for bounded equal-conflict Petri nets
- Implementable strategies for a two-player asynchronous game on Petri nets
- Branching processes of general Petri nets
This page was built for publication: Branching processes of Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1175711)
