Publication:3219122
From MaRDI portal
zbMath0555.68033MaRDI QIDQ3219122
Publication date: 1985
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Composition/décomposition de réseaux de Pétri et de leurs graphes de couverture, On the Analysis of Petri Nets and their Synthesis from Process Languages, SOFTWARE ENGINEERING DESIGN METHODOLOGIES AND GENERAL SYSTEMS THEORY, Fast asynchronous systems in dense time, Well-structured transition systems everywhere!, Deciding bisimulation-like equivalences with finite-state processes, Inheritance of behavior, Inheritance of workflows: An approach to tackling problems related to change, Chip-firing games on directed graphs, An algebra of concurrent non-deterministic processes, The complexity of problems involving structurally bounded and conservative Petri nets, On condition/event systems with discrete state realizations, Place/transition nets with debit arcs, The chemical abstract machine, \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems, Traps characterize home states in free choice systems, An algebraic characterisation of elementary net system (observable) state space, Compositional generation of home states in free choice nets, Normal and sinkless Petri nets, A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems, A process algebra with distributed priorities, Decidability problems in grammar systems, Analysis of a class of communicating finite state machines, Using timed Petri net to model instruction-level loop scheduling with resource constraints, Analysis of a hybrid system using symbolic dynamics and Petri nets, Refinement of events in the development of real-time distributed systems, Some decision problems for parallel communicating grammar systems, Automatizing parametric reasoning on distributed concurrent systems, Deciding a class of path formulas for conflict-free Petri nets, Petri nets, traces, and local model checking, A symbolic reachability graph for coloured Petri nets, Developing virtual environments for industrial training, General parameterised refinement and recursion for the M-net calculus, The complexity of bisimilarity-checking for one-counter processes., The word problem for \(1\mathcal{LC}\) congruences is NP-hard., A causal semantic for time Petri nets, Efficiency of asynchronous systems, read arcs, and the MUTEX-problem, Comparing logics for rewriting: Rewriting logic, action calculi and tile logic, On stubborn sets in the verification of linear time temporal properties, A modeling strategy for hybrid systems based on event structures, Using partial orders for the efficient verification of deadlock freedom and safety properties, Alternation and bounded concurrency are reverse equivalent., Functorial models for Petri nets, Contextual Petri nets, asymmetric event structures, and processes, Simulation preorder over simple process algebras, The box algebra = Petri nets + process expressions, Domain and event structure semantics for Petri nets with read and inhibitor arcs, Modelling biochemical pathways through enhanced \(\pi\)-calculus, Clustering for Petri nets, A Petri nets semantics for data flow networks, Feedback control of Petri nets based on place invariants, Petri net languages and infinite subsets of \(\mathbb{N}^m\), Petri net based scheduling, Unnamed Item
