Synthesis of Communicating Processes from Temporal Logic Specifications
From MaRDI portal
(Redirected from Publication:3673090)
Cited in
(46)- Specification and verification of database dynamics
- A decision procedure for combinations of propositional temporal logic and other specialized theories
- Complementing deterministic Büchi automata in polynomial time
- Synthesis of communicating process skeletons from temporal-spatial logic specifications
- The complexity of reasoning about knowledge and time. I: Lower bounds
- Characterizing finite Kripke structures in propositional temporal logic
- Factorisation of finite state machines under strong and observational equivalences
- Control machines: A new model of parallelism for compositional specifications and their effective compilation
- Resolution for some first-order modal systems
- TABLEAUX: A general theorem prover for modal logics
- The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\)
- On undecidability of propositional temporal logics on trace systems
- Submodule construction as equation solving in CCS
- Proving partial order properties
- Fair Petri nets and structural induction for rings of processes
- A temporal logic-based approach for the description of object behavior evolution
- Supervisory control and reactive synthesis: a comparative introduction
- Verification by augmented finitary abstraction
- Inductive synthesis of recursive processes from logical properties
- MetateM: An introduction
- Reactive synthesis from interval temporal logic specifications
- Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\)
- Maintenance goals of agents in a dynamic environment: formulation and policy construction
- From complementation to certification
- Graph Games and Reactive Synthesis
- Compositional Control Synthesis for Partially Observable Systems
- Synthesis of large dynamic concurrent programs from dynamic specifications
- Inferring Synchronization under Limited Observability
- TTL : a formalism to describe local and global properties of distributed systems
- Decidability and incompleteness results for first-order temporal logics of linear time
- Towards a notion of unsatisfiable and unrealizable cores for LTL
- Synthesis of Reactive(1) designs
- Property-oriented expansion
- Unifying models
- Decidability for a temporal logic used in discrete-event system analysis
- Converting a Büchi alternating automaton to a usual nondeterministic one
- Automated synthesis of asynchronizations
- Construction of deterministic transition graphs from dynamic integrity constraints
- ACoRe: automated goal-conflict resolution
- Hierarchical verification using verification diagrams
- Automated temporal reasoning about reactive systems
- An automata-theoretic approach to linear temporal logic
- Synchronous counting and computational algorithm design
- Theoretical foundations of handling large substitution sets in temporal integrity monitoring
- Transformation of dynamic integrity constraints into transaction specifications
- Defining, analysing and implementing communication protocols using attribute grammars
This page was built for publication: Synthesis of Communicating Processes from Temporal Logic Specifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3673090)
