On the public citation graph

Transition system specifications with negative premises

https://doi.org/10.1007/bfb0039069
0 signed · 52 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/bfb0015727openalex-snapshot
Linear and branching structures in the semantics and logics of reactive systems
inferredcites →https://doi.org/10.1016/0304-3975(87)90065-xopenalex-snapshot
Observation equivalence as a testing equivalence
inferredcites →https://doi.org/10.1016/0890-5401(88)90027-2openalex-snapshot
Global renaming operators in concrete process algebra
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50009-9openalex-snapshot
On the Declarative Semantics of Deductive Databases and Logic Programs
inferredcites →https://doi.org/10.1016/c2013-0-07699-2openalex-snapshot
Foundations of Deductive Databases and Logic Programming
inferredcites →https://doi.org/10.1109/lics.1988.5118openalex-snapshot
Priorities in process algebras
inferredcites →https://doi.org/10.3233/fi-1986-9202openalex-snapshot
Syntax and Defining Equations for an Interrupt Mechanism in Process Algebra1

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.1999.2825openalex-snapshot
Tile Formats for Located and Mobile Systems
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_19openalex-snapshot
A calculus of broadcasting systems
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-54430-5_101openalex-snapshot
Completeness in real time process algebra
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_86openalex-snapshot
A conditional operator for CCS
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_42openalex-snapshot
Structured operational semantics for concurrency and hierarchy
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_49openalex-snapshot
Expressiveness results for process algebras
inferred← citeshttps://doi.org/10.1007/3-540-56891-3_31openalex-snapshot
A calculus of value broadcasts
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/3-540-57785-8_172openalex-snapshot
Transition system specifications in stalk format with bisimulation as a congruence
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_109openalex-snapshot
The tyft/tyxt format reduces to tree rules
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_168openalex-snapshot
Designing and implementing correct real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_16openalex-snapshot
Axiomatisations of weak equivalences for De Simone languages
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_153openalex-snapshot
On the proof method for bisimulation
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_9openalex-snapshot
Sequent calculi for default and autoepistemic logics
inferred← citeshttps://doi.org/10.1007/978-0-387-34892-6_6openalex-snapshot
Composition of LOTOS specifications
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_6openalex-snapshot
Exception Handling in Process Algebra
inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_7openalex-snapshot
Full Abstraction in Structural Operational Semantics (extended abstract)
inferred← citeshttps://doi.org/10.1007/978-1-4471-3503-6_25openalex-snapshot
Congruences for τ-respecting Formats of Rules
inferred← citeshttps://doi.org/10.1007/978-3-031-94748-3_1openalex-snapshot
Behavioural Equivalences over Reconfigurable Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-41579-6_12openalex-snapshot
Dynamics Security Policies and Process Opacity for Timed Process Algebras
inferred← citeshttps://doi.org/10.1007/978-3-540-30080-9_3openalex-snapshot
Timed Process Algebra (With a Focus on Explicit Termination and Relative-Timing)
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-40561-7_3openalex-snapshot
Real-Time Migration Properties of rTiMo Verified in Uppaal
inferred← citeshttps://doi.org/10.1007/978-3-662-46823-4_13openalex-snapshot
Process Opacity for Timed Process Algebra
inferred← citeshttps://doi.org/10.1007/bf01178776openalex-snapshot
An algebra for process creation
inferred← citeshttps://doi.org/10.1007/bfb0031999openalex-snapshot
Abstraction in real time process algebra
inferred← citeshttps://doi.org/10.1007/bfb0036184openalex-snapshot
Bounded concurrency
inferred← citeshttps://doi.org/10.1007/bfb0053583openalex-snapshot
Integrating AORTA with model-based data specification languages
inferred← citeshttps://doi.org/10.1007/s10009-016-0439-9openalex-snapshot
Verification of critical systems described in real-time TiMo
inferred← citeshttps://doi.org/10.1016/0167-6423(95)00017-8openalex-snapshot
A calculus of broadcasting systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00152-9openalex-snapshot
Structural operational semantics for weak bisimulations
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.09.040openalex-snapshot
A Deterministic Logical Semantics for Esterel
inferred← citeshttps://doi.org/10.1016/s0167-6423(00)00025-3openalex-snapshot
A formal design language for real-time systems with data
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)01465-9openalex-snapshot
Electronic Notes in Theoretical Computer Science
inferred← citeshttps://doi.org/10.1109/eurmic.1996.546368openalex-snapshot
A formal design and implementation method for real-time embedded systems
inferred← citeshttps://doi.org/10.1109/lics.1991.151649openalex-snapshot
CCS with priority choice
inferred← citeshttps://doi.org/10.1109/lics.1992.185529openalex-snapshot
Equivalences on observable processes
inferred← citeshttps://doi.org/10.1145/1113830.1113832openalex-snapshot
Loops in esterel
inferred← citeshttps://doi.org/10.1145/505372.505374openalex-snapshot
Sequent calculi for propositional nonmonotonic logics
inferred← citeshttps://doi.org/10.14236/ewic/fa1996.16openalex-snapshot
Transformation of MTCCS into an Extension of Timed Automata
inferred← citeshttps://doi.org/10.7146/brics.v10i18.21788openalex-snapshot
Syntactic Formats for Free: An Abstract Approach to Process Equivalence
inferred← citeshttps://doi.org/10.7146/brics.v1i40.21603openalex-snapshot
CPO Models for GSOS Languages - Part I: Compact GSOS Languages
inferred← citeshttps://doi.org/10.7146/brics.v3i39.20021openalex-snapshot
On the Complexity of Deciding Behavioural Equivalences and Preorders. A Survey
inferred← citeshttps://doi.org/10.7561/sacs.2020.1.69openalex-snapshot
A Complete Axiomatisation for Probabilistic Trace Equivalence
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.