On the public citation graph

Failures semantics based on interval semiwords is a congruence for refinement

0 signed · 85 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.

Claim with ORCID

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.

See reference health

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-17218-1_51openalex-snapshot

Behaviour preserving refinements of Petri nets

inferredcites →https://doi.org/10.1007/3-540-17906-2openalex-snapshot

Petri Nets: Applications and Relationships to Other Models of Concurrency

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-18419-8_13openalex-snapshot

CCS is an (augmented) contact free C/E 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-51525-9openalex-snapshot

Finite Reresentations of CCS and TCSP Programs by Automata and Petri Nets

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/978-3-642-69968-9openalex-snapshot

Petri Nets

inferredcites →https://doi.org/10.1007/bf00276021openalex-snapshot

Failures semantics and deadlocking of modular Petri nets

inferredcites →https://doi.org/10.1007/bf01379149openalex-snapshot

Modeling concurrency with partial orders

inferredcites →https://doi.org/10.1007/bfb0013034openalex-snapshot

Fully abstract models for a process language with refinement

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/bfb0084798openalex-snapshot

On the semantics of Petri Nets

inferredcites →https://doi.org/10.1016/0022-0000(79)90050-3openalex-snapshot

Analysis of petri nets by stepwise refinements

inferredcites →https://doi.org/10.1016/0022-0000(83)90029-6openalex-snapshot

A method for stepwise refinement and abstraction of Petri nets

inferredcites →https://doi.org/10.1016/0022-2496(70)90062-3openalex-snapshot

Intransitive indifference with unequal indifference intervals

inferredcites →https://doi.org/10.1016/0304-3975(81)90112-2openalex-snapshot

Petri nets, event structures and domains, part I

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(93)90157-oopenalex-snapshot

Bisimulation and action refinement

inferredcites →https://doi.org/10.1016/s0019-9958(83)80040-0openalex-snapshot

The non-sequential behaviour of Petri nets

inferredcites →https://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot

Process algebra for synchronous communication

inferredcites →https://doi.org/10.1109/lics.1989.39168openalex-snapshot

Towards action-refinement in process algebras

inferredcites →https://doi.org/10.1145/828.833openalex-snapshot

A Theory of Communicating Sequential Processes

inferredcites →https://doi.org/10.25596/jalc-2019-003openalex-snapshot

The k-Dimensional Cube is k-Representable

inferredcites →https://doi.org/10.3233/fi-1981-4210openalex-snapshot

On Partial Languages

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.1995.1050openalex-snapshot

Generalized OM-Bisimulation

inferred← citeshttps://doi.org/10.1006/inco.1996.0026openalex-snapshot

Comparing Syntactic and Semantic Action Refinement

inferred← citeshttps://doi.org/10.1006/inco.1997.2634openalex-snapshot

The Difference between Splitting innandn+1

inferred← citeshttps://doi.org/10.1006/inco.1997.2665openalex-snapshot

Axiomatizing Shuffle and Concatenation in Languages

inferred← citeshttps://doi.org/10.1006/inco.2001.2967openalex-snapshot

Vertical Implementation

inferred← citeshttps://doi.org/10.1006/inco.2002.3117openalex-snapshot

The Box Algebra=Petri Nets+Process Expressions

inferred← citeshttps://doi.org/10.1007/3-540-44618-4_22openalex-snapshot

Action Contraction

inferred← citeshttps://doi.org/10.1007/3-540-44880-2_10openalex-snapshot

Using Coupled Simulations in Non-atomic Refinement

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-53863-1_19openalex-snapshot

A survey of behaviour and equivalence preserving refinements of petri nets

inferred← citeshttps://doi.org/10.1007/3-540-54233-7_158openalex-snapshot

Deciding history preserving bisimilarity

inferred← citeshttps://doi.org/10.1007/3-540-54345-7_55openalex-snapshot

Atomic refinement in process description languages

inferred← citeshttps://doi.org/10.1007/3-540-54967-6_63openalex-snapshot

Failures semantics for a simple process language with refinement

inferred← citeshttps://doi.org/10.1007/3-540-55610-9_166openalex-snapshot

Esprit basic research action 3148 DEMON (Design methods based on nets) — Aims, scope and achievements —

inferred← citeshttps://doi.org/10.1007/3-540-55610-9_167openalex-snapshot

The box calculus: A new causal algebra with multi-label communication

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-56689-9_37openalex-snapshot

Replacement of open interface subnets and stable state transformation equivalence

inferred← citeshttps://doi.org/10.1007/3-540-56863-8_51openalex-snapshot

Compositional liveness properties of EN-systems

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-57785-8_152openalex-snapshot

Hypertransition systems

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-61550-4_165openalex-snapshot

Causal testing

inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_20openalex-snapshot

An Event-Based SOS for a Language with Refinement

inferred← citeshttps://doi.org/10.1007/978-3-030-43520-2_6openalex-snapshot

Generating Posets Beyond N

inferred← citeshttps://doi.org/10.1007/978-3-319-92711-4_12openalex-snapshot

Conclusions

inferred← citeshttps://doi.org/10.1007/978-3-642-58041-3_1openalex-snapshot

Distributed Action Systems

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-642-93464-3_2openalex-snapshot

Graphs, Automata, Petri Nets

inferred← citeshttps://doi.org/10.1007/bf01178506openalex-snapshot

Concurrent bisimulations in Petri nets

inferred← citeshttps://doi.org/10.1007/bf01178906openalex-snapshot

Concurrent testing of processes

inferred← citeshttps://doi.org/10.1007/bfb0013999openalex-snapshot

A temporal logic approach to implementation and refinement in timed Petri nets

inferred← citeshttps://doi.org/10.1007/bfb0020808openalex-snapshot

Bisimulation and action refinement

inferred← citeshttps://doi.org/10.1007/bfb0029990openalex-snapshot

Dependency-based action refinement

inferred← citeshttps://doi.org/10.1007/bfb0030640openalex-snapshot

Action refinement as an implementation relation

inferred← citeshttps://doi.org/10.1007/bfb0084780openalex-snapshot

Testing equivalence for Petri Nets with action refinement: Preliminary report

inferred← citeshttps://doi.org/10.1007/bfb0084785openalex-snapshot

Concurrent testing of processes

inferred← citeshttps://doi.org/10.1007/s00165-006-0088-yopenalex-snapshot

Action Refinement Applied to Late Decisions

inferred← citeshttps://doi.org/10.1007/s002360050047openalex-snapshot

Timing and causality in process algebra

inferred← citeshttps://doi.org/10.1007/s002360100070openalex-snapshot

Process algebra with action dependencies

inferred← citeshttps://doi.org/10.1016/0304-3975(93)90157-oopenalex-snapshot

Bisimulation and action refinement

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)00132-8openalex-snapshot

Deciding true concurrency equivalences on safe, finite nets

inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50034-5openalex-snapshot

Action Refinement

inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00078-9openalex-snapshot

A theory of implementation and refinement in timed Petri nets

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80038-6openalex-snapshot

Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80495-5openalex-snapshot

Taking Decisions Late: End-Based Choice Combined with Action Refinement

inferred← citeshttps://doi.org/10.1017/s0960129521000293openalex-snapshot

Languages of higher-dimensional automata

inferred← citeshttps://doi.org/10.1109/iceccs.2005.79openalex-snapshot

The Preservation of Interleaving Equivalences

inferred← citeshttps://doi.org/10.1109/irsse.1992.671837openalex-snapshot

Utilizing Semantic Networks to Database and Retrieve Generalized Stochastic colored Petri Nets

inferred← citeshttps://doi.org/10.1109/lics.1993.287567openalex-snapshot

Self-synchronization of concurrent processes

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.3233/fi-1999-40402openalex-snapshot

Full Abstractness of a Metric Semantics for Action Refinement

inferred← citeshttps://doi.org/10.4204/eptcs.368.1openalex-snapshot

Bisimulations Respecting Duration and Causality for the Non-interleaving Applied π-Calculus

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.