scientific article; zbMATH DE number 3825182
From MaRDI portal
Publication:3670575
Cited in
(51)- A formal semantics for concurrent systems with a priority relation
- Petri nets with individual tokens
- Concurrent histories: a basis for observing distributed systems
- Rewriting with a nondeterministic choice operator
- 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
- Correctness of concurrent processes
- Concurrent regular expressions and their relationship to Petri nets
- On structural conditions for weak persistency and semilinearity of Petri nets
- A calculus of mobile processes. I
- An algebraic semantics for structured transition systems and its application to logic programs
- Representation of computations in concurrent automata by dependence orders
- Operational and denotational semantics for the box algebra
- An abstract machine for concurrent modular systems: CHARM
- Completeness results for linear logic on Petri 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
- Relational transducers for electronic commerce
- Partial order semantics and read arcs
- Specification of real-time and hybrid systems in rewriting logic
- Bounded choice-free Petri net synthesis: algorithmic issues
- A true concurrency model of CCS semantics
- Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
- Timed Petri nets in modeling and analysis of simple schedules for manufacturing cells
- Planning temporal events using point-interval logic
- Some observations on supervisory policies that enforce liveness in partially controlled free-choice Petri nets
- Transformations of sequential specifications into concurrent specifications by synchronization guards
- Mutex needs fairness
- PN Standardisation: A Survey
- Handles and reachability analysis of free choice nets
- Characterisation of the state spaces of marked graph 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
- 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
- Structure of concurrency
- Universal axioms for bisimulations
- Graph rewriting for a partial ordering semantics of concurrent constraints programming
- A theory of bipolar synchronization scheme
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3670575)
