Branching processes of Petri nets
From MaRDI portal
Publication:1175711
DOI10.1007/BF01463946zbMath0743.68106OpenAlexW2040633651MaRDI QIDQ1175711
Publication date: 25 June 1992
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01463946
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Compositional process semantics of Petri Boxes, Clustering for Petri nets, Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP, Comparative trace semantics of time Petri nets, Configuration structures, event structures and Petri nets, Branching Processes of Timed Petri Nets, On the expressive power of behavioral profiles, On the well-foundedness of adequate orders used for construction of complete unfolding prefixes, Merged processes: a new condensed representation of Petri net behaviour, What topology tells us about diagnosability in partial order semantics, The synthesis problem for repeatedly communicating Petri games, Efficient semantics-based compliance checking using LTL formulae and unfolding, Verification of bounded Petri nets using integer programming, Non-atomic Transition Firing in Contextual Nets, Solving high-level Petri games, Computing the reveals relation in occurrence nets, A Study on Team Bisimulations for BPP Nets, High-level representation of benchmark families for Petri games, Recent advances in unfolding technique, Parameter space abstraction and unfolding semantics of discrete regulatory networks, Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets, Generalized Alignment-Based Trace Clustering of Process Behavior, Unnamed Item, Abstract processes of place/transition systems, Describing Behavior of Processes with Many-to-Many Interactions, Calculi of net structures and sets are similar, Petri nets are dioids: a new algebraic foundation for non-deterministic net theory, Deadlock detection-oriented unfolding of unbounded Petri nets, ``Truly concurrent and nondeterministic semantics of discrete-time Petri nets, Model Checking Data Flows in Concurrent Network Updates, A framework for the verification of infinite-state graph transformation systems, A multiset semantics for the pi-calculus with replication, An event structure semantics for general Petri nets, Process versus unfolding semantics for Place/Transition Petri nets, Trellis processes: a compact representation for runs of concurrent systems, An Algorithm for Direct Construction of Complete Merged Processes, How Much Is Worth to Remember? A Taxonomy Based on Petri Nets Unfoldings, Branching Processes of General Petri Nets, Spreading nets: a uniform approach to unfoldings, Petri games: synthesis of distributed systems with causal memory, Flow Unfolding of Multi-clock Nets, Adding Branching to the Strand Space Model, Merging Relations: A Way to Compact Petri Nets’ Behaviors Uniformly, On the expressiveness of higher dimensional automata, Distributed monitoring of concurrent and asynchronous systems, Model checking using net unfoldings, McMillan’s Complete Prefix for Contextual Nets, Unnamed Item, A two-player asynchronous game on fully observable Petri nets, A trace semantics for Petri Nets, Combining free choice and time in Petri nets, 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, Oclets – Scenario-Based Modeling with Petri Nets, An algebraic characterization of independence of Petri net processes, Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net, A causal semantic for time Petri nets, Petri Nets Are Dioids, Observable liveness of Petri nets, Non-interference Notions Based on Reveals and Excludes Relations for Petri Nets, Denotational, causal, and operational determinism in event structures
Cites Work
