On the public citation graph
Linear and branching structures in the semantics and logics of reactive systems
0 signed · 222 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-12689-9_98openalex-snapshot
A complete set of axioms for a theory of communicating sequential processes
inferredcites →https://doi.org/10.1007/3-540-12896-4_356openalex-snapshot
A semantics and proof system for communicating processes
inferredcites →https://doi.org/10.1007/3-540-13345-3_20openalex-snapshot
A modal characterization of observational congruence on finite terms of CCS
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_13openalex-snapshot
A Logic for the Specification and Proof of Controllable Processes of CCS
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_5openalex-snapshot
In Transition From Global to Modular Temporal Reasoning about Programs
inferredcites →https://doi.org/10.1007/bf00265555openalex-snapshot
Fairness and related properties in transition systems ? a temporal logic to deal with fairness
inferredcites →https://doi.org/10.1007/bf00268075openalex-snapshot
Specification-oriented semantics for Communicating Processes
inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1007/bf00288467openalex-snapshot
A logic for the specification and proof of regular controllable processes of CCS
inferredcites →https://doi.org/10.1007/bf01257083openalex-snapshot
The temporal logic of branching time
inferredcites →https://doi.org/10.1007/bfb0012782openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1007/bfb0025774openalex-snapshot
Design and synthesis of synchronization skeletons using branching time temporal logic
inferredcites →https://doi.org/10.1007/bfb0036896openalex-snapshot
Linear time and branching time semantics for recursion with merge
inferredcites →https://doi.org/10.1007/bfb0036899openalex-snapshot
On the relationship of CCS and CSP
inferredcites →https://doi.org/10.1007/bfb0036936openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1016/0022-0000(79)90006-0openalex-snapshot
Semantics of nondeterminism, concurrency, and communication
inferredcites →https://doi.org/10.1016/0304-3975(76)90028-1openalex-snapshot
An elementary proof for strassen's degree bound
inferredcites →https://doi.org/10.1016/0304-3975(77)90053-6openalex-snapshot
Fully abstract models of typed λ-calculi
inferredcites →https://doi.org/10.1016/0304-3975(81)90110-9openalex-snapshot
The temporal semantics of concurrent programs
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1016/0304-3975(84)90022-7openalex-snapshot
A linear-history semantics for languages for distributed programming
inferredcites →https://doi.org/10.1016/s0019-9958(86)80031-6openalex-snapshot
A modal characterization of observational congruence on finite terms of CCS
inferredcites →https://doi.org/10.1016/s0019-9958(86)80038-9openalex-snapshot
A logic for the description of non-deterministic programs and their properties
inferredcites →https://doi.org/10.1090/psapm/019/0235771openalex-snapshot
Assigning meanings to programs
inferredcites →https://doi.org/10.1109/sfcs.1981.36openalex-snapshot
Possible futures, acceptances, refusals, and communicating processes
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/357103.357110openalex-snapshot
A Proof System for Communicating Sequential Processes
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/567067.567081openalex-snapshot
"Sometimes" and "not never" revisited
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness
inferredcites →https://doi.org/10.1145/567446.567463openalex-snapshot
"Sometime" is sometimes "not never"
inferredcites →https://doi.org/10.1145/800057.808665openalex-snapshot
Now you may compose temporal logic specifications
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/inco.1995.1041openalex-snapshot
A Process Algebra for Timed Systems
inferred← citeshttps://doi.org/10.1007/11423348_12openalex-snapshot
Of Probabilistic wp and CSP—and Compositionality
inferred← citeshttps://doi.org/10.1007/11596356_40openalex-snapshot
Timed Weak Simulation Verification and Its Application to Stepwise Refinement of Real-Time Software
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_54openalex-snapshot
A fully observational model for infinite behaviours of communicating systems
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_60openalex-snapshot
Characterizing Kripke structures in temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_10openalex-snapshot
Readiness semantics for regular processes with silent actions
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_9openalex-snapshot
A timed failures model for extended communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-18419-8_10openalex-snapshot
Designing equivalent semantic models for process creation
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_10openalex-snapshot
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_1openalex-snapshot
Branching vs. Linear Time: Final Showdown
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_13openalex-snapshot
The State Explosion Problem from Trace to Bisimulation Equivalence
inferred← citeshttps://doi.org/10.1007/3-540-51237-3_4openalex-snapshot
A remark on bisimulation between probabilistic processes
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_19openalex-snapshot
Comparing linear and branching time temporal logics
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_21openalex-snapshot
An expressive logic for a process algebra with silent actions
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_31openalex-snapshot
Enforcing nondeterminism via linear time temporal logic specifications using hiding
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_76openalex-snapshot
Compositional theories based on an operational semantics of contexts
inferred← citeshttps://doi.org/10.1007/3-540-52590-4_40openalex-snapshot
Graphical versus logical specifications
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_19openalex-snapshot
A calculus of broadcasting systems
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_21openalex-snapshot
On the complexity of equation solving in process algebra
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_135openalex-snapshot
The expressive power of implicit specifications
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_108openalex-snapshot
Experiments on processes with backtracking
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_29openalex-snapshot
Real-timed concurrent refineable behaviours
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-55808-x_39openalex-snapshot
A functorial semantics for observed concurrency
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_117openalex-snapshot
Reasoning about safety and liveness properties for probabilistic processes
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_4openalex-snapshot
Efficient local correctness checking
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_37openalex-snapshot
An expressive logic for Basic Process Algebra
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_6openalex-snapshot
The linear time — Branching time spectrum II
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_3openalex-snapshot
Automated temporal reasoning about reactive systems
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_117openalex-snapshot
Algebraic characterizations of decorated trace equivalences over tree-like structures
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_84openalex-snapshot
Verification of fair transition systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3756-6_20openalex-snapshot
Timed Process Algebra, Petri Nets, and Event Refinement
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_18openalex-snapshot
Approaching a Real-Timed Concurrency Theory
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_6openalex-snapshot
Experimenting with Process Equivalence
inferred← citeshttps://doi.org/10.1007/978-1-4615-3556-0_2openalex-snapshot
Formal Hardware Verification Methods: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-03421-4_3openalex-snapshot
Temporal Reasoning on Incomplete Paths
inferred← citeshttps://doi.org/10.1007/978-3-030-21485-2_13openalex-snapshot
From the Archives of the Formal Methods and Tools Lab
inferred← citeshttps://doi.org/10.1007/978-3-030-22348-9_8openalex-snapshot
States and Events in KandISTI
inferred← citeshttps://doi.org/10.1007/978-3-030-61362-4_14openalex-snapshot
Behavioral Specification Theories: An Algebraic Taxonomy
inferred← citeshttps://doi.org/10.1007/978-3-031-73709-1_5openalex-snapshot
An Abstract Account of Up-to Techniques for Inductive Behavioural Relations
inferred← citeshttps://doi.org/10.1007/978-3-319-46097-0_10openalex-snapshot
Automatic Generation and Qualification of Assertions on Control Signals: A Time Window-Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-51963-0_5openalex-snapshot
A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_14openalex-snapshot
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds
inferred← citeshttps://doi.org/10.1007/978-3-540-39724-3_28openalex-snapshot
A Compositional Theory of Refinement for Branching Time
inferred← citeshttps://doi.org/10.1007/978-3-540-39910-0_30openalex-snapshot
Fair Equivalence Relations
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_10openalex-snapshot
From Church and Prior to PSL
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_23openalex-snapshot
Latticed Simulation Relations and Games
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_4openalex-snapshot
Branching vs. Linear Time: Semantical Perspective
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_36openalex-snapshot
From Monadic Logic to PSL
inferred← citeshttps://doi.org/10.1007/978-3-540-79707-4_11openalex-snapshot
An Action/State-Based Model-Checking Approach for the Analysis of Communication Protocols for Service-Oriented Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-92701-3_7openalex-snapshot
From Philosophical to Industrial Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_25openalex-snapshot
Making Temporal Logic Calculational: A Tool for Unification and Discovery
inferred← citeshttps://doi.org/10.1007/978-3-642-28540-0_10openalex-snapshot
Probabilistic CSP: Preserving the Laws via Restricted Schedulers
inferred← citeshttps://doi.org/10.1007/978-3-642-45321-2_5openalex-snapshot
From Löwenheim to PSL and SVA
inferred← citeshttps://doi.org/10.1007/978-3-642-72822-8_16openalex-snapshot
Finite Conjunctive Nondeterminism (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-79917-4_2openalex-snapshot
Stochastic Process Algebra for Discrete Event Simulation
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-45198-4_3openalex-snapshot
Probabilistic Bisimulation
inferred← citeshttps://doi.org/10.1007/978-94-017-1201-9_11openalex-snapshot
Quantales and Observational Semantics
inferred← citeshttps://doi.org/10.1007/bf00121125openalex-snapshot
Formal hardware verification methods: A survey
inferred← citeshttps://doi.org/10.1007/bf00264284openalex-snapshot
Tableau-based model checking in the propositional mu-calculus
inferred← citeshttps://doi.org/10.1007/bf01211075openalex-snapshot
A fully abstract semantics of classes for Object-Z
inferred← citeshttps://doi.org/10.1007/bf01211557openalex-snapshot
LOTOS extended with probabilistic behaviours
inferred← citeshttps://doi.org/10.1007/bf01213492openalex-snapshot
Refinement-oriented probability for CSP
inferred← citeshttps://doi.org/10.1007/bf01384499openalex-snapshot
Generality in design and compositional verification usingTav
inferred← citeshttps://doi.org/10.1007/bf01407903openalex-snapshot
Trace, failure and testing equivalences for communicating processes
inferred← citeshttps://doi.org/10.1007/bf01887208openalex-snapshot
A refinement calculus for specifications in Hennessy-Milner logic with recursion
inferred← citeshttps://doi.org/10.1007/bf03259392openalex-snapshot
Automatizing Parametric Reasoning on Distributed Concurrent Systems
inferred← citeshttps://doi.org/10.1007/bfb0013027openalex-snapshot
A logic for the description of behaviours and properties of concurrent systems
inferred← citeshttps://doi.org/10.1007/bfb0013034openalex-snapshot
Fully abstract models for a process language with refinement
inferred← citeshttps://doi.org/10.1007/bfb0014433openalex-snapshot
Institutions for behaviour specification
inferred← citeshttps://doi.org/10.1007/bfb0023734openalex-snapshot
A context dependent equivalence relation between kripke structures
inferred← citeshttps://doi.org/10.1007/bfb0023750openalex-snapshot
On automatically explaining bisimulation inequivalence
inferred← citeshttps://doi.org/10.1007/bfb0026106openalex-snapshot
Proof systems for Hennessy-Milner Logic with recursion
inferred← citeshttps://doi.org/10.1007/bfb0027040openalex-snapshot
Contrasting themes in the semantics of imperative concurrency
inferred← citeshttps://doi.org/10.1007/bfb0027292openalex-snapshot
Specifying reactive systems in B AMN
inferred← citeshttps://doi.org/10.1007/bfb0032056openalex-snapshot
Compositionality through an operational semantics of contexts
inferred← citeshttps://doi.org/10.1007/bfb0039050openalex-snapshot
Ideal specification formalism = expressivity + compositionality + decidability + testability + ...
inferred← citeshttps://doi.org/10.1007/bfb0039056openalex-snapshot
Testing equivalences and fully abstract models for probabilistic processes
inferred← citeshttps://doi.org/10.1007/bfb0039062openalex-snapshot
A temporal approach to algebraic specifications
inferred← citeshttps://doi.org/10.1007/bfb0039069openalex-snapshot
Transition system specifications with negative premises
inferred← citeshttps://doi.org/10.1007/bfb0055612openalex-snapshot
Sometimes and not never re-revisited: on branching versus linear time
inferred← citeshttps://doi.org/10.1007/bfb0084809openalex-snapshot
Compositional verification of probabilistic processes
inferred← citeshttps://doi.org/10.1007/pl00003939openalex-snapshot
SCTL-MUS: A Formal Methodology for Software Development of Distributed Systems. A Case Study
inferred← citeshttps://doi.org/10.1007/s00165-012-0236-5openalex-snapshot
Probabilistic may/must testing: retaining probabilities by restricted schedulers
inferred← citeshttps://doi.org/10.1007/s10703-010-0100-2openalex-snapshot
Pointfree expression and calculation: from quantification to temporal logic
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90039-1openalex-snapshot
The complexity of reasoning about knowledge and time. I. Lower bounds
inferred← citeshttps://doi.org/10.1016/0167-6423(87)90036-0openalex-snapshot
Modalities for model checking: branching time logic strikes back
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(87)90012-0openalex-snapshot
Modal logics for communicating systems
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90048-5openalex-snapshot
Designing equivalent semantic models for process creation
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90096-5openalex-snapshot
Concurrency and atomicity
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90098-9openalex-snapshot
Characterizing finite Kripke structures in propositional temporal logic
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90038-jopenalex-snapshot
Proof systems for satisfiability in Hennessy-Milner Logic with recursion
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90050-popenalex-snapshot
Experimenting with process equivalence
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90276-lopenalex-snapshot
Graphical versus logical specifications
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90111-6openalex-snapshot
Transition system specifications with negative premises
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90155-mopenalex-snapshot
The expressive power of implicit specifications
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00204-vopenalex-snapshot
Translations between modal logics of reactive systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90168-6openalex-snapshot
A semantic characterisation for faults in replicated systems
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90059-qopenalex-snapshot
Priorities in process algebras
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/0890-5401(92)90025-bopenalex-snapshot
A compositional protocol verification using relativized bisimulation
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50021-4openalex-snapshot
Temporal and Modal Logic
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50019-9openalex-snapshot
The Linear Time - Branching Time Spectrum I.**This is an extension of [20]. The research reported in this paper has been initiated at CWI in Amsterdam, continued at the Technical University of Munich, and finalized at Stanford University. It has been supported by Sonderforschungsbereich 342 of the…
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.05.014openalex-snapshot
Interactive Computation: Stepping Stone in the Pathway From Classical to Developmental Computation
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.100499openalex-snapshot
A linear-time–branching-time spectrum for behavioral specification theories
inferred← citeshttps://doi.org/10.1016/j.scico.2010.07.002openalex-snapshot
A state/event-based model-checking approach for the analysis of abstract system properties
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00251-xopenalex-snapshot
Terminal metric spaces of finitely branching and image finite linear processes
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00300-xopenalex-snapshot
Algebraic characterizations of trace and decorated trace equivalences over tree-like structures
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80020-6openalex-snapshot
17 Automata-theoretic techniques for temporal reasoning
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80968-xopenalex-snapshot
A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols
inferred← citeshttps://doi.org/10.1017/s0960129500000189openalex-snapshot
Quantales, observational logic and process semantics
inferred← citeshttps://doi.org/10.1023/a:1008645826258openalex-snapshot
A Formal Verification Environment for Railway Signaling System Design
inferred← citeshttps://doi.org/10.1023/a:1008779610539openalex-snapshot
Efficient Detection of Vacuity in Temporal Model Checking
inferred← citeshttps://doi.org/10.1049/ic:19980529openalex-snapshot
Modelling and analysis of broadcasting embedded control systems
inferred← citeshttps://doi.org/10.1093/comjnl/30.6.498openalex-snapshot
Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
inferred← citeshttps://doi.org/10.1109/37.56284openalex-snapshot
Concurrency and discrete event control
inferred← citeshttps://doi.org/10.1109/ase.2013.6693102openalex-snapshot
Mining branching-time scenarios
inferred← citeshttps://doi.org/10.1109/async58294.2023.10239640openalex-snapshot
Verification-Driven Design for Asynchronous VLSI
inferred← citeshttps://doi.org/10.1109/cdc.1993.325370openalex-snapshot
Supervisory control of nondeterministic discrete event dynamical systems
inferred← citeshttps://doi.org/10.1109/dcfts.1999.814293openalex-snapshot
Formal description and validation for an integrity policy supporting multiple levels of criticality
inferred← citeshttps://doi.org/10.1109/dsd.2001.952267openalex-snapshot
Evaluation of temporal formulas based on "checking by spheres"
inferred← citeshttps://doi.org/10.1109/lics.1990.113738openalex-snapshot
Equation solving using modal transition systems
inferred← citeshttps://doi.org/10.1109/lics.1990.113740openalex-snapshot
Reactive, generative, and stratified models of probabilistic processes
inferred← citeshttps://doi.org/10.1109/lics.1998.705674openalex-snapshot
Linear vs. branching time: a complexity-theoretic perspective
inferred← citeshttps://doi.org/10.1109/lics.2000.855760openalex-snapshot
Precongruence formats for decorated trace preorders
inferred← citeshttps://doi.org/10.1109/lics.2009.12openalex-snapshot
Trace Semantics is Fully Abstract
inferred← citeshttps://doi.org/10.1109/memcod.2008.4547685openalex-snapshot
Rule-Based Approaches for Equivalence Checking of SpecC Programs
inferred← citeshttps://doi.org/10.1109/mwscas.2001.986276openalex-snapshot
Congruent weak conformance
inferred← citeshttps://doi.org/10.1109/tools.2000.868961openalex-snapshot
On the behavioral inheritance of state-based objects
inferred← citeshttps://doi.org/10.1109/tse.2002.1033228openalex-snapshot
On object systems and behavioral inheritance
inferred← citeshttps://doi.org/10.1109/vlsi-soc.2015.7314424openalex-snapshot
A time-window based approach for dynamic assertions mining on control signals
inferred← citeshttps://doi.org/10.1137/s0097539797320906openalex-snapshot
Complete Axiomatizations for Reasoning about Knowledge and Time
inferred← citeshttps://doi.org/10.1137/s0363012992239600openalex-snapshot
Supervisory Control of Nondeterministic Systems with Driven Events via Prioritized Synchronization and Trajectory Models
inferred← citeshttps://doi.org/10.1142/s0129054110007192openalex-snapshot
LATTICED SIMULATION RELATIONS AND GAMES
inferred← citeshttps://doi.org/10.1145/12130.12161openalex-snapshot
The complexity of reasoning about knowledge and time
inferred← citeshttps://doi.org/10.1145/1217975.1217995openalex-snapshot
Quantification in tail-recursive function definitions
inferred← citeshttps://doi.org/10.1145/233551.233556openalex-snapshot
Branching time and abstraction in bisimulation semantics
inferred← citeshttps://doi.org/10.1145/3157831.3157833openalex-snapshot
Undecidability results for probabilistic automata
inferred← citeshttps://doi.org/10.1145/41625.41645openalex-snapshot
Full abstraction of a real-time denotational semantics for an OCCAM-like language
inferred← citeshttps://doi.org/10.1145/512644.512661openalex-snapshot
Expressing interesting properties of programs in propositional temporal logic
inferred← citeshttps://doi.org/10.1145/75277.75307openalex-snapshot
Bisimulation through probabilistic testing (preliminary report)
inferred← citeshttps://doi.org/10.1145/963927.963929openalex-snapshot
Precongruence formats for decorated trace semantics
inferred← citeshttps://doi.org/10.1155/2013/462532openalex-snapshot
Bounded Model Checking of ETL Cooperating with Finite and Looping Automata Connectives
inferred← citeshttps://doi.org/10.13053/cys-8-1-1075openalex-snapshot
Especificación y Análisis de Sistemas de Tiempo Real en Teoría de Tipos
inferred← citeshttps://doi.org/10.14257/ijhit.2015.8.10.25openalex-snapshot
An Approximate Equivalence Based on process Algebra and Numerical Computation and for Differential Semi-algebraic Hybrid Systems
inferred← citeshttps://doi.org/10.14264/47655d0openalex-snapshot
An object-oriented approach to formal specification
inferred← citeshttps://doi.org/10.17760/d20319823openalex-snapshot
Refinement-based reasoning of optimized reactive systems
inferred← citeshttps://doi.org/10.26686/wgtn.17004076openalex-snapshot
On the Use of Model Checking for the Bounded and Unbounded Verification of Nonblocking Concurrent Data Structures
inferred← citeshttps://doi.org/10.26686/wgtn.17004076.v1openalex-snapshot
On the Use of Model Checking for the Bounded and Unbounded Verification of Nonblocking Concurrent Data Structures
inferred← citeshttps://doi.org/10.3990/1.9789090130866openalex-snapshot
Analysing industrial protocols with formal methods
inferred← citeshttps://doi.org/10.4204/eptcs.84.2openalex-snapshot
Towards Algorithmic Synthesis of Synchronization for Shared-Memory Concurrent Programs
inferred← citeshttps://doi.org/10.48550/arxiv.0907.1540openalex-snapshot
Testing Probabilistic Processes: Can Random Choices Be Unobservable?
inferred← citeshttps://doi.org/10.48550/arxiv.1103.4577openalex-snapshot
Logical, Metric, and Algorithmic Characterisations of Probabilistic Bisimulation
inferred← citeshttps://doi.org/10.48550/arxiv.1210.0408openalex-snapshot
A Two Step Perspective for Kripke Structure Reduction
inferred← citeshttps://doi.org/10.48550/arxiv.1502.02910openalex-snapshot
Coalgebraic Tools for Bisimilarity and Decorated Trace Semantics
inferred← citeshttps://doi.org/10.48550/arxiv.1710.09083openalex-snapshot
State Space Reduction for Reachability Graph of CSM Automata
inferred← citeshttps://doi.org/10.6100/ir462072openalex-snapshot
Abstract interpretation and partition refinement for model checking
inferred← citeshttps://doi.org/10.6100/ir716397openalex-snapshot
Probability and hiding in concurrent processes
inferred← citeshttps://doi.org/10.70675/0403fec7z6d88z4f5czb5d8z53294519fb37openalex-snapshot
Automated reasoning on trees with cardinality constraints
inferred← citeshttps://doi.org/10.7146/dpb.v19i307.6555openalex-snapshot
Partial orders and fully abstract models for concurrency
inferred← citeshttps://doi.org/10.7146/dpb.v19i308.6558openalex-snapshot
True concurrency can be traced
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.