scientific article; zbMATH DE number 3557247
From MaRDI portal
Publication:4133144
zbMath0357.68067MaRDI QIDQ4133144
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms in computer science (68W99)
Related Items
Gradually intractable problems and nondeterministic log-space lower bounds ⋮ Concurrent and maximally concurrent evolution of nonsequential systems ⋮ On a fast decomposition method in some models of concurrent computations ⋮ Reduction rules for reset/inhibitor nets ⋮ Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems ⋮ Directed Moore hypergraphs ⋮ Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets ⋮ Unnamed Item ⋮ Fairness and communication-based semantics for session-typed languages ⋮ Algebraic characterization of petri net pomset semantics ⋮ Relevance of network theory to models of distributed/parallel processing ⋮ Combining an LNS-based approach and organizational mining for the resource replacement problem ⋮ Linear time analysis of properties of conflict-free and general Petri nets ⋮ Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks ⋮ A characterization of systems derived from terminating concurrent histories ⋮ Nested-unit Petri nets ⋮ Behaviours of concurrent systems ⋮ A note on colored Petri nets ⋮ Computing with chemical reaction networks: a tutorial ⋮ Multi-modal scenarios revisited: a net-based representation ⋮ A review of attack graph and attack tree visual syntax in cyber security ⋮ Verification of distributed systems with the axiomatic system of MSVL ⋮ Coloured Petri nets and the invariant-method ⋮ Adequacy properties of path programs ⋮ A unified approach for studying the properties of transition systems ⋮ Unnamed Item ⋮ Static analysis and stochastic search for reachability problem ⋮ Theory of reaction automata: a survey ⋮ Concurrency and Time in Role-Based Access Control ⋮ A computational approach to extinction events in chemical reaction networks with discrete state spaces ⋮ Diagnosability analysis of patterns on bounded labeled prioritized Petri nets ⋮ Conflict vs causality in event structures ⋮ A calculus for automatic verification of Petri nets based on resolution and dynamic logics ⋮ Monotone term decision lists ⋮ Structure matrices for Petri nets and their applications ⋮ A stochastic petri net with applications to modelling occupancy times for concurrent task systems ⋮ ${\cal B}$ -Tropos ⋮ A survey of siphons in Petri nets ⋮ Petri nets formalism facilitates analysis of complex biomolecular structural data ⋮ Minimal output unstable configurations in chemical reaction networks and deciders ⋮ A uniform approach to true-concurrency and interleaving semantics for Petri nets ⋮ Unnamed Item ⋮ Robustness of Expressivity in Chemical Reaction Networks ⋮ Homomorphisms between models of parallel computation ⋮ A method for stepwise refinement and abstraction of Petri nets ⋮ Some complexity results for stateful network verification ⋮ Growth of replacements ⋮ Dynamic sequencing of robot moves in a manufactoring cell ⋮ Constructing Petri net models using genetic search ⋮ Optimising the flow of information within a C3I network. ⋮ A brief survey and synthesis of the roles of time in Petri nets. ⋮ Modeling paradigms for discrete event simulation
