scientific article
From MaRDI portal
Publication:3670575
zbMath0521.68057MaRDI QIDQ3670575
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (51)
Petri nets with individual tokens ⋮ Mutex needs fairness ⋮ Concurrent histories: a basis for observing distributed systems ⋮ Rewriting with a nondeterministic choice operator ⋮ Transformations of sequential specifications into concurrent specifications by synchronization guards ⋮ Completeness results for linear logic on Petri nets ⋮ Inevitability in concurrent systems ⋮ Sequential and concurrent behaviour in Petri net theory ⋮ Concurrent systems and inevitability ⋮ A theory of implementation and refinement in timed Petri nets ⋮ Handles and reachability analysis of free choice nets ⋮ On commoner's liveness theorem and supervisory policies that enforce liveness in free-choice Petri nets ⋮ Restrictions and representations of vector controlled concurrent system behaviours ⋮ On reachability equivalence for BPP-nets ⋮ Timed Petri nets in modeling and analysis of simple schedules for manufacturing cells ⋮ Correctness of concurrent processes ⋮ Concurrent regular expressions and their relationship to Petri nets ⋮ On structural conditions for weak persistency and semilinearity of Petri nets ⋮ Undecidability of bisimilarity for Petri nets and some related problems ⋮ Complexity results for 1-safe nets ⋮ Proving nonreachability by modulo-invariants ⋮ A multiset semantics for the pi-calculus with replication ⋮ Trapping mutual exclusion in the box calculus ⋮ Process versus unfolding semantics for Place/Transition Petri nets ⋮ On the border of causality: contact and confusion ⋮ Structure theory of equal conflict systems ⋮ On the implementation of concurrent calculi in net calculi: two case studies ⋮ Characterisation of the state spaces of marked graph Petri nets ⋮ Planning temporal events using point-interval logic ⋮ Structure of concurrency ⋮ Universal axioms for bisimulations ⋮ A calculus of mobile processes. I ⋮ Graph rewriting for a partial ordering semantics of concurrent constraints programming ⋮ An algebraic semantics for structured transition systems and its application to logic programs ⋮ Some observations on supervisory policies that enforce liveness in partially controlled free-choice Petri nets ⋮ Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters ⋮ A Case for Using Signal Transition Graphs for Analysing and Refining Genetic Networks ⋮ Reachability trees for high-level Petri nets ⋮ Algebraic nets with flexible arcs ⋮ Bounded choice-free Petri net synthesis: algorithmic issues ⋮ PN Standardisation: A Survey ⋮ A true concurrency model of CCS semantics ⋮ Representation of computations in concurrent automata by dependence orders ⋮ Operational and denotational semantics for the box algebra ⋮ Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP ⋮ Relational transducers for electronic commerce ⋮ A theory of bipolar synchronization scheme ⋮ An abstract machine for concurrent modular systems: CHARM ⋮ Partial order semantics and read arcs ⋮ Specification of real-time and hybrid systems in rewriting logic ⋮ A formal semantics for concurrent systems with a priority relation
This page was built for publication:
