On the public citation graph

Synthesis of communicating processes from Temporal Logic specifications

https://doi.org/10.1007/bfb0025786
0 signed · 98 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-86718-7openalex-snapshot
First-Order Logic
inferredcites →https://doi.org/10.1007/978-3-7091-7664-1openalex-snapshot
Temporal Logic
inferredcites →https://doi.org/10.1093/acprof:oso/9780198243113.001.0001openalex-snapshot
Past, Present and Future
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/sfcs.1977.32openalex-snapshot
The temporal logic of programs
inferredcites →https://doi.org/10.1109/sfcs.1981.44openalex-snapshot
Temporal logic can be more expressive
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/359576.359585openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness
inferredcites →https://doi.org/10.1145/567532.567551openalex-snapshot
The temporal logic of branching time
inferredcites →https://doi.org/10.1145/800182.810398openalex-snapshot
SYNVER
inferredcites →https://doi.org/10.21236/ada015842openalex-snapshot
Path Expressions
inferredcites →https://doi.org/10.21236/ada106750openalex-snapshot
Verification of Concurrent Programs. Part I. The Temporal Framework,

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781119991472.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/j.1538-7305.1984.tb00089.xopenalex-snapshot
Papers by AT&T Bell Laboratories Authors
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_377openalex-snapshot
A low level language for obtaining decision procedures for classes of temporal logics
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_380openalex-snapshot
An interval-based temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-12920-0_26openalex-snapshot
Algebre de machines et logique temporelle
inferred← citeshttps://doi.org/10.1007/3-540-16444-8_14openalex-snapshot
Decidability in pratt's process logics
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_55openalex-snapshot
Synthesis of Uninitialized Systems
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_17openalex-snapshot
Model Checking of Safety Properties
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_36openalex-snapshot
Model Checking Based on Sequential ATPG
inferred← citeshttps://doi.org/10.1007/3-540-50302-1_3openalex-snapshot
Timed specifications for the development of real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-50403-6_36openalex-snapshot
A graphical representation of interval logic
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_22openalex-snapshot
Temporal logic with fixed points
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_23openalex-snapshot
On the relation of programs and computations to models of temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-58976-7_3openalex-snapshot
A combination of clausal and non clausal temporal logic programs
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_6openalex-snapshot
An automata-theoretic approach to linear temporal logic
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-4612-3462-3_3openalex-snapshot
Process Models for Discrete Event Systems
inferred← citeshttps://doi.org/10.1007/978-1-4615-6295-5_1openalex-snapshot
Modeling And Synthesis of Synchronous System-Level Specifications
inferred← citeshttps://doi.org/10.1007/978-1-4615-9385-0_8openalex-snapshot
On the Description of Database Transition Constraints Using Temporal Languages
inferred← citeshttps://doi.org/10.1007/978-3-031-30826-0openalex-snapshot
Fundamental Approaches to Software Engineering
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_1openalex-snapshot
Introduction to Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_18openalex-snapshot
Bounded Synthesis for Streett, Rabin, and $$\text {CTL}^{*}$$
inferred← citeshttps://doi.org/10.1007/978-94-011-0305-3_20openalex-snapshot
On the Comparison of AI and DAI Based Planning Techniques for Automated Manufacturing Systems
inferred← citeshttps://doi.org/10.1007/978-94-015-8533-0_6openalex-snapshot
Implicit and Explicit Definability in Modal and Temporal Logics
inferred← citeshttps://doi.org/10.1007/bf00971204openalex-snapshot
Temporal logics with “the next” operator do not have interpolation or the Beth property
inferred← citeshttps://doi.org/10.1007/bf01880326openalex-snapshot
TABLEAUX: A general theorem prover for modal logics
inferred← citeshttps://doi.org/10.1007/bf02432150openalex-snapshot
A decision procedure for combinations of propositional temporal logic and other specialized theories
inferred← citeshttps://doi.org/10.1007/bf02943361openalex-snapshot
Synthesis of communicating process skeletons from temporal-spatial logic specifications
inferred← citeshttps://doi.org/10.1007/bf03037053openalex-snapshot
Description and Reasoning of VLSI circuit in temporal logic
inferred← citeshttps://doi.org/10.1007/bfb0015772openalex-snapshot
The complementation problem for Büchi automata with applications to temporal logic
inferred← citeshttps://doi.org/10.1007/bfb0054268openalex-snapshot
Automated deduction of finite-state control programs for reactive systems
inferred← citeshttps://doi.org/10.1007/bfb0055625openalex-snapshot
Axioms for real-time logics
inferred← citeshttps://doi.org/10.1007/bfb0055640openalex-snapshot
It's about time: Real-time logics reviewed
inferred← citeshttps://doi.org/10.1007/s00165-019-00500-4openalex-snapshot
Zohar Manna (1939–2018)
inferred← citeshttps://doi.org/10.1007/s00236-016-0273-2openalex-snapshot
Assume-admissible synthesis
inferred← citeshttps://doi.org/10.1016/0066-4138(91)90009-zopenalex-snapshot
Explicit clock temporal logic in constraint checking for real-time systems
inferred← citeshttps://doi.org/10.1016/0167-6423(83)90017-5openalex-snapshot
Using branching time temporal logic to synthesize synchronization skeletons
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90008-9openalex-snapshot
The complementation problem for Büchi automata with applications to 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/0306-4379(90)90039-ropenalex-snapshot
Specification and verification of temporal relationships in transaction modelling
inferred← citeshttps://doi.org/10.1016/b978-0-08-041698-4.50013-5openalex-snapshot
Explicit clock temporal logic in constraint checking for real-time systems *
inferred← citeshttps://doi.org/10.1016/b978-0-409-90186-3.50029-xopenalex-snapshot
Artificial Intelligence… ‘What Will Its Contributions Be to Process Control’?
inferred← citeshttps://doi.org/10.1016/b978-0-934613-63-7.50025-5openalex-snapshot
AN IMPLEMENTATION OF A MULTI-AGENT PLAN SYNCHRONIZER
inferred← citeshttps://doi.org/10.1016/b978-0-934613-67-5.50009-5openalex-snapshot
Reasoning About Plans and Actions
inferred← citeshttps://doi.org/10.1016/c2013-0-07700-6openalex-snapshot
Readings in Distributed Artificial Intelligence
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.01.029openalex-snapshot
Monitoring Algorithms for Metric Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80051-5openalex-snapshot
Temporal logic can be more expressive
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80014-0openalex-snapshot
11 Temporal logic
inferred← citeshttps://doi.org/10.1017/s0269888900004367openalex-snapshot
On distributed artificial intelligence
inferred← citeshttps://doi.org/10.1023/a:1011254632723openalex-snapshot
Model Checking of Safety Properties
inferred← citeshttps://doi.org/10.1023/a:1012781705048openalex-snapshot
Construction of an Automaton From a Formula of the Monadic First-Order Theory of Natural Numbers
inferred← citeshttps://doi.org/10.1023/a:1014573629895openalex-snapshot
The Automata-Theoretic Approach to Verification of Reactive Systems
inferred← citeshttps://doi.org/10.1109/26.3772openalex-snapshot
An algorithmic technique for protocol verification
inferred← citeshttps://doi.org/10.1109/acc.2016.7526478openalex-snapshot
Optimal control with regular objectives using an abstraction-refinement approach
inferred← citeshttps://doi.org/10.1109/aihas.1991.138467openalex-snapshot
Planning with events and states
inferred← citeshttps://doi.org/10.1109/hicss.1989.47986openalex-snapshot
An application of structural modeling and automated reasoning to concurrent program design
inferred← citeshttps://doi.org/10.1109/isic.1991.187347openalex-snapshot
Analysis and synthesis of discrete event systems using temporal logic
inferred← citeshttps://doi.org/10.1109/lics.1990.113767openalex-snapshot
Symbolic model checking: 10/sup 20/ states and beyond
inferred← citeshttps://doi.org/10.1109/lics.1996.561360openalex-snapshot
Relating word and tree automata
inferred← citeshttps://doi.org/10.1109/lics.1998.705645openalex-snapshot
Freedom, weakness, and determinism: from linear-time to branching-time
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.2005.53openalex-snapshot
Uniform Distributed Synthesis
inferred← citeshttps://doi.org/10.1109/sfcs.1983.51openalex-snapshot
Reasoning about infinite computation paths
inferred← citeshttps://doi.org/10.1109/tase.2011.45openalex-snapshot
Focus Game for Projection Temporal Logic
inferred← citeshttps://doi.org/10.1145/1055686.1055689openalex-snapshot
From linear time to branching time
inferred← citeshttps://doi.org/10.1145/1119439.1119443openalex-snapshot
Monodic temporal resolution
inferred← citeshttps://doi.org/10.1145/193173.195401openalex-snapshot
Oracles for checking temporal properties of concurrent systems
inferred← citeshttps://doi.org/10.1145/195274.195401openalex-snapshot
Oracles for checking temporal properties of concurrent systems
inferred← citeshttps://doi.org/10.1145/232616.232622openalex-snapshot
The building blocks for specifying communication behavior of complex objects
inferred← citeshttps://doi.org/10.1145/248052.248070openalex-snapshot
Synthesis of concurrent systems for an atomic read/atomic write model of computation
inferred← citeshttps://doi.org/10.1145/298595.298601openalex-snapshot
Controller synthesis for the “production cell” case study
inferred← citeshttps://doi.org/10.1145/567067.567080openalex-snapshot
Automatic verification of finite state concurrent system using temporal logic specifications
inferred← citeshttps://doi.org/10.1145/75277.75294openalex-snapshot
Synthesis of concurrent systems with many similar sequential processes (extended abstract)
inferred← citeshttps://doi.org/10.1145/800222.806733openalex-snapshot
A temporal logic for reasoning about partially ordered computations (Extended Abstract)
inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25807openalex-snapshot
Materialisation-Based Reasoning in DatalogMTL with Bounded Intervals
inferred← citeshttps://doi.org/10.18255/1818-1015-2018-5-506-524openalex-snapshot
On the Expressive Power of Some Extensions of Linear Temporal Logic
inferred← citeshttps://doi.org/10.18255/1818-1015-2020-4-428-441openalex-snapshot
On the Model Checking Problem for Some Extension of CTL*
inferred← citeshttps://doi.org/10.3103/s014641161907006xopenalex-snapshot
On the Expressive Power of Some Extensions of Linear Temporal Logic
inferred← citeshttps://doi.org/10.3103/s0146411621070051openalex-snapshot
On the Model Checking Problem for Some Extension of CTL*
inferred← citeshttps://doi.org/10.3390/computers9020027openalex-snapshot
Cognification of Program Synthesis—A Systematic Feature-Oriented Analysis and Future Direction
inferred← citeshttps://doi.org/10.37099/mtu.dc.etds/178openalex-snapshot
Automated design of self-stabilization
inferred← citeshttps://doi.org/10.3990/1.9789036534871openalex-snapshot
Compositional synthesis of safety controllers
inferred← citeshttps://doi.org/10.48550/arxiv.1808.09430openalex-snapshot
Reactive Synthesis: Branching Logics and Parameterized Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1911.03807openalex-snapshot
Synthesis of coordination programs from linear temporal logic
inferred← citeshttps://doi.org/10.7146/brics.v7i22.20149openalex-snapshot
Using Automata in Control Synthesis. A Case Study
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.