On the public citation graph
Concurrent bisimulations in Petri nets
0 signed · 132 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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-13883-8_66openalex-snapshot
Degrees of non-determinism and concurrency: A Petri net view
inferredcites →https://doi.org/10.1007/3-540-15204-0_11openalex-snapshot
Csp-programs as nets with individual tokens
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-17906-2_33openalex-snapshot
COSY: Its relation to nets and to CSP
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-50580-6_25openalex-snapshot
An exercise in concurrency: A CSP process as a condition/event system
inferredcites →https://doi.org/10.1007/3-540-51486-4_71openalex-snapshot
Equivalence notions for concurrent systems and refinement of actions
inferredcites →https://doi.org/10.1007/3-540-52282-4_51openalex-snapshot
Failures semantics based on interval semiwords is a congruence for refinement
inferredcites →https://doi.org/10.1007/3-540-52559-9_68openalex-snapshot
Refinement of actions in causality based models
inferredcites →https://doi.org/10.1007/3-540-53863-1_19openalex-snapshot
A survey of behaviour and equivalence preserving refinements of petri nets
inferredcites →https://doi.org/10.1007/3-540-53863-1_33openalex-snapshot
A state transformation preorder over a class of EN systems
inferredcites →https://doi.org/10.1007/3-540-55610-9_180openalex-snapshot
A survey of equivalence notions for net based systems
inferredcites →https://doi.org/10.1007/978-3-642-69028-0_17openalex-snapshot
Subset Languages of Petri Nets
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/bf00264564openalex-snapshot
Formal semantics of a class of high-level primitives for coordinating concurrent processes
inferredcites →https://doi.org/10.1007/bf01798961openalex-snapshot
Failures semantics based on interval semiwords is a congruence for refinement
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/bfb0016222openalex-snapshot
Some equivalence notions for concurrent systems. An overview
inferredcites →https://doi.org/10.1007/bfb0017157openalex-snapshot
On representing CCS programs by finite petri nets
inferredcites →https://doi.org/10.1007/bfb0029614openalex-snapshot
Event structures, causal trees, and refinements
inferredcites →https://doi.org/10.1016/0304-3975(87)90090-9openalex-snapshot
Sequential and concurrent behaviour in Petri net theory
inferredcites →https://doi.org/10.1016/0304-3975(92)90298-topenalex-snapshot
Maximality preserving bisimulation
inferredcites →https://doi.org/10.1016/0304-3975(93)90157-oopenalex-snapshot
Bisimulation and action refinement
inferredcites →https://doi.org/10.1109/lics.1989.39168openalex-snapshot
Towards action-refinement in process algebras
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1996.0048openalex-snapshot
The Limit of Splitn-Language Equivalence
inferred← citeshttps://doi.org/10.1007/11539452_26openalex-snapshot
The Individual and Collective Token Interpretations of Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-45140-4_29openalex-snapshot
On Structured Workflow Modelling
inferred← citeshttps://doi.org/10.1007/3-540-45711-9_11openalex-snapshot
Bisimulation Equivalences for Graph Grammars
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_32openalex-snapshot
On Plain and Hereditary History-Preserving Bisimulation
inferred← citeshttps://doi.org/10.1007/3-540-48745-x_18openalex-snapshot
Concurrent Implementation of Asynchronous Transition Systems
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-55599-4_128openalex-snapshot
Back and forth bisimulations on prime event structures
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_169openalex-snapshot
Interleaving semantics and action refinement with atomic choice
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_170openalex-snapshot
Maximality preservation and the ST-idea for action refinements
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_176openalex-snapshot
Partial words versus processes: A short comparison
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_180openalex-snapshot
A survey of equivalence notions for net based systems
inferred← citeshttps://doi.org/10.1007/3-540-55676-1_2openalex-snapshot
Combining Petri Nets and other formal methods
inferred← citeshttps://doi.org/10.1007/3-540-56863-8_50openalex-snapshot
Construction of S-invariants and S-components for refined Petri boxes
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_99openalex-snapshot
Deciding true concurrency equivalences on finite safe nets (preliminary report)
inferred← citeshttps://doi.org/10.1007/3-540-61363-3_7openalex-snapshot
Non sequential semantics for contextual P/T nets
inferred← citeshttps://doi.org/10.1007/3-540-63045-7_38openalex-snapshot
Back-forth equivalences for design of concurrent systems
inferred← citeshttps://doi.org/10.1007/3-540-63139-9_33openalex-snapshot
Improved implementations via a new structural equivalence on labeled nets
inferred← citeshttps://doi.org/10.1007/978-0-387-34878-0_24openalex-snapshot
Relating Maximality-based Semantics to Action Refinement in Process Algebras
inferred← citeshttps://doi.org/10.1007/978-1-4471-3229-5_16openalex-snapshot
Syntactic Action Refinement in Presence of Multiway Synchronization
inferred← citeshttps://doi.org/10.1007/978-1-4757-9805-0_34openalex-snapshot
Analysis of General Refined Petri Boxes
inferred← citeshttps://doi.org/10.1007/978-3-030-31175-9_2openalex-snapshot
Axiomatizing Team Equivalence for Finite-State Machines
inferred← citeshttps://doi.org/10.1007/978-3-030-51831-8_7openalex-snapshot
Interleaving vs True Concurrency: Some Instructive Security Examples
inferred← citeshttps://doi.org/10.1007/978-3-030-51831-8_8openalex-snapshot
A Study on Team Bisimulations for BPP Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-78089-0_5openalex-snapshot
Branching Place Bisimilarity: A Decidable Behavioral Equivalence for Finite Petri Nets with Silent Moves
inferred← citeshttps://doi.org/10.1007/978-3-031-26651-5_4openalex-snapshot
Extended Future in Testing Semantics for Time Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-07734-5_12openalex-snapshot
The 4C Spectrum of Fundamental Behavioral Relations for Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-23506-6_9openalex-snapshot
Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP
inferred← citeshttps://doi.org/10.1007/978-3-319-53733-7_3openalex-snapshot
A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-319-77313-1_20openalex-snapshot
Pomsets and Unfolding of Reset Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-89366-2_9openalex-snapshot
Automata for True Concurrency Properties
inferred← citeshttps://doi.org/10.1007/978-3-319-96154-5_18openalex-snapshot
Toward Distributed Computability Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-44616-3_17openalex-snapshot
History Preserving Bisimulation for Contextual Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-73196-2_10openalex-snapshot
New Bisimulation Semantics for Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-15618-2_20openalex-snapshot
Structuring Acyclic Process Models
inferred← citeshttps://doi.org/10.1007/978-3-642-17358-5_15openalex-snapshot
Aggregate Quality of Service Computation for Composite Services
inferred← citeshttps://doi.org/10.1007/978-3-642-32885-5_26openalex-snapshot
Isotactics as a Foundation for Alignment and Abstraction of Behavioral Models
inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_9openalex-snapshot
Avoiding Shared Clocks in Networks of Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-36926-1_19openalex-snapshot
On Structured Workflow Modelling
inferred← citeshttps://doi.org/10.1007/978-3-642-38230-7_5openalex-snapshot
Event Structures as a Foundation for Process Model Differencing, Part 1: Acyclic processes
inferred← citeshttps://doi.org/10.1007/978-3-642-79361-5_2openalex-snapshot
Concurrent Processes and Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-662-54458-7_24openalex-snapshot
Local Model Checking in a Logic for True Concurrency
inferred← citeshttps://doi.org/10.1007/bf01178382openalex-snapshot
S-invariant analysis of general recursive Petri boxex
inferred← citeshttps://doi.org/10.1007/bfb0023477openalex-snapshot
Minimal transition systems for history-preserving bisimulation
inferred← citeshttps://doi.org/10.1007/bfb0052091openalex-snapshot
Observing partial order runs of Petri Nets
inferred← citeshttps://doi.org/10.1007/bfb0055062openalex-snapshot
Axioms for contextual net processes
inferred← citeshttps://doi.org/10.1007/s00165-015-0341-3openalex-snapshot
A reduced maximality labeled transition system generation for recursive Petri nets
inferred← citeshttps://doi.org/10.1007/s00236-004-0141-3openalex-snapshot
A new natural structural congruence in the pi-calculus with replication
inferred← citeshttps://doi.org/10.1007/s00236-020-00377-4openalex-snapshot
Team bisimilarity, and its associated modal logic, for BPP nets
inferred← citeshttps://doi.org/10.1007/s002360000041openalex-snapshot
Refinement of actions and equivalence notions for concurrent systems
inferred← citeshttps://doi.org/10.1007/s002360050018openalex-snapshot
S-invariant analysis of general recursive Petri boxes
inferred← citeshttps://doi.org/10.1016/0164-1212(93)90019-topenalex-snapshot
An efficient implementation model for the FP2 parallel language
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90298-topenalex-snapshot
Maximality preserving bisimulation
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90157-oopenalex-snapshot
Bisimulation and action refinement
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00132-8openalex-snapshot
Deciding true concurrency equivalences on safe, finite nets
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50033-3openalex-snapshot
Process Algebras with Localities
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.11.026openalex-snapshot
On the Expressiveness of Higher Dimensional Automata
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.04.016openalex-snapshot
Adhesive DPO Parallelism for Monic Matches
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.012openalex-snapshot
History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps
inferred← citeshttps://doi.org/10.1016/j.ic.2009.10.007openalex-snapshot
Symmetries, local names and dynamic (de)-allocation of names
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104603openalex-snapshot
Team equivalences for finite-state machines with silent moves
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104674openalex-snapshot
Pomset bisimulation and unfolding for reset Petri nets
inferred← citeshttps://doi.org/10.1016/j.is.2012.07.004openalex-snapshot
Simplifying discovered process models in a controlled manner
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.10.004openalex-snapshot
Reduction of event structures under history preserving bisimulation
inferred← citeshttps://doi.org/10.1016/j.jlamp.2017.11.005openalex-snapshot
Verification of finite-state machines: A distributed approach
inferred← citeshttps://doi.org/10.1016/j.jss.2012.03.005openalex-snapshot
Generalized aggregate Quality of Service computation for composite services
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.02.012openalex-snapshot
On the expressiveness of higher dimensional automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.06.024openalex-snapshot
Erratum to “On the expressiveness of higher dimensional automata”
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.06.014openalex-snapshot
Configuration structures, event structures and Petri nets
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.01.005openalex-snapshot
Interleaving isotactics – An equivalence notion on behaviour abstractions
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.037openalex-snapshot
A study on team bisimulation and H-team bisimulation for BPP nets
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.02.018openalex-snapshot
Behavioural logics for configuration structures
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00303-5openalex-snapshot
Towards a unified view of bisimulation: a comparative study
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80260-9openalex-snapshot
Place Bisimulation Equivalences for Design of Concurrent and Sequential Systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80297-xopenalex-snapshot
Decidability of Plain and Hereditary History-Preserving Bisimilarity for BPP
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80696-6openalex-snapshot
An Introduction to History Dependent Automata
inferred← citeshttps://doi.org/10.1017/s0960129500000116openalex-snapshot
Step bisimulation is pomset equivalence on a parallel language without explicit internal choice
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.1051/ita/1992260100191openalex-snapshot
Normalization of place/transition-systems preserves net behaviour
inferred← citeshttps://doi.org/10.1093/comjnl/bxs126openalex-snapshot
Maximal Structuring of Acyclic Process Models
inferred← citeshttps://doi.org/10.1109/aiccsa.2001.934020openalex-snapshot
Object based software engineering with hidden sorted ECATNets and hidden labeled rewriting logic
inferred← citeshttps://doi.org/10.1109/aiccsa.2007.370867openalex-snapshot
A Formal Approach for Functional and Structural Test Case Generation in Multi-Agent Systems
inferred← citeshttps://doi.org/10.1109/cmpsac.1998.716652openalex-snapshot
Transformations on hierarchical predicate transition nets: refinements and abstractions
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/pnpm.1991.238797openalex-snapshot
Overview of the results of the Esprit basic research action DEMON-design methods based on nets
inferred← citeshttps://doi.org/10.1142/s0218843012400035openalex-snapshot
BUSINESS PROCESS MODEL ABSTRACTION BASED ON SYNTHESIS FROM WELL-STRUCTURED BEHAVIORAL PROFILES
inferred← citeshttps://doi.org/10.1145/3412853openalex-snapshot
Model Checking a Logic for True Concurrency
inferred← citeshttps://doi.org/10.14236/ewic/vecos2008.1openalex-snapshot
Aggregation of Transitions in Marking Graph Generation Based on Maximality Semantics for Petri Nets
inferred← citeshttps://doi.org/10.2168/lmcs-9(4:13)2013openalex-snapshot
Avoiding Shared Clocks in Networks of Timed Automata
inferred← citeshttps://doi.org/10.3233/fi-2016-1454openalex-snapshot
True Concurrent Equivalences in Time Petri Nets
inferred← citeshttps://doi.org/10.3233/fi-2021-2039openalex-snapshot
Causal Semantics for BPP Nets with Silent Moves
inferred← citeshttps://doi.org/10.3233/fun-2000-44301openalex-snapshot
Comparing Truly Concurrent Semantics for Contextual Place/Transition Nets
inferred← citeshttps://doi.org/10.3390/s21248433openalex-snapshot
Extended Hierarchical Fuzzy Interpreted Petri Net
inferred← citeshttps://doi.org/10.4018/ijats.2015040104openalex-snapshot
Hierarchical Design Method for Multi-Agent Systems
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:37)2023openalex-snapshot
Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
inferred← citeshttps://doi.org/10.48550/arxiv.1403.7181openalex-snapshot
Reduction of Event Structures under History Preserving Bisimulation
inferred← citeshttps://doi.org/10.48550/arxiv.2104.01392openalex-snapshot
Place Bisimilarity is Decidable, Indeed!
inferred← citeshttps://doi.org/10.7148/2013-0544openalex-snapshot
Maximality Semantic For Recursive Petri Nets
inferred← citeshttps://doi.org/10.7494/csci.2020.21.4.3728openalex-snapshot
CAUSAL REVERSIBILITY IN INDIVIDUAL TOKEN INTERPRETATION OF PETRI 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.