The following pages link to (Q3703299):
Displaying 50 items.
- Using transition systems to describe and predict the behaviour of structured excitable media (Q272779) (← links)
- Network-formation games with regular objectives (Q342715) (← links)
- Recent advances in program verification through computer algebra (Q351971) (← links)
- Reactive Turing machines (Q393091) (← links)
- Coping with selfish on-going behaviors (Q418112) (← links)
- Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
- Using formal methods with SysML in aerospace design and engineering (Q434438) (← links)
- Towards the hierarchical verification of reactive systems (Q596025) (← links)
- Information gain of black-box testing (Q640298) (← links)
- Compilation of the ELECTRE reactive language into finite transition systems (Q673127) (← links)
- A logical view of composition (Q685416) (← links)
- Robustness of temporal logic specifications for continuous-time signals (Q732015) (← links)
- Introduction to design choices in the semantics of Statecharts (Q750133) (← links)
- Coverage metrics for temporal logic model checking (Q853721) (← links)
- A polynomial dynamic system approach to software design for attractivity requirement (Q881898) (← links)
- Modal specifications for the control theory of discrete event systems (Q884763) (← links)
- Reconciling statechart semantics (Q1001804) (← links)
- Reactors: a data-oriented synchronous/asynchronous programming model for distributed applications (Q1004062) (← links)
- Reactive mode handling of flexible manufacturing systems (Q1005184) (← links)
- A metamodel for the design of polychronous systems (Q1014564) (← links)
- Specialisation of Prolog and FCP programs using abstract interpretation (Q1108783) (← links)
- Resolution-based approach to compatibility analysis of interacting automata (Q1127549) (← links)
- A denotational theory of synchronous reactive systems (Q1193599) (← links)
- Causal automata (Q1194329) (← links)
- A compositional axiomatization of statecharts (Q1194330) (← links)
- Detecting causal relationships in distributed computations: In search of the holy grail (Q1331790) (← links)
- An axiomatic semantics for the synchronous language Gentzen. (Q1400575) (← links)
- Reasoning about graded strategy quantifiers (Q1706169) (← links)
- Modification of the method of generation of control finite-state machines with continuous actions based on training examples (Q1742411) (← links)
- On disjunction of literals in triggers of statecharts transitions. (Q1853160) (← links)
- Module checking (Q1854407) (← links)
- Global view on reactivity: switch graphs and their logics (Q1935598) (← links)
- Automated verification of reactive and concurrent programs by calculation (Q2043817) (← links)
- Linear temporal logic -- from infinite to finite horizon (Q2147173) (← links)
- Monitorable hyperproperties of nonterminating systems (Q2168793) (← links)
- Implementing mixed-criticality synchronous reactive programs upon uniprocessor platforms (Q2251408) (← links)
- Design of reactive algorithms by solving equations over automata (Q2263188) (← links)
- Model checking and synthesis for branching multi-weighted logics (Q2423760) (← links)
- Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). I (Q2508787) (← links)
- Supervisory control of product and hierarchical discrete event systems (Q2511886) (← links)
- Concurrency in biological modeling: behavior, execution and visualization (Q2870303) (← links)
- Bridging the Gap between Two Concurrent Constraint Languages (Q3003518) (← links)
- Temporal Logic and Fair Discrete Systems (Q3176360) (← links)
- Enriched μ–Calculus Pushdown Module Checking (Q3498485) (← links)
- (Q4989409) (← links)
- Multi-Valued Reasoning about Reactive Systems (Q5060674) (← links)
- (Q5147341) (← links)
- (Q5150130) (← links)
- Using Hoare Logic in a Process Algebra Setting (Q5164860) (← links)
- The tccp Interpreter (Q5170191) (← links)
