On the public citation graph
Extensional equivalences for transition systems
0 signed · 232 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-11494-7_5openalex-snapshot
An enlarged definition and complete axiomatization of observational congruence of finite processes
inferredcites →https://doi.org/10.1007/bf00268075openalex-snapshot
Specification-oriented semantics for Communicating Processes
inferredcites →https://doi.org/10.1007/bfb0036900openalex-snapshot
Behavioural equivalence relations induced by programming logics
inferredcites →https://doi.org/10.1016/0022-0000(84)90023-0openalex-snapshot
A complete inference system for a class of regular behaviours
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)90113-0openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/360248.360251openalex-snapshot
Formal verification of parallel programs
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
inferredcites →https://doi.org/10.1515/9781400882618-006openalex-snapshot
Gedanken-Experiments on Sequential Machines
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470611647.ch12openalex-snapshot
Verification of Specific Properties
inferred← citeshttps://doi.org/10.1002/spe.721openalex-snapshot
Validating feature‐based specifications
inferred← citeshttps://doi.org/10.1002/stvr.1543openalex-snapshot
Model‐based testing for concurrent systems with labelled event structures
inferred← citeshttps://doi.org/10.1006/ijhc.1998.0223openalex-snapshot
Formal architectural abstractions for interactive software
inferred← citeshttps://doi.org/10.1006/inco.1995.1039openalex-snapshot
On Deciding Readiness and Failure Equivalences for Processes
inferred← citeshttps://doi.org/10.1006/inco.1995.1066openalex-snapshot
Split and ST Bisimulation Semantics
inferred← citeshttps://doi.org/10.1006/inco.1995.1114openalex-snapshot
Testing Equivalence for Mobile Processes
inferred← citeshttps://doi.org/10.1006/inco.1997.2652openalex-snapshot
Quiescence, Fairness, Testing, and the Notion of Implementation
inferred← citeshttps://doi.org/10.1006/inco.1998.2755openalex-snapshot
Basic Observables for Processes
inferred← citeshttps://doi.org/10.1006/inco.1999.2808openalex-snapshot
Testing Preorders for Probabilistic Processes
inferred← citeshttps://doi.org/10.1007/11576280_19openalex-snapshot
Testing Real-Time Multi Input-Output Systems
inferred← citeshttps://doi.org/10.1007/3-540-45251-6_25openalex-snapshot
From Complex Specifications to a Working Prototype. A Protocol Engineering Case Study
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_9openalex-snapshot
Testing Transition Systems: An Annotated Bibliography
inferred← citeshttps://doi.org/10.1007/3-540-46017-9_4openalex-snapshot
Abstraction in Software Model Checking: Principles and Practice
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_31openalex-snapshot
Graded Modalities and Resource Bisimulation
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_6openalex-snapshot
Testing Concurrent Systems: A Formal Approach
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_6openalex-snapshot
Formal Methods for Conformance Testing: Theory Can Be Practical
inferred← citeshttps://doi.org/10.1007/3-540-50403-6_43openalex-snapshot
External behaviour equivalence between two petrinets
inferred← citeshttps://doi.org/10.1007/3-540-52148-8_24openalex-snapshot
Requirement analysis for communication protocols
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_87openalex-snapshot
Foundations of compositional program refinement
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_16openalex-snapshot
Observers, experiments, and agents: A comprehensive approach to parallelism
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_5openalex-snapshot
Three equivalent semantics for CCS
inferred← citeshttps://doi.org/10.1007/3-540-53487-3_53openalex-snapshot
Observational logics and concurrency models
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-55610-9_180openalex-snapshot
A survey of equivalence notions for net based systems
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_116openalex-snapshot
Testing preorders for probabilistic processes
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_87openalex-snapshot
Testability of a communicating system through an environment
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_23openalex-snapshot
Quiescence, fairness, testing, and the notion of implementation
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-58426-9_125openalex-snapshot
Formal reasoning on fault coverage of fault tolerant techniques: A case study
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_190openalex-snapshot
Algebraic reasoning for real-time probabilistic processes with uncertain information
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_63openalex-snapshot
An algebraic framework for developing and maintaining real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_112openalex-snapshot
Divergence and fair testing
inferred← citeshttps://doi.org/10.1007/3-540-61042-1_42openalex-snapshot
Test generation with inputs, outputs, and quiescence
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-63165-8_204openalex-snapshot
Basic observables for processes
inferred← citeshttps://doi.org/10.1007/978-0-387-09766-4_517openalex-snapshot
Behavioral Equivalences
inferred← citeshttps://doi.org/10.1007/978-0-387-34867-4_17openalex-snapshot
Failure-based Congruences, Unfair Divergences and New Testing Theory
inferred← citeshttps://doi.org/10.1007/978-0-387-35198-8_10openalex-snapshot
Developments in testing transition systems
inferred← citeshttps://doi.org/10.1007/978-0-387-35271-8_2openalex-snapshot
Refusal testing for classes of transition systems with inputs and outputs
inferred← citeshttps://doi.org/10.1007/978-0-387-35567-2_9openalex-snapshot
Protocol-Inspired Hardware Testing
inferred← citeshttps://doi.org/10.1007/978-1-4471-3756-6_10openalex-snapshot
The Ecology of Class Refinement
inferred← citeshttps://doi.org/10.1007/978-3-030-21485-2_10openalex-snapshot
Testing for Coordination Fidelity
inferred← citeshttps://doi.org/10.1007/978-3-030-21485-2_26openalex-snapshot
A Framework for Provenance-Preserving History Distribution and Incremental Reduction
inferred← citeshttps://doi.org/10.1007/978-3-030-21485-2_4openalex-snapshot
Testing Equivalence vs. Runtime Monitoring
inferred← citeshttps://doi.org/10.1007/978-3-030-21759-4_7openalex-snapshot
Component-aware Input-Output Conformance
inferred← citeshttps://doi.org/10.1007/978-3-030-37487-7_22openalex-snapshot
Causality-Based Testing in Time Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-44411-2_2openalex-snapshot
Coherent Resolutions of Nondeterminism
inferred← citeshttps://doi.org/10.1007/978-3-031-47115-5_5openalex-snapshot
Robustness Testing of Software Verifiers
inferred← citeshttps://doi.org/10.1007/978-3-031-73709-1_1openalex-snapshot
Introduction to the REoCAS Colloquium in Honor of Rocco De Nicola’s 70th Birthday
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-031-73709-1_8openalex-snapshot
Towards a Formal Testing Theory for Quantum Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_13openalex-snapshot
Abstraction and Abstraction Refinement
inferred← citeshttps://doi.org/10.1007/978-3-319-10696-0_23openalex-snapshot
On the Discriminating Power of Testing Equivalences for Reactive Probabilistic Systems: Results and Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-25527-9_15openalex-snapshot
Global Protocol Implementations via Attribute-Based Communication
inferred← citeshttps://doi.org/10.1007/978-3-319-57666-4_5openalex-snapshot
Compositionality, Decompositionality and Refinement in Input/Output Conformance Testing
inferred← citeshttps://doi.org/10.1007/978-3-319-67113-0_5openalex-snapshot
Model-Based Testing for Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-68270-9_5openalex-snapshot
On the Existence of Practical Testers
inferred← citeshttps://doi.org/10.1007/978-3-319-92711-4_1openalex-snapshot
Labeled Transition Systems and Their Refinement
inferred← citeshttps://doi.org/10.1007/978-3-540-24704-3_7openalex-snapshot
Testing Multi Input/Output Transition System with All-Observer
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_36openalex-snapshot
Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-74792-5_1openalex-snapshot
Model-Based Testing of Environmental Conformance of Components
inferred← citeshttps://doi.org/10.1007/978-3-540-78917-8_1openalex-snapshot
Model Based Testing with Labelled Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-88194-0_6openalex-snapshot
Conformance Testing Based on UML State Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-92698-6_5openalex-snapshot
Consistency between Task Models and Use Cases
inferred← citeshttps://doi.org/10.1007/978-3-642-00255-7_13openalex-snapshot
Modelling Divergence in Relational Concurrent Refinement
inferred← citeshttps://doi.org/10.1007/978-3-642-01364-5_3openalex-snapshot
Contract Compliance and Choreography Conformance in the Presence of Message Queues
inferred← citeshttps://doi.org/10.1007/978-3-642-01918-0_7openalex-snapshot
Contract-Based Discovery and Composition of Web Services
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_7openalex-snapshot
Retaining the Probabilities in Probabilistic Testing Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-21455-4_9openalex-snapshot
Model-Based Testing and Some Steps towards Test-Based Modelling
inferred← citeshttps://doi.org/10.1007/978-3-642-21461-5_2openalex-snapshot
Linear-Time and May-Testing in a Probabilistic Reactive Setting
inferred← citeshttps://doi.org/10.1007/978-3-642-24130-7_1openalex-snapshot
Logical Dynamics of Evidence
inferred← citeshttps://doi.org/10.1007/978-3-642-28729-9_13openalex-snapshot
Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-30473-6_7openalex-snapshot
Incremental Model-Based Testing of Delta-Oriented Software Product Lines
inferred← citeshttps://doi.org/10.1007/978-3-642-30473-6_8openalex-snapshot
Conformance Relations for Labeled Event Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-34026-0_17openalex-snapshot
Parameterized Preorder Relations for Model-Based Testing of Software Product Lines
inferred← citeshttps://doi.org/10.1007/978-3-642-85165-0_9openalex-snapshot
A Method for Applying LOTOS at an Early Design Stage and Its Application to the ISO Transport Protocol
inferred← citeshttps://doi.org/10.1007/978-3-7091-6878-3_14openalex-snapshot
Formal aspects of task based design
inferred← citeshttps://doi.org/10.1007/bf01210998openalex-snapshot
On simulation, subtyping and substitutability in sequential object systems
inferred← citeshttps://doi.org/10.1007/bf01213078openalex-snapshot
Compositional refinements in multiple blackboard systems
inferred← citeshttps://doi.org/10.1007/bf01933173openalex-snapshot
Minimizing the number of transitions with respect to observation equivalence
inferred← citeshttps://doi.org/10.1007/bfb0013030openalex-snapshot
Partial orderings descriptions and observations of nondeterministic concurrent processes
inferred← citeshttps://doi.org/10.1007/bfb0027801openalex-snapshot
A dynamic evolution for the specifications of distributed systems
inferred← citeshttps://doi.org/10.1007/bfb0031991openalex-snapshot
Time in state based formal description techniques for distributed systems
inferred← citeshttps://doi.org/10.1007/bfb0039066openalex-snapshot
The linear time - branching time spectrum
inferred← citeshttps://doi.org/10.1007/bfb0084779openalex-snapshot
Testing equivalence for mobile processes
inferred← citeshttps://doi.org/10.1007/s00165-010-0158-zopenalex-snapshot
Partial order semantics for use case and task models
inferred← citeshttps://doi.org/10.1007/s00165-011-0177-4openalex-snapshot
Temporal-logic property preservation under Z refinement
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/s00165-012-0262-3openalex-snapshot
Relational concurrent refinement part III: traces, partial relations and automata
inferred← citeshttps://doi.org/10.1007/s00236-012-0151-5openalex-snapshot
A trace-based service semantics guaranteeing deadlock freedom
inferred← citeshttps://doi.org/10.1007/s10009-004-0148-7openalex-snapshot
Test generation for radiotherapy accelerators
inferred← citeshttps://doi.org/10.1007/s100090050044openalex-snapshot
On-the-fly conformance testing using SPIN
inferred← citeshttps://doi.org/10.1007/s10270-005-0103-4openalex-snapshot
Separation of non-orthogonal concerns in software architecture and design
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90008-jopenalex-snapshot
Complete sets of axioms for finite basic LOTOS behavioural equivalences
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90110-hopenalex-snapshot
Failure-equivalent transformation of transition systems to avoid internal actions
inferred← citeshttps://doi.org/10.1016/0022-4049(92)90048-kopenalex-snapshot
Enriched categorial semantics for distributed calculi
inferred← citeshttps://doi.org/10.1016/0169-7552(87)90085-7openalex-snapshot
Introduction to the ISO specification language LOTOS
inferred← citeshttps://doi.org/10.1016/0169-7552(90)90121-8openalex-snapshot
Specifications of a simplified transport protocol using different formal description techniques
inferred← citeshttps://doi.org/10.1016/0169-7552(92)90122-7openalex-snapshot
A framework based on implementation relations for implementing LOTOS specifications
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90096-5openalex-snapshot
Concurrency and atomicity
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90065-0openalex-snapshot
Stable families of behavioural equivalences
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90111-topenalex-snapshot
Specification styles in distributed systems design and verification
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90027-yopenalex-snapshot
Contents EATCS bulletin number 44, June 1991
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90185-iopenalex-snapshot
The chemical abstract machine
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00166-2openalex-snapshot
On the operational semantics of nondeterminism and divergence
inferred← citeshttps://doi.org/10.1016/0304-3975(95)92307-jopenalex-snapshot
A process algebraic view of input/output automata
inferred← citeshttps://doi.org/10.1016/b978-0-12-046370-1.50014-0openalex-snapshot
Canonical Representatives for Observational Equivalence Classes
inferred← citeshttps://doi.org/10.1016/b978-0-444-89402-1.50012-6openalex-snapshot
What is the Method in Formal Methods?
inferred← citeshttps://doi.org/10.1016/b978-0-444-89874-6.50015-5openalex-snapshot
A Queue Model Relating Synchronous and Asynchronous Communication
inferred← citeshttps://doi.org/10.1016/b978-0-444-89874-6.50022-2openalex-snapshot
Improvements on UIO Sequence Generation and Partial UIO Sequences
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.2004.04.025openalex-snapshot
A Hierarchy of Failures-Based Models
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.entcs.2008.06.012openalex-snapshot
More Relational Concurrent Refinement: Traces and Partial Relations
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.10.002openalex-snapshot
Uniform Logical Characterizations of Testing Equivalences for Nondeterministic, Probabilistic and Markovian Processes
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.2013.02.004openalex-snapshot
A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
inferred← citeshttps://doi.org/10.1016/j.jlap.2006.03.001openalex-snapshot
On testing UML statecharts
inferred← citeshttps://doi.org/10.1016/j.jlap.2009.12.001openalex-snapshot
Relating fair testing and accordance for service replaceability
inferred← citeshttps://doi.org/10.1016/j.jss.2013.11.1096openalex-snapshot
Delta-oriented model-based integration testing of large-scale systems
inferred← citeshttps://doi.org/10.1016/j.scico.2018.09.006openalex-snapshot
On the expressiveness of modal transition systems with variability constraints
inferred← citeshttps://doi.org/10.1016/j.scico.2018.09.008openalex-snapshot
Unifying modal interface theories and compositional input/output conformance testing
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.10.004openalex-snapshot
A hierarchy of failures-based models: theory and application
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.05.030openalex-snapshot
Processes as formal power series: A coinductive approach to denotational semantics
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.03.001openalex-snapshot
Relating strong behavioral equivalences for processes with nondeterminism and probabilities
inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00104-0openalex-snapshot
Reasoning about nondeterministic and concurrent actions: A process algebra approach
inferred← citeshttps://doi.org/10.1016/s0164-1212(01)00079-6openalex-snapshot
On the application of formal description techniques to the design of interception systems for GSM mobile terminals
inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00025-1openalex-snapshot
Categorical semantics of parallel program design
inferred← citeshttps://doi.org/10.1016/s0169-7552(96)00017-7openalex-snapshot
Conformance testing with labelled transition systems: Implementation relations and test generation
inferred← citeshttps://doi.org/10.1016/s0169-7552(97)00133-5openalex-snapshot
Stochastic process algebras – between LOTOS and Markov chains
inferred← citeshttps://doi.org/10.1016/s0304-3975(06)80006-xopenalex-snapshot
The equivalence in the DCP model
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00063-1openalex-snapshot
A π-calculus with explicit substitutions
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00214-5openalex-snapshot
Finite axiom systems for testing preorder and De Simone process languages
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/s0890-5401(03)00065-8openalex-snapshot
Faster asynchronous systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80249-xopenalex-snapshot
Tree Morphisms and Bisimulations
inferred← citeshttps://doi.org/10.1017/cbo9780511777110openalex-snapshot
Introduction to Bisimulation and Coinduction
inferred← citeshttps://doi.org/10.1017/s1755020311000190openalex-snapshot
REASONING WITH PROTOCOLS UNDER IMPERFECT INFORMATION
inferred← citeshttps://doi.org/10.1023/a:1013692902855openalex-snapshot
A formal method for synthesizing optimized protocol converters and its application to mobile data networks
inferred← citeshttps://doi.org/10.1080/00207168908803752openalex-snapshot
Decision procedures and graph reductions for bisimulation equivalences part 2
inferred← citeshttps://doi.org/10.1093/comjnl/43.3.191openalex-snapshot
Formally Verifying Fault Tolerant System Designs
inferred← citeshttps://doi.org/10.1093/jigpal/7.1.55openalex-snapshot
Flat fragments of CTL and CTL: separating the expressive and distinguishing powers
inferred← citeshttps://doi.org/10.1109/12.88460openalex-snapshot
Formalization of protocol engineering concepts
inferred← citeshttps://doi.org/10.1109/9.400494openalex-snapshot
Equivalence preserving transformations for timed transition models
inferred← citeshttps://doi.org/10.1109/acsd.2014.11openalex-snapshot
Failure Semantics for Modal Transition Systems
inferred← citeshttps://doi.org/10.1109/acsd.2015.21openalex-snapshot
Testing Preorders for dMTS: Deadlock- and the New Deadlock/Divergence-Testing
inferred← citeshttps://doi.org/10.1109/apsec.1996.566760openalex-snapshot
A dynamic extension for the specifications of distributed systems
inferred← citeshttps://doi.org/10.1109/aswec.2000.844574openalex-snapshot
Formal requirements engineering: learning from the students
inferred← citeshttps://doi.org/10.1109/cdc.1992.371016openalex-snapshot
Equivalence preserving transformations for timed transition models
inferred← citeshttps://doi.org/10.1109/csfw.1989.40582openalex-snapshot
Security properties consistent with the testing semantics for communicating processes
inferred← citeshttps://doi.org/10.1109/edtc.1995.470375openalex-snapshot
Proving testing preorders for process algebra descriptions
inferred← citeshttps://doi.org/10.1109/icccn.1995.540100openalex-snapshot
An efficient method for protocol conversion
inferred← citeshttps://doi.org/10.1109/iccnmc.2003.1243104openalex-snapshot
Refusal testing for MIOTS with nonlockable output channels
inferred← citeshttps://doi.org/10.1109/icnp.1995.524814openalex-snapshot
Verification and diagnosis of testing equivalence and reduction relation
inferred← citeshttps://doi.org/10.1109/icter51097.2020.9325490openalex-snapshot
Transformation of Contract Descriptions in a Domain Specific Language to Solidity Assembly
inferred← citeshttps://doi.org/10.1109/iros.2014.6942754openalex-snapshot
Verifying and validating multirobot missions
inferred← citeshttps://doi.org/10.1109/iscc.1998.702643openalex-snapshot
Comparative analysis of the notions of equivalence for process specifications
inferred← citeshttps://doi.org/10.1109/lics.1990.113739openalex-snapshot
Three logics for branching bisimulation
inferred← citeshttps://doi.org/10.1109/lics.1990.113741openalex-snapshot
The nonexistence of finite axiomatisations for CCS congruences
inferred← citeshttps://doi.org/10.1109/lics.1991.151635openalex-snapshot
A theory of testing for real-time
inferred← citeshttps://doi.org/10.1109/lics.1996.561304openalex-snapshot
An algebraic theory of process efficiency
inferred← citeshttps://doi.org/10.1109/pccc.1995.472481openalex-snapshot
A top-down method for synthesizing optimized protocol converters
inferred← citeshttps://doi.org/10.1109/real.1996.563703openalex-snapshot
Predictability of real-time systems: a process-algebraic approach
inferred← citeshttps://doi.org/10.1109/spdp.1991.218189openalex-snapshot
The complexity of readiness and failure equivalences for processes
inferred← citeshttps://doi.org/10.1109/tro.2015.2418592openalex-snapshot
Performance Verification for Behavior-Based Robot Missions
inferred← citeshttps://doi.org/10.1109/tse.2016.2615311openalex-snapshot
Automated Steering of Model-Based Test Oracles to Admit Real Program Behaviors
inferred← citeshttps://doi.org/10.1134/s0361768820040040openalex-snapshot
Testing Equivalences of Time Petri Nets
inferred← citeshttps://doi.org/10.1142/9789812831583_0012openalex-snapshot
Performance analysis and true concurrency semantics
inferred← citeshttps://doi.org/10.1145/165854.167976openalex-snapshot
Regular types for active objects
inferred← citeshttps://doi.org/10.1145/167962.167976openalex-snapshot
Regular types for active objects
inferred← citeshttps://doi.org/10.1145/201019.201032openalex-snapshot
Three logics for branching bisimulation
inferred← citeshttps://doi.org/10.1145/2603088.2603113openalex-snapshot
On the discriminating power of passivation and higher-order interaction
inferred← citeshttps://doi.org/10.1145/2746336openalex-snapshot
Failure Semantics for Modal Transition Systems
inferred← citeshttps://doi.org/10.1145/3544585.3544595openalex-snapshot
Nondeterminism and Guarded Commands
inferred← citeshttps://doi.org/10.1145/566171.566194openalex-snapshot
On testing and conformance relations for UML statechart diagrams behaviours
inferred← citeshttps://doi.org/10.1145/566172.566194openalex-snapshot
On testing and conformance relations for UML statechart diagrams behaviours
inferred← citeshttps://doi.org/10.1145/63264.63402openalex-snapshot
ECCS and LIPS: two languages for OSI systems specification and verification
inferred← citeshttps://doi.org/10.1186/s40411-016-0028-3openalex-snapshot
A systematic process for obtaining the behavior of context-sensitive systems
inferred← citeshttps://doi.org/10.1371/journal.pone.0231534openalex-snapshot
Formalizing the use case model: A model-based approach
inferred← citeshttps://doi.org/10.14236/ewic/fm1998.4openalex-snapshot
TEACHING FORMAL METHODS: Lessons To Learn
inferred← citeshttps://doi.org/10.15514/syrcose-2007-1-14openalex-snapshot
Conformance Testing With State Mapping
inferred← citeshttps://doi.org/10.2168/lmcs-10(1:16)2014openalex-snapshot
Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
inferred← citeshttps://doi.org/10.25405/ncl.34129056openalex-snapshot
Modelling and Verification of Communicating Processes in the Event of Interface Difference
inferred← citeshttps://doi.org/10.2991/icsecs-13.2013.27openalex-snapshot
Approximation of Homogeneous Linear Algebraic Transition Systems
inferred← citeshttps://doi.org/10.3233/fi-1992-16206openalex-snapshot
Dynamic Congruence vs. Progressing Bisimulation for CCS1
inferred← citeshttps://doi.org/10.3233/fi-1996-27402openalex-snapshot
ON FOUR PARTIAL ORDERING SEMANTICS FOR A PROCESS CALCULUS
inferred← citeshttps://doi.org/10.3233/fun-2001-48103openalex-snapshot
Behaviour Abstraction for Communicating Sequential Processes
inferred← citeshttps://doi.org/10.3990/1.9789036511285openalex-snapshot
Ins and outs in refusal testing
inferred← citeshttps://doi.org/10.3990/1.9789036524766openalex-snapshot
Theories for Model-based Testing: Real-time and Coverage
inferred← citeshttps://doi.org/10.3990/1.9789036531955openalex-snapshot
On changing models in model-based testing
showing the first 200 of 217 · page through all 217
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.