On the public citation graph
Compositional minimization of finite state systems
0 signed · 139 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-16047-7_47openalex-snapshot
An example of specification and verification in CESAR
inferredcites →https://doi.org/10.1007/3-540-50939-9_144openalex-snapshot
Local model checking in the modal mu-calculus
inferredcites →https://doi.org/10.1007/3-540-51803-7_25openalex-snapshot
MCTL — An extension of CTL for modular verification of concurrent systems
inferredcites →https://doi.org/10.1007/3-540-52148-8_13openalex-snapshot
Network grammars, communication behaviors and automatic verification
inferredcites →https://doi.org/10.1007/3-540-52148-8_6openalex-snapshot
Verifying properties of large sets of processes with network invariants
inferredcites →https://doi.org/10.1007/3-540-52148-8_8openalex-snapshot
Projections of the reachability graph and environment models
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/bfb0017164openalex-snapshot
Compositional proofs by partial specification of processes
inferredcites →https://doi.org/10.1007/bfb0032056openalex-snapshot
Compositionality through an operational semantics of contexts
inferredcites →https://doi.org/10.1016/0304-3975(87)90012-0openalex-snapshot
Modal logics for communicating systems
inferredcites →https://doi.org/10.1016/0304-3975(90)90110-4openalex-snapshot
Local model checking in the modal mu-calculus
inferredcites →https://doi.org/10.1016/0890-5401(90)90048-mopenalex-snapshot
Bisimulation and divergence
inferredcites →https://doi.org/10.1109/lics.1990.113768openalex-snapshot
When is 'partial' adequate? A logic-based proof technique using partial specifications
inferredcites →https://doi.org/10.1145/41625.41641openalex-snapshot
LUSTRE: a declarative language for real-time programming
inferredcites →https://doi.org/10.1145/567067.567080openalex-snapshot
Automatic verification of finite state concurrent system using temporal logic specifications
inferredcites →https://doi.org/10.1145/72981.72998openalex-snapshot
A structural induction theorem for processes
inferredcites →https://doi.org/10.7146/dpb.v19i324.6714openalex-snapshot
On the compositional checking of validity
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/10722468_9openalex-snapshot
Interaction Abstraction for Compositional Finite State Systems
inferred← citeshttps://doi.org/10.1007/11506881_4openalex-snapshot
A Pointillist Approach for Comparing Honeypots
inferred← citeshttps://doi.org/10.1007/11537328_13openalex-snapshot
Crafting a Promela Front-End with Abstract Data Types to Mitigate the Sensitivity of (Compositional) Analysis to Implementation Choices
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/11734666_9openalex-snapshot
Tampering with Motes: Real-World Physical Attacks on Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/11812128_21openalex-snapshot
On-the-Fly Branching Bisimulation Minimization for Compositional Analysis
inferred← citeshttps://doi.org/10.1007/11888116_13openalex-snapshot
Refined Interfaces for Compositional Verification
inferred← citeshttps://doi.org/10.1007/3-540-45614-7_23openalex-snapshot
On Combining Functional Verification and Performance Evaluation Using CADP
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-56496-9_19openalex-snapshot
Automatic reduction in CTL compositional model checking
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_57openalex-snapshot
Models whose checks don't explode
inferred← citeshttps://doi.org/10.1007/3-540-60406-5_7openalex-snapshot
Using a symbolic model checker for verify safety properties in SA/RT models
inferred← citeshttps://doi.org/10.1007/3-540-60630-0_2openalex-snapshot
A constraint oriented proof methodology based on modal transition systems
inferred← citeshttps://doi.org/10.1007/978-1-4613-9347-4_5openalex-snapshot
Homomorphic Reduction of Coordination Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-00244-2_12openalex-snapshot
Predicate Abstraction and Such...
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-00244-2_2openalex-snapshot
Building Correct Cyber-Physical Systems: Why We Need a Multiview Contract Theory
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-30985-5_19openalex-snapshot
Product Line Verification via Modal Meta Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-31514-6_8openalex-snapshot
Generating Hard Benchmark Problems for Weak Bisimulation
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-031-20872-0_10openalex-snapshot
Decompositional Branching Bisimulation Minimisation of Monolithic Processes
inferred← citeshttps://doi.org/10.1007/978-3-031-24950-1_8openalex-snapshot
Compositional Verification of Stigmergic Collective Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-61433-0_15openalex-snapshot
Modular State Spaces - A New Perspective
inferred← citeshttps://doi.org/10.1007/978-3-031-61433-0_16openalex-snapshot
Verifying Temporal Logic Properties in the Modular State Space
inferred← citeshttps://doi.org/10.1007/978-3-031-94634-9_23openalex-snapshot
Symbolic Model Checking in the Modular State Space Using Binary Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-031-98685-7_10openalex-snapshot
Scaling GR(1) Synthesis via a Compositional Frameworkfor LTL Discrete Event Control
inferred← citeshttps://doi.org/10.1007/978-3-319-05416-2_11openalex-snapshot
Compositional Nonblocking Verification with Always Enabled Events and Selfloop-Only Events
inferred← citeshttps://doi.org/10.1007/978-3-319-15317-9_18openalex-snapshot
Reduction and Abstraction Techniques for BIP
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-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-75101-4_26openalex-snapshot
Achieving Highly Reliable Embedded Software: An Empirical Evaluation of Different Approaches
inferred← citeshttps://doi.org/10.1007/978-3-540-75183-0_20openalex-snapshot
Behavioral Constraints for Services
inferred← citeshttps://doi.org/10.1007/978-3-540-93851-4_40openalex-snapshot
Goal Preservation by Choreography-Driven Matchmaking
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-41533-3_19openalex-snapshot
Model Checking of UML-RT Models Using Lazy Composition
inferred← citeshttps://doi.org/10.1007/978-3-642-54013-4_13openalex-snapshot
Message-Passing Algorithms for the Verification of Distributed Protocols
inferred← citeshttps://doi.org/10.1007/978-3-662-73305-9_11openalex-snapshot
A Gentle Tour Through A Petri Net Model Checking Tool
inferred← citeshttps://doi.org/10.1007/bf00873407openalex-snapshot
Contextual local analysis in the design of distributed systems
inferred← citeshttps://doi.org/10.1007/bf01185559openalex-snapshot
An experience in proving regular networks of processes by modular model checking
inferred← citeshttps://doi.org/10.1007/bfb0020979openalex-snapshot
Fischer's protocol revisited: A simple proof using modal constraints
inferred← citeshttps://doi.org/10.1007/s001650050046openalex-snapshot
Formalising a Value-Passing Calculus in HOL
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/s10270-015-0484-yopenalex-snapshot
Language-specific model checking of UML-RT models
inferred← citeshttps://doi.org/10.1007/s10626-015-0217-yopenalex-snapshot
A framework for compositional nonblocking verification of extended finite-state machines
inferred← citeshttps://doi.org/10.1007/s10626-019-00305-wopenalex-snapshot
On the computation of counterexamples in compositional nonblocking verification
inferred← citeshttps://doi.org/10.1007/s10626-023-00378-8openalex-snapshot
A survey on compositional algorithms for verification and synthesis in supervisory control
inferred← citeshttps://doi.org/10.1007/s10626-026-00434-zopenalex-snapshot
Unified bisimulation applied to incremental abstraction of Petri nets
inferred← citeshttps://doi.org/10.1007/s10703-021-00360-wopenalex-snapshot
Compositional verification of concurrent systems by combining bisimulations
inferred← citeshttps://doi.org/10.1007/s11768-014-4097-8openalex-snapshot
Progressive events in supervisory control and compositional verification
inferred← citeshttps://doi.org/10.1016/j.automatica.2016.10.012openalex-snapshot
Compositional synthesis of supervisors in the form of state machines and state maps
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.08.025openalex-snapshot
Compositional Minimization in Span(Graph): Some Examples
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.068openalex-snapshot
An Equivalence Based Method for Compositional Verification of the Linear Temporal Logic of Constraint Automata
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.08.008openalex-snapshot
Compositional Failure-based Equivalence of Constraint Automata
inferred← citeshttps://doi.org/10.1016/j.scico.2015.05.010openalex-snapshot
An algorithm for compositional nonblocking verification using special events
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.11.018openalex-snapshot
Bisimulation relations for weighted automata
inferred← citeshttps://doi.org/10.1016/s0140-3664(99)00223-6openalex-snapshot
Test generation for interworking systems
inferred← citeshttps://doi.org/10.1023/a:1008645800955openalex-snapshot
Behaviour Analysis of Distributed Systems Using the Tracta Approach
inferred← citeshttps://doi.org/10.1023/a:1008771008310openalex-snapshot
Symbolic Protocol Verification with Queue BDDs
inferred← citeshttps://doi.org/10.1023/a:1014573629895openalex-snapshot
The Automata-Theoretic Approach to Verification of Reactive Systems
inferred← citeshttps://doi.org/10.1023/a:1015669415634openalex-snapshot
Efficient Computation and Representation of Large Reachability Sets for Composed Automata
inferred← citeshttps://doi.org/10.1080/00207160902915886openalex-snapshot
Failure-based equivalence of constraint automata
inferred← citeshttps://doi.org/10.1109/32.265633openalex-snapshot
A new structural induction theorem for rings of temporal Petri nets
inferred← citeshttps://doi.org/10.1109/32.965343openalex-snapshot
Apportioning: a technique for efficient reachability analysis of concurrent object-oriented programs
inferred← citeshttps://doi.org/10.1109/acc.2000.876984openalex-snapshot
Incremental system verification and synthesis of minimally restrictive behaviours
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/ccece.2000.849658openalex-snapshot
Hierarchical interface-based non-blocking verification
inferred← citeshttps://doi.org/10.1109/coase.2015.7294182openalex-snapshot
Advanced selfloop removal in compositional nonblocking verification of discrete event systems
inferred← citeshttps://doi.org/10.1109/compsac.2007.153openalex-snapshot
Model Checking of Component Connectors
inferred← citeshttps://doi.org/10.1109/hipc.1998.737980openalex-snapshot
Apportioning: a technique for efficient reachability analysis of concurrent object-oriented programs
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/iccad.1992.279379openalex-snapshot
Automatic compositional minimization in CTL model checking
inferred← citeshttps://doi.org/10.1109/lics.1996.561318openalex-snapshot
Symbolic protocol verification with queue BDDs
inferred← citeshttps://doi.org/10.1109/tcad.2008.923104openalex-snapshot
A Compositional Method With Failure-Preserving Abstraction for Asynchronous Design 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/tse.2002.1010062openalex-snapshot
Incremental integration testing of concurrent programs
inferred← citeshttps://doi.org/10.1109/tse.2005.99openalex-snapshot
Automated aspect-oriented decomposition of process-control systems for ultra-high dependability assurance
inferred← citeshttps://doi.org/10.1145/1292316.1292329openalex-snapshot
Compositional failure-based semantic equivalences for Reo specifications
inferred← citeshttps://doi.org/10.1145/129712.129738openalex-snapshot
Online minimization of transition systems (extended abstract)
inferred← citeshttps://doi.org/10.1145/167049.167071openalex-snapshot
Enhancing compositional reachability analysis with context constraints
inferred← citeshttps://doi.org/10.1145/177492.177725openalex-snapshot
Model checking and modular verification
inferred← citeshttps://doi.org/10.1145/1882291.1882301openalex-snapshot
Staged concurrent program analysis
inferred← citeshttps://doi.org/10.1145/222124.222149openalex-snapshot
Compositional reachability analysis of finite-state distributed systems with user-specified constraints
inferred← citeshttps://doi.org/10.1145/226295.226298openalex-snapshot
An incremental approach to structural testing of concurrent software
inferred← citeshttps://doi.org/10.1145/235321.235323openalex-snapshot
Context constraints for compositional reachability analysis
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/295558.295570openalex-snapshot
Checking safety properties using compositional reachability analysis
inferred← citeshttps://doi.org/10.1145/350887.350893openalex-snapshot
Using a coordination language to specify and analyze systems containing mobile components
inferred← citeshttps://doi.org/10.1145/940071.940105openalex-snapshot
Towards scalable compositional analysis by refactoring design models
inferred← citeshttps://doi.org/10.1145/940071.940109openalex-snapshot
Verified systems by composition from verified components
inferred← citeshttps://doi.org/10.18453/rosdok_id00000716openalex-snapshot
Correctness of services and their composition
inferred← citeshttps://doi.org/10.2168/lmcs-3(2:4)2007openalex-snapshot
Transforming structures by set interpretations
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.3182/20140514-3-fr-4046.00039openalex-snapshot
An Algorithm for Compositional Nonblocking Verification of Extended Finite-State Machines
inferred← citeshttps://doi.org/10.48550/arxiv.1409.2356openalex-snapshot
An Operational Semantics for Activity Diagrams using SMV
inferred← citeshttps://doi.org/10.48550/arxiv.1409.6578openalex-snapshot
MontiArc - Architectural Modeling of Interactive Distributed and Cyber-Physical Systems
inferred← citeshttps://doi.org/10.5555/227726.227755openalex-snapshot
Checking subsystem safety properties in compositional reachability analysis
inferred← citeshttps://doi.org/10.5555/257734.257792openalex-snapshot
An integrated method for effective behaviour analysis of distributed systems
inferred← citeshttps://doi.org/10.5555/304032.304080openalex-snapshot
Automatic compositional minimization in CTL model checking
inferred← citeshttps://doi.org/10.5555/380921.380934openalex-snapshot
Verification experiments on the MASCARA protocol
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95294openalex-snapshot
Bounded model checking for asynchronous concurrent systems
inferred← citeshttps://doi.org/10.70675/40e21541za82dz4933z9d60zf6d91f0b5801openalex-snapshot
Abstraction techniques for verification of concurrent systems
inferred← citeshttps://doi.org/10.70675/4731b3aezfbdaz4b44z8a23z8453dbb0b410openalex-snapshot
Modélisation et Vérification Formelles de Systèmes de Contrôle de Trains
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.