On the public citation graph
Compositional state space generation from Lotos programs
0 signed · 92 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-50940-2_27openalex-snapshot
On the Use of Specifiation Styles in the Design of Distributed Systems (Abstract)
inferredcites →https://doi.org/10.1007/3-540-52148-8_11openalex-snapshot
MEC : a system for constructing and analysing transition systems
inferredcites →https://doi.org/10.1007/3-540-56922-7_8openalex-snapshot
Symbolic equivalence checking
inferredcites →https://doi.org/10.1007/3-540-61363-3_3openalex-snapshot
Compositionality in state space verification methods
inferredcites →https://doi.org/10.1007/3-540-61474-5_97openalex-snapshot
CADP a protocol validation and verification toolbox
inferredcites →https://doi.org/10.1007/bf01211911openalex-snapshot
Compositional minimisation of finite state systems using interface specifications
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0032063openalex-snapshot
An efficient algorithm for branching bisimulation and stuttering equivalence
inferredcites →https://doi.org/10.1007/bfb0035392openalex-snapshot
Compositional state space generation from Lotos programs
inferredcites →https://doi.org/10.1016/0167-6423(90)90071-kopenalex-snapshot
An implementation of an efficient algorithm for bisimulation equivalence
inferredcites →https://doi.org/10.1016/0304-3975(90)90111-topenalex-snapshot
Specification styles in distributed systems design and verification
inferredcites →https://doi.org/10.1016/0890-5401(90)90025-dopenalex-snapshot
CCS expressions, finite state processes, and three problems of equivalence
inferredcites →https://doi.org/10.1016/s0167-6423(96)00034-2openalex-snapshot
Specification and verification of various distributed leader election algorithms for unidirectional ring networks
inferredcites →https://doi.org/10.1137/0216062openalex-snapshot
Three Partition Refinement Algorithms
inferredcites →https://doi.org/10.1145/167049.167071openalex-snapshot
Enhancing compositional reachability analysis with context constraints
inferredcites →https://doi.org/10.1145/222124.222149openalex-snapshot
Compositional reachability analysis of finite-state distributed systems with user-specified constraints
inferredcites →https://doi.org/10.1145/256428.167071openalex-snapshot
Enhancing compositional reachability analysis with context constraints
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/359576.359585openalex-snapshot
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.1007/0-306-47003-9_24openalex-snapshot
SVL: A Scripting Language for Compositional Verification
inferred← citeshttps://doi.org/10.1007/0-306-47005-5_20openalex-snapshot
Specification and Verification of a Dynamic Reconfiguration Protocol for Agent-based Applications
inferred← citeshttps://doi.org/10.1007/11589976_6openalex-snapshot
Exp.Open 2.0: A Flexible Tool Integrating Partial Order, Compositional, and On-The-Fly Verification Methods
inferred← citeshttps://doi.org/10.1007/11888116_13openalex-snapshot
Refined Interfaces for Compositional Verification
inferred← citeshttps://doi.org/10.1007/3-540-36577-x_24openalex-snapshot
Learning Assumptions for Compositional Verification
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_23openalex-snapshot
Saturation: An Efficient Iteration Strategy for Symbolic State—Space Generation
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_33openalex-snapshot
Compositional Verification Using SVL Scripts
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_19openalex-snapshot
Compositional State Space Generation with Partial Order Reductions for Asynchronous Communicating Systems
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_19openalex-snapshot
If: An Intermediate Representation and Validation Environment for Timed Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_9openalex-snapshot
“Next” Heuristic for On-the-Fly Model Checking
inferred← citeshttps://doi.org/10.1007/978-0-387-35563-4_3openalex-snapshot
Behaviour Analysis of Software Architectures
inferred← citeshttps://doi.org/10.1007/978-3-030-00244-2_13openalex-snapshot
Compositional Verification in Action
inferred← citeshttps://doi.org/10.1007/978-3-030-30942-8_13openalex-snapshot
Compositional Verification of Concurrent Systems by Combining Bisimulations
inferred← citeshttps://doi.org/10.1007/978-3-030-45237-7_4openalex-snapshot
Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities
inferred← citeshttps://doi.org/10.1007/978-3-030-64881-7_14openalex-snapshot
Automated Transition Coverage in Behavioural Conformance Testing
inferred← citeshttps://doi.org/10.1007/978-3-031-15629-8_13openalex-snapshot
Equivalence Checking 40 Years After: A Review of Bisimulation Tools
inferred← citeshttps://doi.org/10.1007/978-3-032-12484-5_12openalex-snapshot
Application of Model-Checking Techniques to Railway Scheduling Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-47166-2_29openalex-snapshot
A Model-Based Approach to Combining Static and Dynamic Verification Techniques
inferred← citeshttps://doi.org/10.1007/978-3-319-68034-7_7openalex-snapshot
Compositional Model Checking Is Lively
inferred← citeshttps://doi.org/10.1007/978-3-540-39958-2_17openalex-snapshot
Compositional Verification Using CADP of the ScalAgent Deployment Protocol for Software Components
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_41openalex-snapshot
Calculating τ-Confluence Compositionally
inferred← citeshttps://doi.org/10.1007/978-3-540-68237-0_10openalex-snapshot
Assume-Guarantee Verification for Interface Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_23openalex-snapshot
Refining Interface Alphabets for Compositional Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-03240-0_7openalex-snapshot
Fighting State Space Explosion: Review and Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_11openalex-snapshot
Partial Order Reductions Using Compositional Confluence Detection
inferred← citeshttps://doi.org/10.1007/978-3-642-28756-5_11openalex-snapshot
Partial Model Checking Using Networks of Labelled Transition Systems and Boolean Equation Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-31759-0_7openalex-snapshot
A Compositional Minimization Approach for Large Asynchronous Design Verification
inferred← citeshttps://doi.org/10.1007/bfb0054165openalex-snapshot
OPEN/CÆSAR: An open software architecture for verification, simulation, and testing
inferred← citeshttps://doi.org/10.1007/s00236-015-0226-1openalex-snapshot
Compositional verification of asynchronous concurrent systems using CADP
inferred← citeshttps://doi.org/10.1007/s10009-005-0188-7openalex-snapshot
The saturation algorithm for symbolic state-space exploration
inferred← citeshttps://doi.org/10.1007/s10009-012-0244-zopenalex-snapshot
CADP 2011: a toolbox for the construction and analysis of distributed processes
inferred← citeshttps://doi.org/10.1007/s100090050012openalex-snapshot
Protocol verification with the ALDÉBARAN toolset
inferred← citeshttps://doi.org/10.1007/s100090100044openalex-snapshot
System design of a CC-NUMA multiprocessor architecture using formal specification, model-checking, co-simulation, and test generation
inferred← citeshttps://doi.org/10.1007/s10515-005-2641-yopenalex-snapshot
Component Verification with Automatically Generated Assumptions
inferred← citeshttps://doi.org/10.1007/s10703-008-0049-6openalex-snapshot
Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning
inferred← citeshttps://doi.org/10.1016/b978-044450228-5/50028-xopenalex-snapshot
IF: An Intermediate Representation for SDL and its Applications
inferred← citeshttps://doi.org/10.1016/j.scico.2012.01.003openalex-snapshot
Model checking and performance evaluation with CADP illustrated on shared-memory mutual exclusion protocols
inferred← citeshttps://doi.org/10.1016/j.scico.2020.102493openalex-snapshot
Compositional model checking with divergence preserving branching bisimilarity is lively
inferred← citeshttps://doi.org/10.1016/s0140-3664(99)00223-6openalex-snapshot
Test generation for interworking systems
inferred← citeshttps://doi.org/10.1016/s0951-8320(01)00089-8openalex-snapshot
Formally verified, rapid prototyping for Air Traffic Control
inferred← citeshttps://doi.org/10.1023/a:1008645800955openalex-snapshot
Behaviour Analysis of Distributed Systems Using the Tracta Approach
inferred← citeshttps://doi.org/10.1109/acsd.2014.14openalex-snapshot
Modular µ-Calculus Model-Checking with Formula-Dependent Hierarchical Abstractions
inferred← citeshttps://doi.org/10.1109/ase.1999.802152openalex-snapshot
Advanced modelling and verification techniques applied to a cluster file system
inferred← citeshttps://doi.org/10.1109/ase.2002.1114984openalex-snapshot
Assumption generation for software component verification
inferred← citeshttps://doi.org/10.1109/async.2018.00021openalex-snapshot
Model-Checking Synthesizable SystemVerilog Descriptions of Asynchronous Circuits
inferred← citeshttps://doi.org/10.1109/hipc.1998.738017openalex-snapshot
Testing concurrency and communication in distributed objects
inferred← citeshttps://doi.org/10.1109/hldvt.2009.5340165openalex-snapshot
A coordinated reachability analysis method for modular verification of asynchronous designs
inferred← citeshttps://doi.org/10.1109/hldvt.2010.5496666openalex-snapshot
State space reductions for scalable verification of asynchronous designs
inferred← citeshttps://doi.org/10.1109/icse.1999.841063openalex-snapshot
Behavioral analysis of software architectures using LTSA
inferred← citeshttps://doi.org/10.1109/ictai.2005.77openalex-snapshot
Improving Lotos simulation using constraint propagation
inferred← citeshttps://doi.org/10.1109/iwssd.1998.667929openalex-snapshot
Software architecture directed behaviour analysis
inferred← citeshttps://doi.org/10.1109/srds55811.2022.00018openalex-snapshot
Compositional Model Checking of Consensus Protocols via Interaction-Preserving Abstraction
inferred← citeshttps://doi.org/10.1109/tc.2009.187openalex-snapshot
Modular Model Checking of Large Asynchronous Designs with Efficient Abstraction Refinement
inferred← citeshttps://doi.org/10.1109/tc.2014.2329701openalex-snapshot
Compositional Model Checking of Concurrent Systems
inferred← citeshttps://doi.org/10.1109/tcad.2009.2012531openalex-snapshot
Automated Interface Refinement for Compositional Verification
inferred← citeshttps://doi.org/10.1109/tcad.2009.2035544openalex-snapshot
Compositional Reachability Analysis for Efficient Modular Verification of Asynchronous Designs
inferred← citeshttps://doi.org/10.1109/tvlsi.2014.2330061openalex-snapshot
An I/O Efficient Model Checking Algorithm for Large-Scale Systems
inferred← citeshttps://doi.org/10.1142/s0218194009004416openalex-snapshot
AN EFFICIENT LOTOS-BASED FRAMEWORK FOR DESCRIBING AND SOLVING (TEMPORAL) CSPs
inferred← citeshttps://doi.org/10.1145/1629335.1629344openalex-snapshot
Compositional deadlock detection for rendezvous communication
inferred← citeshttps://doi.org/10.1145/2632362.2632366openalex-snapshot
Local state space construction for compositional verification of concurrent systems
inferred← citeshttps://doi.org/10.1145/302405.302726openalex-snapshot
Behavioral analysis of software architectures using LTSA
inferred← citeshttps://doi.org/10.2168/lmcs-9(4:1)2013openalex-snapshot
Partial Model Checking using Networks of Labelled Transition Systems and Boole an Equation Systems
inferred← citeshttps://doi.org/10.4204/eptcs.349.1openalex-snapshot
Is CADP an Applicable Formal Method?
inferred← citeshttps://doi.org/10.5555/857205.858306openalex-snapshot
Software architecture directed behaviour analysis
inferred← citeshttps://doi.org/10.7916/d8n87jpxopenalex-snapshot
Efficient, Deterministic and Deadlock-free Concurrency
showing the first 69 of 70 · page through all 70
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.