On the public citation graph
The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic
0 signed · 72 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-10003-2_69openalex-snapshot
Characterizing correctness properties of parallel programs using fixpoints
inferredcites →https://doi.org/10.1007/3-540-17660-8_60openalex-snapshot
Characterizing Kripke structures in temporal logic
inferredcites →https://doi.org/10.1007/3-540-52148-8_2openalex-snapshot
Testing equivalence as a bisimulation equivalence
inferredcites →https://doi.org/10.1007/3-540-54430-5_100openalex-snapshot
Using truth-preserving reductions to improve the clarity of kripke-models
inferredcites →https://doi.org/10.1007/3-540-56689-9_54openalex-snapshot
Compositional state space generation
inferredcites →https://doi.org/10.1007/bf00268075openalex-snapshot
Specification-oriented semantics for Communicating Processes
inferredcites →https://doi.org/10.1016/0169-7552(87)90085-7openalex-snapshot
Introduction to the ISO specification language LOTOS
inferredcites →https://doi.org/10.1145/318593.318622openalex-snapshot
Checking that finite state concurrent programs satisfy their linear specification
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1999.1660openalex-snapshot
Selective Mu-Calculus and Formula-Based Equivalence of Transition Systems
inferred← citeshttps://doi.org/10.1007/11560647_36openalex-snapshot
Using Fairness Constraints in Process-Algebraic Verification
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_25openalex-snapshot
A Semantic Theory for Heterogeneous System Design
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_14openalex-snapshot
Liveness and Fairness in Process-Algebraic Verification
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_20openalex-snapshot
Weakest Congruence Results Concerning “Any-Lock”
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_20openalex-snapshot
Checking for CFFD-Preorder with Tester Processes
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_35openalex-snapshot
A Logical Viewpoint on Process-Algebraic Quotients
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_35openalex-snapshot
Weakest-Congruence Results for Livelock-Preserving Equivalences
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_33openalex-snapshot
On-the-fly verification with stubborn sets
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_39openalex-snapshot
Generation of reduced models for checking fragments of CTL
inferred← citeshttps://doi.org/10.1007/3-540-58152-9_29openalex-snapshot
Compositional analysis with place-bordered subnets
inferred← citeshttps://doi.org/10.1007/3-540-60630-0_7openalex-snapshot
Hierarchical compression for model-checking CSP or how to check 1020 dining philosophers for deadlock
inferred← citeshttps://doi.org/10.1007/3-540-60973-3_90openalex-snapshot
Visual verification of safety and liveness
inferred← citeshttps://doi.org/10.1007/3-540-61363-3_3openalex-snapshot
Compositionality in state space verification methods
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_8openalex-snapshot
Using compositional preorders in the verification of sliding window protocol
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-35079-0_16openalex-snapshot
Model Reduction of Modules for State-Event Temporal Logics
inferred← citeshttps://doi.org/10.1007/978-0-387-35079-0_24openalex-snapshot
Model Checking Based on Occurrence Net Graph
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_22openalex-snapshot
Failure-based Equivalences Are Faster Than Many Believe
inferred← citeshttps://doi.org/10.1007/978-3-030-00244-2_8openalex-snapshot
Progress Checking for Dummies
inferred← citeshttps://doi.org/10.1007/978-3-030-21485-2_5openalex-snapshot
Reward Testing Equivalences for Processes
inferred← citeshttps://doi.org/10.1007/978-3-030-98850-0_3openalex-snapshot
Hybrid Parallel Model Checking of Hybrid LTL on Hybrid State Space Representation
inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_12openalex-snapshot
Tampere Verification Tool
inferred← citeshttps://doi.org/10.1007/978-3-540-30476-0_19openalex-snapshot
Design and Evaluation of a Symbolic and Abstraction-Based Model Checker
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_7openalex-snapshot
New Results on the Analysis of Concurrent Systems with an Indefinite Number of Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-68746-7_20openalex-snapshot
MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-15240-5_3openalex-snapshot
The Coarsest Precongruences Respecting Safety and Liveness Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-24372-1_24openalex-snapshot
Self-Loop Aggregation Product — A New Hybrid Approach to On-the-Fly LTL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_13openalex-snapshot
All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs
inferred← citeshttps://doi.org/10.1007/978-3-642-34059-8_15openalex-snapshot
A Counterexample-Based Incremental and Modular Verification Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-38143-0_7openalex-snapshot
External Behaviour of Systems of State Machines with Variables
inferred← citeshttps://doi.org/10.1007/bf01211218openalex-snapshot
Compositional failure-based semantic models for Basic LOTOS
inferred← citeshttps://doi.org/10.1007/bfb0024669openalex-snapshot
Putting advanced reachability analysis techniques together: The “ARA” tool
inferred← citeshttps://doi.org/10.1007/s00236-015-0217-2openalex-snapshot
On constructibility and unconstructibility of LTS operators from other LTS operators
inferred← citeshttps://doi.org/10.1007/s00236-019-00364-4openalex-snapshot
All congruences below stability-preserving fair testing or CFFD
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00214-jopenalex-snapshot
The weakest deadlock-preserving congruence
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/s1571-0661(04)80412-2openalex-snapshot
Context-Sensitive Visibility
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80362-7openalex-snapshot
A Logical Process Calculus
inferred← citeshttps://doi.org/10.1080/00207160902915886openalex-snapshot
Failure-based equivalence of constraint automata
inferred← citeshttps://doi.org/10.1109/32.286423openalex-snapshot
Hierarchical reachability graph of bounded Petri nets for concurrent-software analysis
inferred← citeshttps://doi.org/10.1109/acsd.2008.4574600openalex-snapshot
Modular construction of the symbolic observation graph
inferred← citeshttps://doi.org/10.1109/acsd.2012.14openalex-snapshot
All Linear-Time Congruences for Finite LTSs and Familiar Operators
inferred← citeshttps://doi.org/10.1109/acsd.2016.15openalex-snapshot
The Congruences below Fair Testing with Initial Stability
inferred← citeshttps://doi.org/10.1109/codit62066.2024.10708172openalex-snapshot
Local Model Checking on a Modular System
inferred← citeshttps://doi.org/10.1109/compsac.2007.153openalex-snapshot
Model Checking of Component Connectors
inferred← citeshttps://doi.org/10.1109/compsac.2015.251openalex-snapshot
LTL Model Cheking of Service-Based Business Processes in the Cloud
inferred← citeshttps://doi.org/10.1109/csd.2003.1207709openalex-snapshot
Merging state-based and action-based verification
inferred← citeshttps://doi.org/10.1109/iceccs.2001.930166openalex-snapshot
Compositional construction of protocol behaviours with arbitrary channel capacities
inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-socialcom-sustaincom51426.2020.00028openalex-snapshot
SOG-Based Multi-Core LTL Model Checking
inferred← citeshttps://doi.org/10.1142/s0218194008003775openalex-snapshot
MODEL CHECKING OF COMPONENT BASED SOFTWARE USING COMPOSITIONAL REDUCTIONS
inferred← citeshttps://doi.org/10.1145/1292316.1292329openalex-snapshot
Compositional failure-based semantic equivalences for Reo specifications
inferred← citeshttps://doi.org/10.2168/lmcs-5(4:5)2009openalex-snapshot
Computation Tree Logic with Deadlock Detection
inferred← citeshttps://doi.org/10.2168/lmcs-9(4:11)2013openalex-snapshot
All Linear-Time Congruences for Familiar Operators
inferred← citeshttps://doi.org/10.4018/jwsr.2012100103openalex-snapshot
Generic and Specific Compatibility Criteria for Web Service Composition
inferred← citeshttps://doi.org/10.48550/arxiv.1106.5700openalex-snapshot
Combining Explicit and Symbolic Approaches for Better On-the-Fly LTL Model Checking
inferred← citeshttps://doi.org/10.70675/c91669c4zb1a6z454dza794z90289f80f53bopenalex-snapshot
Vérification parallèle de systémes concurrents en utilisant le Graphe d’Observation Symbolique
inferred← citeshttps://doi.org/10.70675/e2f846eezbcafz4543za309z6a60439b9888openalex-snapshot
Abstraction and modular verification of inter-enterprise business processes
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.