Parallel program schemata
From MaRDI portal
Publication:2540014
Recommendations
Cites work
- scientific article; zbMATH DE number 3140027 (Why is no real title available?)
- scientific article; zbMATH DE number 3566132 (Why is no real title available?)
- scientific article; zbMATH DE number 3576679 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- A variant of a recursively unsolvable problem
- On Ianov's Program Schemata
- Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
- The Organization of Computations for Uniform Recurrence Equations
Cited in
(only showing first 100 items - show all)- Three measures for synchronic dependence in Petri nets
- Theory of reaction automata: a survey
- The complexity of decision procedures in relevance logic II
- The allocation problem in hardware design
- Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States
- A note on the emptiness problem for alternating finite-memory automata
- Testing for unboundedness of fifo channels
- Synthesis of (choice-free) reset nets
- Synchronizing sequences on a class of unbounded systems using synchronized Petri nets
- A multiparameter analysis of the boundedness problem for vector addition systems
- Functional behavior in data spaces
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
- On the Efficient Computation of the Minimal Coverability Set for Petri Nets
- Completeness results for conflict-free vector replacement systems
- scientific article; zbMATH DE number 46072 (Why is no real title available?)
- Concurrent program schemes and their logics
- On the programs-as-formulas interpretation of parallel programs in Peano arithmetic
- Reducibilities Among Decision Problems for HNN Groups, Vector Addition Systems and Subsystems of Peano Arithmetic
- Well-abstracted transition systems: Application to FIFO automata.
- The reachability problem for branching vector addition systems requires doubly-exponential space
- Intercalation lemmas for tree transducer languages
- On the decision problem for MELL
- History-deterministic vector addition systems
- Local time membrane systems and time Petri nets
- Undecidability of bisimilarity for Petri nets and some related problems
- Verification of membrane systems with delays via Petri nets with delays
- Modeling, reachability and controllability of bounded Petri nets based on semi-tensor product of matrices
- On the separability problem of VASS reachability languages
- Deterministic function computation with chemical reaction networks
- Brief announcement: Optimally encoding information in chemical reaction networks
- Undecidable verification problems for programs with unreliable channels
- Maximal serializability of iterated transactions
- On the line planning problems of the hub public-transportation networks
- Qualitative analysis of VASS-induced MDPs
- Ideal abstractions for well-structured transition systems
- Discrete parameters in Petri nets
- Complexity of data dependence problems for program schemas with concurrency
- On the complexity of resource-bounded logics
- Blocking a transition in a free choice net and what it tells about its throughput.
- Infinite behaviour of Petri nets
- Verifying polymer reaction networks using bisimulation
- Long-Run Average Behavior of Vector Addition Systems with States
- Flat Petri nets (invited talk)
- Concurrent games and semi-random determinacy
- Complexity of some problems in Petri nets
- Forward analysis and model checking for trace bounded WSTS
- scientific article; zbMATH DE number 7204383 (Why is no real title available?)
- Alternating two-way AC-tree automata
- Extensional Petri net
- Chip-firing games on directed graphs
- The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
- Mathematical programming approach to the Petri nets reachability problem
- Extended dynamic state and instances spawning model in IPCL
- On two-way weak counter machines
- Computing threshold circuits with void reactions in step chemical reaction networks
- Equilibrium and termination. II: The case of Petri nets
- Reduced state space representation for unbounded vector state spaces
- An operator net model for distributed systems
- Serialization of concurrent programs
- The formal specification of a problem solved by a parallel program - a relational model
- Coverability trees for Petri nets with unordered data
- Forward analysis and model checking for trace bounded WSTS
- Step coverability algorithms for communicating systems
- Boundedness, empty channel detection, and synchronization for communicating finite automata
- On the relations between disjunctive and linear logic programming
- Homomorphisms between models of parallel computation
- Computation with finite stochastic chemical reaction networks
- Forward analysis for WSTS, part I: completions
- Encoding of parallel program schemata by vector addition systems
- Bounded self-stabilizing Petri nets
- Introduction to Petri nets
- Linear logic automata
- Reachability trees for high-level Petri nets
- Affine extensions of integer vector addition systems with states
- Computing threshold circuits with bimolecular void reactions in step chemical reaction networks
- Towards massively parallel computations in algebraic geometry
- Analyzing Reachability for Some Petri Nets With Fast Growing Markings
- On formulating simultaneity for studying parallelism and synchronization
- Composable computation in discrete chemical reaction networks
- Reasoning about reversal-bounded counter machines
- (A-)synchronous (non)-deterministic cell spaces simulating each other
- On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems
- On program schemata equivalence
- Concurrent abstract state machines
- Complexity of certain decision problems about congruential languages
- The polynomial complexity of vector addition systems with states
- Boolean models and planning methods for parallel abstract programs
- Recursivite et cônes rationnels fermés par intersection
- Parallel functions in recursive program schemes
- Minimal coverability set for Petri nets: Karp and Miller algorithm with pruning
- Determinacy and maximal parallelism in a structured model of parallel computation
- Weak Time Petri Nets Strike Back!
- scientific article; zbMATH DE number 465526 (Why is no real title available?)
- Checking system boundedness using ordinary differential equations
- Proving safety properties of infinite state systems by compilation into Presburger arithmetic
- Petri nets, Horn programs, linear logic and vector games
- Probability 1 computation with chemical reaction networks
- Robustness of expressivity in chemical reaction networks
- On the Dynamics of PB Systems with Volatile Membranes
- Well-structured transition systems everywhere!
This page was built for publication: Parallel program schemata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2540014)
