On the public citation graph
On representing CCS programs by finite petri nets
0 signed · 98 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-08921-7_55openalex-snapshot
An algebra for parallelism based on petri nets
inferredcites →https://doi.org/10.1007/3-540-12920-0_13openalex-snapshot
A new definition of morphism on Petri nets
inferredcites →https://doi.org/10.1007/3-540-13345-3_18openalex-snapshot
On the relationship of CCS and petri nets
inferredcites →https://doi.org/10.1007/3-540-15670-4_10openalex-snapshot
Lectures on a calculus for communicating systems
inferredcites →https://doi.org/10.1007/3-540-17660-8_52openalex-snapshot
On the semantics of concurrency: Partial orders and transition systems
inferredcites →https://doi.org/10.1007/3-540-17945-3_13openalex-snapshot
Petri net models for algebraic theories of concurrency
inferredcites →https://doi.org/10.1007/3-540-18086-9_27openalex-snapshot
Operational Petri net semantics for CCSP
inferredcites →https://doi.org/10.1007/978-3-642-69028-0_4openalex-snapshot
Milner’s Communicating Systems and Petri Nets
inferredcites →https://doi.org/10.1007/bf02915446openalex-snapshot
A distributed operational semantics for CCS based on condition/event systems
inferredcites →https://doi.org/10.1007/bfb0012800openalex-snapshot
Event structure semantics for CCS and related languages
inferredcites →https://doi.org/10.1007/bfb0016205openalex-snapshot
Petri nets and algebraic calculi of processes
inferredcites →https://doi.org/10.1007/bfb0016212openalex-snapshot
Making nets abstract and structured
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1016/s0019-9958(83)80040-0openalex-snapshot
The non-sequential behaviour of Petri nets
inferredcites →https://doi.org/10.1137/0217063openalex-snapshot
Axiomatising Finite Concurrent Processes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/tee.22508openalex-snapshot
On simulating Turing machines with inhibitor Petri nets
inferred← citeshttps://doi.org/10.1006/inco.2002.3117openalex-snapshot
The Box Algebra=Petri Nets+Process Expressions
inferred← citeshttps://doi.org/10.1007/11888116_29openalex-snapshot
Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets
inferred← citeshttps://doi.org/10.1007/11901433_20openalex-snapshot
Mapping RT-LOTOS Specifications into Time Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-48068-4_24openalex-snapshot
Translating TPAL Specifications into Timed-Arc Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-48745-x_21openalex-snapshot
The Box Algebra —; A Model of Nets and Process Expressions
inferred← citeshttps://doi.org/10.1007/3-540-52282-4_51openalex-snapshot
Failures semantics based on interval semiwords is a congruence for refinement
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_4openalex-snapshot
Flow event structures and flow nets
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_5openalex-snapshot
Three equivalent semantics for CCS
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_1openalex-snapshot
Full abstraction for series-parallel pomsets
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_2openalex-snapshot
On causality observed incrementally, finally
inferred← citeshttps://doi.org/10.1007/3-540-54152-7_71openalex-snapshot
Strong bisimilarity on nets revisited
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_55openalex-snapshot
The consistency of a noninterleaving and an interleaving model for full TCSP
inferred← citeshttps://doi.org/10.1007/3-540-55676-1_3openalex-snapshot
Place bisimulations in Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-56689-9_46openalex-snapshot
Distributed implementation of CCS
inferred← citeshttps://doi.org/10.1007/3-540-56863-8_40openalex-snapshot
A subset of Lotos with the computational power of Place/Transition-nets
inferred← citeshttps://doi.org/10.1007/3-540-56891-3_30openalex-snapshot
B(PN) 2 — a basic Petri net programming notation
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_2openalex-snapshot
A multiset semantics for the pi-calculus with replication
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_22openalex-snapshot
Non interleaving process algebra
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_66openalex-snapshot
Complexity results for 1-safe nets
inferred← citeshttps://doi.org/10.1007/3-540-58152-9_14openalex-snapshot
A term representation of P/T systems
inferred← citeshttps://doi.org/10.1007/3-540-59450-7_4openalex-snapshot
Distributed conflicts in communicating systems
inferred← citeshttps://doi.org/10.1007/3-540-60029-9_33openalex-snapshot
An algebraic semantics for hierarchical P/T nets
inferred← citeshttps://doi.org/10.1007/3-540-60029-9_53openalex-snapshot
Functional equivalences of Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_109openalex-snapshot
Solving recursive net equations
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_11openalex-snapshot
A Petri net semantics for π-calculus
inferred← citeshttps://doi.org/10.1007/3-540-65307-4_46openalex-snapshot
Petri nets, process algebras and concurrent programming languages
inferred← citeshttps://doi.org/10.1007/3-540-65307-4_54openalex-snapshot
Modelling and analysis of distributed software using GSPNs
inferred← citeshttps://doi.org/10.1007/3-540-69108-1_10openalex-snapshot
An Axiomatisation of Duplication Equivalence in the Petri Box Calculus
inferred← citeshttps://doi.org/10.1007/978-0-387-35533-7_20openalex-snapshot
Compact Net Semantics for Process Algebras
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_6openalex-snapshot
An M-net Semantics of B(PN)2
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_13openalex-snapshot
Formalizing the Behaviour of Parallel Object-Based Systems by Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-031-40436-8_8openalex-snapshot
Concurrent Hyperproperties
inferred← citeshttps://doi.org/10.1007/978-3-032-13711-1_9openalex-snapshot
Concurrent $$\forall \exists $$-Hyperproperties
inferred← citeshttps://doi.org/10.1007/978-3-319-19488-2_9openalex-snapshot
Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-25527-9_17openalex-snapshot
Language Representability of Finite P/T Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-40965-6_12openalex-snapshot
Hierarchical Structure of 1-Safe Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_19openalex-snapshot
Operational Semantics for the Petri Box Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-79361-5_2openalex-snapshot
Concurrent Processes and Petri Nets
inferred← citeshttps://doi.org/10.1007/bf00265151openalex-snapshot
Step failures semantics and a complete proof system
inferred← citeshttps://doi.org/10.1007/bf00277389openalex-snapshot
Representing CCS programs by finite predicate/transition nets
inferred← citeshttps://doi.org/10.1007/bf01178506openalex-snapshot
Concurrent bisimulations in Petri nets
inferred← citeshttps://doi.org/10.1007/bf01178923openalex-snapshot
The connection between an event structure semantics and an operational semantics forTCSP
inferred← citeshttps://doi.org/10.1007/bf01798961openalex-snapshot
Failures semantics based on interval semiwords is a congruence for refinement
inferred← citeshttps://doi.org/10.1007/bfb0013035openalex-snapshot
Strong bisimilarity on nets: A new concept for comparing net semantics
inferred← citeshttps://doi.org/10.1007/bfb0019446openalex-snapshot
Net-based description of parallel object-based systems, or POTs and POPs
inferred← citeshttps://doi.org/10.1007/s40595-015-0051-zopenalex-snapshot
Language representability of finite place/transition Petri nets
inferred← citeshttps://doi.org/10.1016/0167-6423(93)90010-mopenalex-snapshot
Axiomatizing CCS, nets and processes
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90193-lopenalex-snapshot
Some behavioural aspects of net theory
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00073-ropenalex-snapshot
On the implementation of concurrent calculi in net calculi: two case studies
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00231-7openalex-snapshot
Complexity results for 1-safe nets
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90058-2openalex-snapshot
Finite Petri nets as models for recursive causal behaviour
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00118-2openalex-snapshot
A multiset semantics for the pi-calculus with replication
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50033-3openalex-snapshot
Process Algebras with Localities
inferred← citeshttps://doi.org/10.1016/j.jlap.2008.08.002openalex-snapshot
Distributed semantics for the π -calculus based on Petri nets with inhibitor arcs
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.02.009openalex-snapshot
A translation of TPALp into a class of timed-probabilistic Petri nets
inferred← citeshttps://doi.org/10.1016/s0166-5316(02)00104-9openalex-snapshot
Integrating TwoTowers and GreatSPN through a compact net semantics
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00169-2openalex-snapshot
A uniform approach to true-concurrency and interleaving semantics for Petri nets
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00180-1openalex-snapshot
Operational and denotational semantics for the box algebra
inferred← citeshttps://doi.org/10.1017/s0960129509007683openalex-snapshot
On the expressive power of process interruption and compensation
inferred← citeshttps://doi.org/10.1023/a:1012758417962openalex-snapshot
Compositional Petri Net Approach to the Development of Concurrent and Distributed Systems
inferred← citeshttps://doi.org/10.1093/comjnl/38.7.492openalex-snapshot
A Distributed Semantics for EMPA Based on Stochastic Contextual Nets
inferred← citeshttps://doi.org/10.1109/12.477242openalex-snapshot
Mapping Petri nets with inhibitor arcs onto basic LOTOS behavior expressions
inferred← citeshttps://doi.org/10.1109/aispas.1995.401330openalex-snapshot
Towards Petri net calculi based on synchronization via places
inferred← citeshttps://doi.org/10.1109/csd.1998.657555openalex-snapshot
Recursive nets in the box algebra
inferred← citeshttps://doi.org/10.1109/ftdcs.1992.217516openalex-snapshot
Using Petri nets as a model for Petri nets
inferred← citeshttps://doi.org/10.1109/icnc.2015.7377979openalex-snapshot
Conversion and verification of recursive structure in PI-calculus with compositional petri-NET
inferred← citeshttps://doi.org/10.1109/pnpm.1995.524325openalex-snapshot
Stochastic Petri net semantics for stochastic process algebras
inferred← citeshttps://doi.org/10.3233/fi-1994-201237openalex-snapshot
COMBINING CCS AND PETRI NETS VIA STRUCTURAL AXIOMS
inferred← citeshttps://doi.org/10.3233/fi-1999-37402openalex-snapshot
Representing Hand-Shake Channel Communication in the Calculus of Cause-Effect Structures
inferred← citeshttps://doi.org/10.3233/fi-2011-501openalex-snapshot
An Operational Petri Net Semantics for A 2 CCS
inferred← citeshttps://doi.org/10.4204/eptcs.41.6openalex-snapshot
A Process Calculus for Expressing Finite Place/Transition Petri Nets
inferred← citeshttps://doi.org/10.7146/dpb.v22i455.6773openalex-snapshot
Complexity Results for 1-safe Nets
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.