The non-sequential behaviour of Petri nets
From MaRDI portal
Publication:3343446
DOI10.1016/S0019-9958(83)80040-0zbMath0551.68050OpenAlexW2061288205MaRDI QIDQ3343446
Wolfgang Reisig, Goltz, Ursula
Publication date: 1983
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(83)80040-0
Related Items
Compositional process semantics of Petri Boxes, Mutex needs fairness, Concurrent histories: a basis for observing distributed systems, Minimal transition systems for history-preserving bisimulation, 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, Automatizing parametric reasoning on distributed concurrent systems, Axiomatizing Petri net concatenable processes, A Petri nets semantics for data flow networks, Unnamed Item, An extension of the notions of traces and of asynchronous automata, Partial ordering models for concurrency can be defined operationally, A Petri net model for membrane systems with dynamic structure, Sequential and concurrent behaviour in Petri net theory, Process semantics of general inhibitor nets, Concurrent systems and inevitability, Concurrency and atomicity, A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA)., Unfolding semantics of graph transformation, On Interval Process Semantics of Petri Nets with Inhibitor Arcs, Timed processes of Timed Petri Nets, On the category of Petri net computations, A Study on Team Bisimulations for BPP Nets, Unfolding Graph Transformation Systems: Theory and Applications to Verification, Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets, On Interval Semantics of Inhibitor and Activator Nets, Modelling evolution of communication platforms and scenarios based on transformations of high-level nets and processes, Concurrent graph and term graph rewriting, Abstract processes of place/transition systems, Untanglings: a novel approach to analyzing concurrent systems, Partial order behaviour and structure of Petri nets, A partial ordering semantics for CCS, Petri nets are dioids: a new algebraic foundation for non-deterministic net theory, Petri nets are monoids, Unnamed Item, Branching processes of Petri nets, Subobject transformation systems, Non sequential semantics for contextual P/T nets, Arc-typed Petri Nets, Executions: A new partial-order semantics of Petri nets, An axiomatization of the algebra of Petri net concatenable processes, A multiset semantics for the pi-calculus with replication, Process versus unfolding semantics for Place/Transition Petri nets, On the implementation of concurrent calculi in net calculi: two case studies, Spreading nets: a uniform approach to unfoldings, Interval semantics for Petri nets with inhibitor arcs, Processes of membrane systems with promoters and inhibitors, The 4C Spectrum of Fundamental Behavioral Relations for Concurrent Systems, Concurrency for Graph Grammars in a Petri net shell, On the expressiveness of higher dimensional automata, Algebraic nets with flexible arcs, Models and languages for description of parallel processes, Bayesian network semantics for Petri nets, A trace semantics for Petri Nets, Combining free choice and time in Petri nets, M-nets: a survey, Executability of scenarios in Petri nets, A Formal Model for Organisational Structures behind Process-Aware Information Systems, 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, Unifying Petri Net Semantics with Token Flows, Failures semantics based on interval semiwords is a congruence for refinement, On the Analysis of Petri Nets and their Synthesis from Process Languages, Petri Nets Are Dioids, Zero-safe nets: Comparing the collective and individual token approaches., Functorial models for Petri nets, Abstract processes in the absence of conflicts in general place/transition systems, Pomset bisimulation and unfolding for reset Petri nets
