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)
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 ⋮ Discrete, Continuous, and Hybrid 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 ⋮ Rabin's theorem in the concurrency setting: a conjecture ⋮ Unnamed Item ⋮ 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 ⋮ 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
This page was built for publication:
