The following pages link to Luca Aceto (Q266855):
Displaying 50 items.
- A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases (Q266861) (← links)
- A characterization of finitary bisimulation (Q287256) (← links)
- A ground-complete axiomatization of stateless bisimilarity over Linda (Q477631) (← links)
- On the axiomatizability of priority. II (Q549169) (← links)
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- A complete axiomatization of timed bisimulation for a class of timed regular behaviours (Q672231) (← links)
- Bisimilarity is not finitely based over BPA with interrupt (Q860878) (← links)
- The equational theory of prebisimilarity over basic CCS with divergence (Q975471) (← links)
- On the expressibility of priority (Q975534) (← links)
- A note on an expressiveness hierarchy for multi-exit iteration (Q1014386) (← links)
- A complete equational axiomatization for MPA with string iteration (Q1274456) (← links)
- On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based (Q1274921) (← links)
- Turning SOS rules into equations (Q1327393) (← links)
- A static view of localities (Q1329199) (← links)
- GSOS and finite labelled transition systems (Q1331924) (← links)
- Adding action refinement to a finite process algebra (Q1342519) (← links)
- An equational axiomatization for multi-exit iteration (Q1369097) (← links)
- The power of reachability testing for timed automata (Q1399974) (← links)
- A framework for parameterized monitorability (Q1652982) (← links)
- CCS with Hennessy's merge has no finite-equational axiomatization (Q1763725) (← links)
- Corrigendum: ``A domain equation for bisimulation'' by S. Abramsky (Q1854414) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- The max-plus algebra of the natural numbers has no finite equational basis (Q1870591) (← links)
- Equational theories of tropical semirings (Q1874279) (← links)
- Axiomatizing prefix iteration with silent steps (Q1923086) (← links)
- Timing and causality in process algebra (Q1924998) (← links)
- Resource bisimilarity and graded bisimilarity coincide (Q1944040) (← links)
- Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet (Q1944909) (← links)
- The complexity of identifying characteristic formulae (Q1987735) (← links)
- On bidirectional runtime enforcement (Q2117010) (← links)
- Axiomatizing recursion-free, regular monitors (Q2141297) (← links)
- Monitoring hyperproperties with circuits (Q2165208) (← links)
- On the axiomatisability of priority. III: Priority strikes again (Q2193294) (← links)
- Determinizing monitors for HML with recursion (Q2291832) (← links)
- Towards action-refinement in process algebras (Q2365760) (← links)
- On the complexity of determinizing monitors (Q2399244) (← links)
- Monitorability for the Hennessy-Milner logic with recursion (Q2402551) (← links)
- A unified rule format for bounded nondeterminism in SOS with terms as labels (Q2403821) (← links)
- When are prime formulae characteristic? (Q2422016) (← links)
- Logical characterisations, rule formats and compositionality for input-output conformance simulation (Q2423772) (← links)
- SOS rule formats for idempotent terms and idempotent unary operators (Q2436519) (← links)
- Axiomatizing weak simulation semantics over BCCSP (Q2453533) (← links)
- CPO models for compact GSOS languages (Q2506486) (← links)
- Characteristic Formulae for Timed Automata (Q2729632) (← links)
- (Q2736337) (← links)
- (Q2760240) (← links)
- (Q2762495) (← links)
- (Q2769423) (← links)
- Rule Formats for Bounded Nondeterminism in Structural Operational Semantics (Q2796231) (← links)
- (Q2847402) (← links)
