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
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, A generalized Kahn Principle for abstract asynchronous networks, Remarks on the Reachability Graphs of Petri Nets, On relating concurrency and nondeterminism, On continuous time agents, The asynchronous committee meeting problem, Concurrent graph and term graph rewriting, Linear constraint systems as high-level nets, Reaction Systems, Transition Systems, and Equivalences, Unnamed Item, Unnamed Item, Canonization of reconfigurable PT nets in \texttt{Maude}, Control Flow Analysis of Generalised Boolean Networks, A Petri Net Model of Handshake Protocols, Flow Unfolding of Multi-clock Nets, Reachability Analysis in BioAmbients, Fast asynchronous systems in dense time, Well-structured transition systems everywhere!, Deciding bisimulation-like equivalences with finite-state processes, Inheritance of behavior, On the Qualitative Analysis of Conformon P Systems, Inheritance of workflows: An approach to tackling problems related to change, Psim: A Computational Platform for Metabolic P Systems, Timing Petri Nets categorically, Proved trees, Introduction to Petri Nets, Petri Nets Are Dioids, Model reconstruction for discrete deterministic systems, Model-checking for resource-bounded ATL with production and consumption of resources, A counter abstraction technique for verifying properties of probabilistic swarm systems, On the Termination of Integer Loops, Yeast: A case study for a practical use of formal methods, Constructing systems as object communities, Modeling and targeting an essential metabolic pathway of \textit{Plasmodium falciparum} in apicoplast using Petri nets, Unifying models, Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP, An analysis of the Petri net based model of the human body iron homeostasis process, Modeling for Verification, Symbolic Model Checking in Non-Boolean Domains, Refinement of coloured petri nets, On occurrence net semantics for petri nets with contacts, Incremental construction of coverability graphs, Dynamic Logic with Binders and Its Application to the Development of Reactive Systems, Language Representability of Finite P/T Nets, Encoding Asynchronous Interactions Using Open Petri Nets, Reversible Computation vs. Reversibility in Petri Nets, An upper bound on the cycle time of a stochastic marked graph using incomplete information on the transition firing time distributions, Concurrency bugs in multithreaded software: modeling and analysis using Petri nets, Petri Nets over Ontological Graphs: Conception and Application for Modelling Tasks of Robots, Inevitability in diamond processes, Markovian dynamics of concurrent systems, Debits and Credits in Petri Nets and Linear Logic, An algebraic view of interleaving and distributed operational semantics for CCS, From petri nets to linear logic, Contextual occurrence nets and concurrent constraint programming, A refined view of the box algebra, An algebraic semantics for hierarchical P/T nets, Causal behaviours and nets, On the category of Petri net computations, Automated Repair of Process Models Using Non-local Constraints, Symmetry structure in discrete models of biochemical systems: natural subsystems and the weak control hierarchy in a new model of computation driven by interactions, Compositional Specification in Rewriting Logic, Unfolding Graph Transformation Systems: Theory and Applications to Verification, Transformations in Reconfigurable Place/Transition Systems, Compositional Specification of Web Services Via Behavioural Equivalence of Nets: A Case Study, Process Discovery Using Integer Linear Programming, Reusing artifact-centric business process models: a behavioral consistent specialization approach, Calculi of net structures and sets are similar, An effective scheduling method to single-arm cluster tools for processing multiple wafer types, Unnamed Item, SOFTWARE ENGINEERING DESIGN METHODOLOGIES AND GENERAL SYSTEMS THEORY, Diffusion approximation for signaling stochastic networks, Unnamed Item, Unnamed Item, Open Petri Nets: Non-deterministic Processes and Compositionality, Towards the Verification of Attributed Graph Transformation Systems, Unnamed Item, A Biologically Inspired Model with Fusion and Clonation of Membranes, Temporal logic and categories of Petri nets, Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems, Model Checking Data Flows in Concurrent Network Updates, Composition/décomposition de réseaux de Pétri et de leurs graphes de couverture, Non sequential semantics for contextual P/T nets, A formal definition of hierarchical predicate transition nets, The consistent use of names and polymorphism in the definition of Object Petri Nets, Behavioural equivalence for infinite systems — Partially decidable!, Covering step graph, Turing universality of the Biochemical Ground Form, Data flow analysis of asynchronous systems using infinite abstract domains, Thread algebra for strategic interleaving, Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks, How Much Is Worth to Remember? A Taxonomy Based on Petri Nets Unfoldings, Solving recursive net equations, The category of typed graph grammars and its adjunctions with categories of derivations, An event structure semantics for graph grammars with parallel productions, Synchronized composition of graph grammar productions, The decomposition of ESM computations, A process algebraic view of shared dataspace coordination, Extensions of Elementary Cause-Effect Structures, Rabin's theorem in the concurrency setting: a conjecture, Modeling Petri Nets by Local Action Systems1 1Partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and Esprit Working Group APPLIGRAPH through Universitaire Instelling Antwerpen., Concurrency for Graph Grammars in a Petri net shell, Communicating processes, scheduling, and the complexity of nontermination, Expressiveness of Multiple Heads in CHR, Model Driven Testing Based on Test History, Petri net reactive modules, Concurrency, Synchronization, and Conflicts in Petri Nets, The Calculus of Handshake Configurations, Petri nets formalism facilitates analysis of complex biomolecular structural data, Unnamed Item, A Framework for Linking and Pricing No-Cure-No-Pay Services, Unnamed Item, Extended Stochastic Petri Nets for Model-Based Design of Wetlab Experiments, On the Analysis of Petri Nets and their Synthesis from Process Languages, Egalitarian State-Transition Systems, Petri nets, traces, and local model checking, Target-oriented Petri Net Synthesis, Stop-transitions of Petri Nets*, Petri net based scheduling, CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions, Verification of Random Graph Transformation Systems, Models and emerging trends of concurrent constraint programming, Automated Repair of Process Models with Non-local Constraints Using State-Based Region Theory, Checking conformance for time-constrained scenario-based specifications, Canonical representations for direct generation of strategies in high-level Petri games, Abstraction-based incremental inductive coverability for Petri nets, Deterministic concurrent systems
