scientific article
From MaRDI portal
Publication:3219122
zbMath0555.68033MaRDI QIDQ3219122
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (only showing first 100 items - show all)
Using timed Petri net to model instruction-level loop scheduling with resource constraints ⋮ Traces, dependency graphs and DNLC grammars ⋮ Domain and event structure semantics for Petri nets with read and inhibitor arcs ⋮ CTS systems and Petri nets ⋮ Analysis of a hybrid system using symbolic dynamics and Petri nets ⋮ Modelling biochemical pathways through enhanced \(\pi\)-calculus ⋮ Clustering for Petri nets ⋮ New characterization for live and reversible augmented marked graphs ⋮ Refinement of events in the development of real-time distributed systems ⋮ Some decision problems for parallel communicating grammar systems ⋮ Configuration structures, event structures and Petri nets ⋮ Automatizing parametric reasoning on distributed concurrent systems ⋮ A Petri nets semantics for data flow networks ⋮ Theory of traces ⋮ Deciding a class of path formulas for conflict-free Petri nets ⋮ A distributed operational semantics of CCS based on condition/event systems ⋮ Feedback control of Petri nets based on place invariants ⋮ On the verification of membrane systems with dynamic structure ⋮ Computing the reveals relation in occurrence nets ⋮ Further results on generalised communicating P systems ⋮ Petri nets, traces, and local model checking ⋮ A symbolic reachability graph for coloured Petri nets ⋮ Symmetries, local names and dynamic (de)-allocation of names ⋮ Developing virtual environments for industrial training ⋮ Linear time analysis of properties of conflict-free and general Petri nets ⋮ The reachability problem for branching vector addition systems requires doubly-exponential space ⋮ On sets of numbers accepted by P/T systems composed by join ⋮ General parameterised refinement and recursion for the M-net calculus ⋮ Theory of interaction ⋮ The complexity of bisimilarity-checking for one-counter processes. ⋮ Multi-modal scenarios revisited: a net-based representation ⋮ The sweep-line state space exploration method ⋮ Reachability problems in BioAmbients ⋮ Encoding the dynamics of deterministic systems ⋮ The complexity of regular DNLC graph languages ⋮ Partial (set) 2-structures. I: Basic notions and the representation problems ⋮ Partial (set) 2-structures. II: State spaces of concurrent systems ⋮ \textsf{CaPiTo}: Protocol stacks for services ⋮ Petri nets are dioids: a new algebraic foundation for non-deterministic net theory ⋮ Checking system boundedness using ordinary differential equations ⋮ Petri nets are monoids ⋮ The word problem for \(1\mathcal{LC}\) congruences is NP-hard. ⋮ Statechartable Petri nets ⋮ Petri net languages and infinite subsets of \(\mathbb{N}^m\) ⋮ An algebra of concurrent non-deterministic processes ⋮ A framework for the verification of infinite-state graph transformation systems ⋮ 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 ⋮ Generalized communicating P systems ⋮ Petri games: synthesis of distributed systems with causal memory ⋮ Process mining with token carried data ⋮ Chip-firing games on directed graphs ⋮ Partially commutative inverse monoids. ⋮ An algebraic characterisation of elementary net system (observable) state space ⋮ Module-based architecture for a periodic job-shop scheduling problem ⋮ Compositional generation of home states in free choice nets ⋮ Strand algebras for DNA computing ⋮ Normal and sinkless Petri nets ⋮ Dynamic consistency in process algebra: from paradigm to ACP ⋮ On stubborn sets in the verification of linear time temporal properties ⋮ A formal semantics for the Taverna 2 workflow model ⋮ A logic for the stepwise development of reactive systems ⋮ Reduction techniques for network validation in systems biology ⋮ A structural approach to graph transformation based on symmetric Petri nets ⋮ Computational expressiveness of genetic systems ⋮ A Rice-style theorem for parallel automata ⋮ A modeling strategy for hybrid systems based on event structures ⋮ Using partial orders for the efficient verification of deadlock freedom and safety properties ⋮ Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS ⋮ Abstract processes and conflicts in place/transition systems ⋮ Finite processes in cause-effect structures and their composition ⋮ A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems ⋮ Formal specification and verification of decentralized self-adaptive systems using symmetric nets ⋮ Modeling the process of human body iron homeostasis using a variant of timed Petri nets ⋮ A process algebra with distributed priorities ⋮ An algebraic characterization of independence of Petri net processes ⋮ On categories of fuzzy Petri nets ⋮ Connectivity of workflow nets: The foundations of stepwise verification ⋮ Using transition set sequences to partition behaviors of Petri nets ⋮ Decidability problems in grammar systems ⋮ A causal semantic for time Petri nets ⋮ Cycle inclusion property of augmented marked graphs ⋮ Structural soundness of workflow nets is decidable ⋮ Conceptual building blocks for modeling reconfiguration of component-based systems using Petri nets ⋮ 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 ⋮ Robotic dance modeling methods ⋮ Global and local views of state fairness ⋮ Chip-firing games on graphs ⋮ Efficiency of asynchronous systems, read arcs, and the MUTEX-problem ⋮ Comparing logics for rewriting: Rewriting logic, action calculi and tile logic ⋮ Analysis of a class of communicating finite state machines ⋮ Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves
This page was built for publication:
