On the public citation graph
Bounded nondeterminism and the approximation induction principle in process algebra
0 signed · 78 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/978-3-642-82921-5_5openalex-snapshot
Lectures on a Calculus for Communicating Systems
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1016/0304-3975(85)90088-xopenalex-snapshot
Algebra of communicating processes with abstraction
inferredcites →https://doi.org/10.1016/s0019-9958(82)91250-5openalex-snapshot
Processes and the denotational semantics of concurrency
inferredcites →https://doi.org/10.1145/3318.3322openalex-snapshot
CIRCAL and the representation of communication, concurrency, and time
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1999.1663openalex-snapshot
Rooted Branching Bisimulation as a Congruence
inferred← citeshttps://doi.org/10.1007/11539452_21openalex-snapshot
A Ground-Complete Axiomatization of Finite State Processes in Process Algebra
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_8openalex-snapshot
Another look at abstraction in process algebra
inferred← citeshttps://doi.org/10.1007/3-540-18625-5_49openalex-snapshot
Merge and termination in process algebra
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_9openalex-snapshot
Concurrency and computability
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-54233-7_157openalex-snapshot
The meaning of negative premises in transition system specifications
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_78openalex-snapshot
CCS dynamic bisimulation is progressing
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_101openalex-snapshot
Completeness in real time process algebra
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_84openalex-snapshot
The failure of failures in a paradigm for asynchronous communication
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_29openalex-snapshot
On blocks: locality and asynchronous communication
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_33openalex-snapshot
A congruence theorem for structured operational semantics with predicates
inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_24openalex-snapshot
Weak Bisimulation as a Congruence in MSOS
inferred← citeshttps://doi.org/10.1007/978-3-319-27810-0_16openalex-snapshot
Rule Formats for Bounded Nondeterminism in Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_32openalex-snapshot
A congruence theorem for structured operational semantics with predicates and negative premises
inferred← citeshttps://doi.org/10.1007/978-3-642-01112-2_16openalex-snapshot
An Algorithm for Propagating-Impact Analysis of Process Evolutions
inferred← citeshttps://doi.org/10.1007/978-3-642-77572-7_13openalex-snapshot
Process Algebra with Signals and Conditions
inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9openalex-snapshot
Introduction to Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9_9openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/bfb0013021openalex-snapshot
Process theory based on bisimulation semantics
inferred← citeshttps://doi.org/10.1007/bfb0015049openalex-snapshot
Modular specifications in process algebra
inferred← citeshttps://doi.org/10.1007/bfb0031999openalex-snapshot
Abstraction in real time process algebra
inferred← citeshttps://doi.org/10.1007/bfb0035774openalex-snapshot
Structured operational semantics and bisimulation as a congruence
inferred← citeshttps://doi.org/10.1007/bfb0039053openalex-snapshot
Process algebra with a zero object
inferred← citeshttps://doi.org/10.1007/s00165-007-0024-9openalex-snapshot
Thread algebra for strategic interleaving
inferred← citeshttps://doi.org/10.1007/s00236-003-0111-1openalex-snapshot
Structural operational semantics and bounded nondeterminism
inferred← citeshttps://doi.org/10.1007/s10270-010-0162-zopenalex-snapshot
Modeling and enforcing invariants of dynamic software architectures
inferred← citeshttps://doi.org/10.1007/s10617-007-9011-xopenalex-snapshot
A time Petri net-based method for embedded hard real-time software synthesis
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90026-8openalex-snapshot
Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90052-1openalex-snapshot
On the consistency of Koomen's Fair Abstraction Rule
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90225-qopenalex-snapshot
Recursive process definitions with the state operator
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90006-fopenalex-snapshot
Modular specification of process algebras
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90111-6openalex-snapshot
Transition system specifications with negative premises
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90003-4openalex-snapshot
Fixed point equations with parameters in the projective model
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90044-3openalex-snapshot
Process expressions and Hoare's logic: Showing an irreconcilability of context-free recursion with Scott's induction rule
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90013-6openalex-snapshot
Structured operational semantics and bisimulation as a congruence
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.077openalex-snapshot
A Hierarchy of SOS Rule Formats
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.08.014openalex-snapshot
Simulations Up-to and Canonical Preorders
inferred← citeshttps://doi.org/10.1016/j.ic.2007.11.008openalex-snapshot
Semantics and expressiveness of ordered SOS
inferred← citeshttps://doi.org/10.1016/j.ic.2007.12.003openalex-snapshot
(Bi)simulations up-to characterise process semantics
inferred← citeshttps://doi.org/10.1016/j.ic.2011.10.011openalex-snapshot
Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity
inferred← citeshttps://doi.org/10.1016/j.jlamp.2017.03.002openalex-snapshot
A unified rule format for bounded nondeterminism in SOS with terms as labels
inferred← citeshttps://doi.org/10.1016/j.jlap.2004.03.001openalex-snapshot
Axiomatizing GSOS with termination
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.019openalex-snapshot
SOS formats and meta-theory: 20 years after
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00420-5openalex-snapshot
An axiomatic semantics for Esterel
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00292-7openalex-snapshot
A general conservative extension theorem in process algebras with inequalities
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00267-9openalex-snapshot
Language preorder as a precongruence
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80368-2openalex-snapshot
A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras
inferred← citeshttps://doi.org/10.1017/cbo9781139195003openalex-snapshot
Process Algebra: Equational Theories of Communicating Processes
inferred← citeshttps://doi.org/10.1017/s0960129503004006openalex-snapshot
Embedding untimed into timed process algebra: the case for explicit termination
inferred← citeshttps://doi.org/10.1017/s0960129508007111openalex-snapshot
A ground-complete axiomatisation of finite-state processes in a generic process algebra
inferred← citeshttps://doi.org/10.1017/s0960129511000375openalex-snapshot
Characteristic formulae for fixed-point semantics: a general framework
inferred← citeshttps://doi.org/10.1017/s0960129511000387openalex-snapshot
Modal logic and the approximation induction principle
inferred← citeshttps://doi.org/10.1080/00207168908803752openalex-snapshot
Decision procedures and graph reductions for bisimulation equivalences part 2
inferred← citeshttps://doi.org/10.1080/00207169708804599openalex-snapshot
Network algebra for asynchronous dataflow∗
inferred← citeshttps://doi.org/10.1093/comjnl/bxs120openalex-snapshot
Turning GSOS Rules into Equations for Linear Time-Branching Time Semantics
inferred← citeshttps://doi.org/10.1109/aiccsa.2008.4493686openalex-snapshot
A UML rule-based approach for describing and checking dynamic software architectures
inferred← citeshttps://doi.org/10.1109/csf54842.2022.9919644openalex-snapshot
Symbolic protocol verification with dice: process equivalences in the presence of probabilities
inferred← citeshttps://doi.org/10.1109/iccta35431.2014.9521621openalex-snapshot
Process Algebras, Reasoning, And Validation
inferred← citeshttps://doi.org/10.1109/lics.1992.185526openalex-snapshot
Turning SOS rules into equations
inferred← citeshttps://doi.org/10.1109/paap.2015.15openalex-snapshot
Modelling Binary Oriented Software Buffer-Overflow Vulnerability in Process Algebra
inferred← citeshttps://doi.org/10.1145/248621.248623openalex-snapshot
Algebraic approaches to nondeterminism—an overview
inferred← citeshttps://doi.org/10.11606/t.45.2008.tde-27102008-100359openalex-snapshot
Geração de expressões algébricas para processos de negócio usando reduções de digrafos série-paralelo
inferred← citeshttps://doi.org/10.3233/fi-1992-16206openalex-snapshot
Dynamic Congruence vs. Progressing Bisimulation for CCS1
inferred← citeshttps://doi.org/10.3233/jcs-230037openalex-snapshot
Symbolic protocol verification with dice: Process equivalences in the presence of probabilities
inferred← citeshttps://doi.org/10.4204/eptcs.8.4openalex-snapshot
Modal Logic and the Approximation Induction Principle
inferred← citeshttps://doi.org/10.48550/arxiv.1702.07838openalex-snapshot
An Algebraic Treatment of Recursion
inferred← citeshttps://doi.org/10.6100/ir594899openalex-snapshot
Structuring structural operational semantics
inferred← citeshttps://doi.org/10.7146/brics.v6i30.20099openalex-snapshot
Structural Operational Semantics
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.